Submission #3007537


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define forx(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;


int main(){
    string s,t;
    cin>>s;
    int k;
    cin>>k;
    int n=s.size();
    vector<string>v;
    rep(i,n){
        t=s[i];
        v.push_back(t);
    }
    if(n>=2)rep(i,n-1){
        t=s[i]+s[i+1];
        v.push_back(t);
    }
    if(n>=3)rep(i,n-2){
        t=s[i]+s[i+1]+s[i+2];
        v.push_back(t);
    }
    if(n>=4)rep(i,n-3){
        t=s[i]+s[i+1]+s[i+2]+s[i+3];
        v.push_back(t);
    }
    if(n>=5)rep(i,n-4){
        t=s[i]+s[i+1]+s[i+2]+s[i+3];
        v.push_back(t);
    }
    sort(begin(v),end(v));
    unique(begin(v),end(v));
    cout<<v[k-1]<<endl;
    return 0;
}

Submission Info

Submission Time
Task C - K-th Substring
User tabr
Language C++14 (GCC 5.4.1)
Score 0
Code Size 814 Byte
Status WA
Exec Time 7 ms
Memory 1660 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 200 0 / 100
Status
AC × 1
WA × 2
AC × 1
WA × 10
AC × 1
WA × 18
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 WA 1 ms 256 KB
0_001.txt WA 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt WA 1 ms 256 KB
1_004.txt WA 1 ms 256 KB
1_005.txt WA 1 ms 256 KB
1_006.txt WA 1 ms 256 KB
1_007.txt WA 1 ms 256 KB
1_008.txt WA 1 ms 256 KB
1_009.txt WA 1 ms 256 KB
1_010.txt WA 1 ms 256 KB
2_011.txt WA 6 ms 1660 KB
2_012.txt WA 6 ms 1660 KB
2_013.txt WA 6 ms 1532 KB
2_014.txt WA 7 ms 1660 KB
2_015.txt WA 5 ms 1280 KB
2_016.txt WA 7 ms 1660 KB
2_017.txt WA 7 ms 1660 KB
2_018.txt WA 7 ms 1660 KB