baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-12-24 03:31:59 +00:00
Code Releases Activity

#1024. [NOIP 2018 四校联训 Round 11]子串

Browse Source 
https://sjzezoj.com/submission/36291
This commit is contained in:
Baoshuo Ren 2021-09-26 18:58:35 +08:00 committed by Baoshuo Ren
parent 317db1d887
commit 6451ba462c
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 44 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

44
S2OJ/1024/1024.cpp Normal file
View File

@ -0,0 +1,44 @@
#include <bits/stdc++.h>
using namespace std;
int n, k, p, trie[10000005][2], size[10000005];
char s[100005];
bool a[100005];
void calcsize(int u) {
if (trie[u][0]) calcsize(trie[u][0]);
if (trie[u][1]) calcsize(trie[u][1]);
size[u] += size[trie[u][0]] + size[trie[u][1]];
}
void print(int u, int k) {
if (u != 1 && k-- == 1) {
cout << endl;
exit(0);
}
if (size[trie[u][0]] >= k) {
cout << 0;
print(trie[u][0], k);
} else {
cout << 1;
print(trie[u][1], k - size[trie[u][0]]);
}
}
int main() {
cin >> n >> k >> s + 1;
for (int i = 1; i <= n; i++) {
a[i] = s[i] - '0';
}
p = 1;
for (int i = 1; i <= n; i++) {
int u = 1;
for (int j = i; j <= min(n, i + k - 1); j++) {
size[u = (trie[u][a[j]] ? trie[u][a[j]] : trie[u][a[j]] = ++p)] = 1;
}
}
calcsize(1);
print(1, k);
return 0;
}