Submission #3722177
Source Code Expand
#include<deque> #include<queue> #include<vector> #include<algorithm> #include<iostream> #include<set> #include<cmath> #include<tuple> #include<string> #include<chrono> #include<functional> #include<iterator> #include<random> #include<unordered_set> #include<array> #include<map> #include<iomanip> #include<assert.h> using namespace std; typedef long long int llint; typedef long double lldo; #define mp make_pair #define mt make_tuple #define pub push_back #define puf push_front #define pob pop_back #define pof pop_front #define fir first #define sec second #define res resize #define ins insert #define era erase //cout<<setprecision(20) //cin.tie(0); //ios::sync_with_stdio(false); const llint mod=1000000007; const llint big=4.19e18+1; const long double pai=3.141592653589793238462643383279502884197; const long double eps=1e-15; template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}} template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}} llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);} llint lcm(llint a,llint b){return a/gcd(a,b)*b;} template<class T> void SO(T& ve){sort(ve.begin(),ve.end());} template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());} int LBI(vector<int>&ar,llint in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();} int UBI(vector<int>&ar,llint in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();} int main(void){ string str;cin>>str; int K,i,j,n=str.size();cin>>K; vector<string>aaa; for(i=0;i<n;i++){ for(j=1;j<=K&&i+j<=n;j++){ aaa.pub(str.substr(i,j)); } } SO(aaa); aaa.erase(unique(aaa.begin(),aaa.end()),aaa.end()); //for(auto it:aaa){cerr<<it<<" ";} cout<<aaa[K-1]<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - K-th Substring |
User | kunito777 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1754 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 |
|
|
|
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 | 10 ms | 1660 KB |
2_015.txt | AC | 7 ms | 1280 KB |
2_016.txt | AC | 9 ms | 1660 KB |
2_017.txt | AC | 9 ms | 1660 KB |
2_018.txt | AC | 9 ms | 1660 KB |