# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105552 | 2019-04-13T12:31:02 Z | wilwxk | Type Printer (IOI08_printer) | C++11 | 13 ms | 6528 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN=5e4+3; int g[25003][30]; int dp[25003][2]; short especial[MAXN]; short ruim[MAXN]; char letra[MAXN]; int n, contv=0; vector<char> resp; int novo(char c) { letra[++contv]=c; return contv; } void adiciona(char c[]) { int m=strlen(c); int cur=0; for(int i=0; i<m; i++) { if(g[cur][c[i]-'a']==-1) g[cur][c[i]-'a']=novo(c[i]-'a'); cur=g[cur][c[i]-'a']; } especial[cur]=1; // printf("c %d\n", cur); } int predfs(int cur, int p) { int melhor=0; int cara=-1; for(int i=0; i<30; i++) { int viz=g[cur][i]; if(viz==-1) continue; int val=predfs(viz, cur); if(val>melhor) melhor=val, cara=viz; } ruim[cur]=cara; return melhor+1; } void dfs(int cur, int p, int k) { // printf("%d > %d\n", cur, ruim[cur]); if(cur!=0) resp.push_back(letra[cur]+'a'); if(especial[cur]) resp.push_back('P'); for(int i=0; i<30; i++) { int viz=g[cur][i]; if(viz==-1) continue; if(viz==ruim[cur]) continue; dfs(viz, cur, 1); } if(ruim[cur]!=-1) dfs(ruim[cur], cur, k); if(k) resp.push_back('-'); } int main() { memset(g, -1, sizeof(g)); scanf("%d", &n); for(int i=1; i<=n; i++) { char c[30]; scanf(" %s", c); adiciona(c); } predfs(0, 0); dfs(0, 0, 0); printf("%d\n", resp.size()); for(auto cur : resp) printf("%c\n", cur); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 3328 KB | Output is correct |
2 | Correct | 5 ms | 3200 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 3328 KB | Output is correct |
2 | Correct | 5 ms | 3300 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 3200 KB | Output is correct |
2 | Correct | 5 ms | 3200 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 3200 KB | Output is correct |
2 | Correct | 4 ms | 3328 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 3200 KB | Output is correct |
2 | Correct | 6 ms | 3328 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 3328 KB | Output is correct |
2 | Correct | 6 ms | 3328 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 3584 KB | Output is correct |
2 | Runtime error | 12 ms | 6528 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 11 ms | 6500 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 11 ms | 6400 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 12 ms | 6528 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |