Submission #2501378


Source Code Expand

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;

int len , K , sa[5005] , rk[5005] , he[5005] ;
int tp[5005] , buc[5005] ;
char ss[5005] ;

bool cmp( int *rk , int x , int y , int d ){
	return rk[x] != rk[y] || ( rk[x] == rk[y] && rk[x+d] != rk[y+d] ) ;
}

void Rsort( int *tp , int *rk , int M ){
	for( int i = 0 ; i <= M ; i ++ ) buc[i] = 0 ;
	for( int i = 1 ; i <= len ; i ++ ) buc[ rk[i] ] ++ ;
	for( int i = 1 ; i <= M ; i ++ ) buc[i] += buc[i-1] ;
	for( int i = len ; i ; i -- ) sa[ buc[rk[tp[i]]] -- ] = tp[i] ;
}

void getSA(){
	int *tp = ::tp , *rk = ::rk , m = 127 ;
	for( int i = 1 ; i <= len ; i ++ ) tp[i] = i , rk[i] = ss[i] ;
	Rsort( tp , rk , m ) ;
	for( int l = 1 , p = 0 ; ; l <<= 1 , p = 0 ){
		for( int i = len - l + 1 ; i <= len ; i ++ ) tp[++p] = i ;
		for( int i = 1 ; i <= len ; i ++ )
			if( sa[i] > l ) tp[++p] = sa[i] - l ;
		Rsort( tp , rk , m ) , swap( tp , rk ) , rk[ sa[1] ] = 1 ;
		for( int i = 2 ; i <= len ; i ++ )
			rk[ sa[i] ] = rk[ sa[i-1] ] + cmp( tp , sa[i] , sa[i-1] , l ) ;
		if( rk[ sa[len] ] == len ) break ;
		m = rk[ sa[len] ] ;
	} if( rk != ::rk ) memcpy( ::rk , rk , sizeof( rk ) ) ;
	for( int i = 1 , j , k = 0 ; i <= len ; he[rk[i]] = k , i ++ )
		for( k=k?k-1:k , j = sa[rk[i]-1] ; ss[i+k] == ss[j+k] ; k ++ ) ;
}

pair<int,int> Query( int K ){
	for( int i = 1 ; i <= len ; i ++ ){
		if( len - sa[i] - he[i] + 1 >= K )
			return make_pair( sa[i] , sa[i] + he[i] + K - 1 ) ;
		else K -= len - sa[i] - he[i] + 1 ;
	}
}

void solve(){
	len = strlen( ss + 1 ) ;
	getSA() ;
	pair<int,int> intval = Query( K ) ;
	for( int i = intval.first ; i <= intval.second ; i ++ )
		printf( "%c" , ss[i] ) ;
}

int main(){
	scanf( "%s%d" , ss + 1 , &K ) ;
	solve() ;
}

Submission Info

Submission Time
Task C - K-th Substring
User Izumihanako
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1792 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:56:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf( "%s%d" , ss + 1 , &K ) ;
                                ^

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 128 KB
0_001.txt AC 1 ms 128 KB
0_002.txt AC 1 ms 128 KB
1_003.txt AC 1 ms 128 KB
1_004.txt AC 1 ms 128 KB
1_005.txt AC 1 ms 128 KB
1_006.txt AC 1 ms 128 KB
1_007.txt AC 1 ms 128 KB
1_008.txt AC 1 ms 128 KB
1_009.txt AC 1 ms 128 KB
1_010.txt AC 1 ms 128 KB
2_011.txt AC 1 ms 256 KB
2_012.txt AC 1 ms 256 KB
2_013.txt AC 1 ms 256 KB
2_014.txt AC 1 ms 256 KB
2_015.txt AC 1 ms 256 KB
2_016.txt AC 1 ms 256 KB
2_017.txt AC 1 ms 256 KB
2_018.txt AC 1 ms 256 KB