Submission #8329285


Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}

typedef long long ll;

int main() {
  string s;
  cin >> s;
  ll K;
  cin >> K;

  // 文字列sを辞書順に並べたとき、
  // K文字より大きい部分文字列はk番以内に入ることはない
  vector<string> substrings;
  for (ll i = 0; i < (ll)s.size(); i++) {
    for (ll j = 1; j <= K; j++) {
      substrings.push_back(s.substr(i,j));
    }
  }
  // 重複排除
  sort(substrings.begin(), substrings.end());
  substrings.erase(unique(substrings.begin(), substrings.end()), substrings.end());

  // 辞書順でk番目の連続する部分文字列
  cout << substrings[K - 1] << endl;
  return 0;
}

Submission Info

Submission Time
Task C - K-th Substring
User h_izu
Language C++14 (GCC 5.4.1)
Score 300
Code Size 868 Byte
Status AC
Exec Time 10 ms
Memory 1660 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 11
AC × 19
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
Subtask 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 2_011.txt, 2_012.txt, 2_013.txt, 2_014.txt, 2_015.txt, 2_016.txt, 2_017.txt, 2_018.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 1 ms 256 KB
1_005.txt AC 1 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt AC 1 ms 256 KB
1_008.txt AC 1 ms 256 KB
1_009.txt AC 1 ms 256 KB
1_010.txt AC 1 ms 256 KB
2_011.txt AC 7 ms 1660 KB
2_012.txt AC 7 ms 1660 KB
2_013.txt AC 9 ms 1532 KB
2_014.txt AC 9 ms 1660 KB
2_015.txt AC 7 ms 1280 KB
2_016.txt AC 10 ms 1660 KB
2_017.txt AC 9 ms 1660 KB
2_018.txt AC 9 ms 1660 KB