Submission #2634307


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
template <typename T> void chkmax(T &x, T y) {x = max(x, y); }
template <typename T> void chkmin(T &x, T y) {x = min(x, y); } 
template <typename T> void read(T &x) {
	x = 0; int f = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
template <typename T> void write(T x) {
	if (x < 0) x = -x, putchar('-');
	if (x > 9) write(x / 10);
	putchar(x % 10 + '0');
}
template <typename T> void writeln(T x) {
	write(x);
	puts("");
}
char s[MAXN];
int n, k, now[MAXN];
bool better(int a, int lena, int b, int lenb) {
	if (lena == -1) return false;
	if (lenb == -1) return true;
	int len = min(lena, lenb);
	for (int i = 1; i <= len; i++) {
		if (s[a + i - 1] < s[b + i - 1]) return true;
		if (s[a + i - 1] > s[b + i - 1]) return false;
	}
	return lena < lenb;
}
bool equal(int a, int b, int len) {
	for (int i = 1; i <= len; i++)
		if (s[a + i - 1] != s[b + i - 1]) return false;
	return true;
}
int main() {
	scanf("%s", s + 1);
	n = strlen(s + 1); read(k);
	for (int i = 1; i <= n; i++)
		now[i] = 1;
	while (true) {
		int pos = 0, len = -1;
		for (int i = 1; i <= n; i++)
			if (better(i, now[i], pos, len)) pos = i, len = now[i];
		for (int i = 1; i <= n; i++)
			if (len == now[i] && equal(pos, i, len)) {
				now[i]++;
				if (i + now[i] - 1 > n) now[i] = -1;
			}
		if (--k == 0) {
			for (int i = 1; i <= len; i++)
				printf("%c", s[pos + i - 1]);
			printf("\n");
			return 0;
		}
	}
	return 0;
}

Submission Info

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

Compile Error

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

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 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 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