Submission #2796720
Source Code Expand
//----------------------------おまじない #pragma GCC optimize ("O3") #pragma GCC target ("tune=native") #pragma GCC target ("avx") //---------------------------- #define FOR(i,j,n) for (int i=(j);i<(n);i++) #define REP(i,n) for (int i=0;i<(n);i++) #define REPN(i,n) for (int i=(n);i>0;i--) #define I(n) scanf("%d", &(n)) #define LL(n) scanf("%lld", &(n)) #define pb(n) push_back((n)) #define mp(i,j) make_pair((i),(j)) #define eb(i,j) emplace_back((i),(j)) #include <bits/stdc++.h> using namespace std; //------------------------------typedef集 typedef vector<int> vi; typedef pair<int,int> pi; typedef vector<pi> vpi; typedef vector<vi> vvi; typedef vector<vpi> vvpi; typedef vector<vvi> vvvi; typedef long long ll; const int mod = 1000000009; string s; int k; string cand[6]; void check(int i,string s){ if (i==5) return; REP(i,6) if (s == cand[i]) return; if (cand[i] < s){ check(i+1,s); } else { string tmp = cand[i]; cand[i] = s; check(i+1,tmp); } } int main(){ REP(i,6) cand[i] = "zzzzzzzzzzzzzzzzzzzzzzz"; cin >> s; cin >> k; int ln = s.size(); REP(i,ln){ REP(j,5){ if (i < j) break; string substring = s.substr(i-j,j+1); check(0,substring); } } cout << cand[k-1] << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - K-th Substring |
User | omi |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1382 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 100 | ||||||
Status |
|
|
|
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 | 3 ms | 256 KB |
2_012.txt | AC | 3 ms | 256 KB |
2_013.txt | AC | 6 ms | 256 KB |
2_014.txt | AC | 6 ms | 256 KB |
2_015.txt | AC | 5 ms | 256 KB |
2_016.txt | AC | 6 ms | 256 KB |
2_017.txt | AC | 6 ms | 256 KB |
2_018.txt | AC | 6 ms | 256 KB |