Submission #2499750

Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

#include <stdlib.h>

int cmp(const void* a, const void* b) {
    return strcmp(*(char**)a, *(char**)b);
}
string solve(string& s, int k) {
    int L = s.size(); // 5000

    char w[5001];
    rep(i,L) w[i] = s[i]; w[L] = 0;

    char* p[5001];
    rep(i,L) p[i] = w+i;

    qsort((void*)p, (size_t)L, (size_t)sizeof(char*), &cmp);

    set<string> visited;
    int j = 0;
    rep(i,L){
        int w = strlen(p[i]);
        for(int l=1; l<=w; ++l){
            string s(p[i], p[i]+l);
            if (found(visited, s)) continue;
            visited.insert(s);
            //cerr << s << endl;
            if (++j == k) return s;
        }
    }
}

int main() {
    string s; cin >> s;
    int k; cin >> k;
    cout << solve(s,k) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - K-th Substring
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1863 Byte
Status
Exec Time 9 ms
Memory 380 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_000.txt, 0_001.txt, 0_002.txt
Subtask 200 / 200 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 100 / 100 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 1 ms 256 KB
0_001.txt 1 ms 256 KB
0_002.txt 2 ms 256 KB
1_003.txt 1 ms 256 KB
1_004.txt 2 ms 256 KB
1_005.txt 1 ms 256 KB
1_006.txt 1 ms 256 KB
1_007.txt 1 ms 256 KB
1_008.txt 2 ms 256 KB
1_009.txt 2 ms 256 KB
1_010.txt 2 ms 256 KB
2_011.txt 9 ms 380 KB
2_012.txt 9 ms 380 KB
2_013.txt 3 ms 380 KB
2_014.txt 3 ms 380 KB
2_015.txt 3 ms 380 KB
2_016.txt 3 ms 380 KB
2_017.txt 3 ms 380 KB
2_018.txt 3 ms 380 KB