# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
337311 | Giselus | Type Printer (IOI08_printer) | C++14 | 221 ms | 62720 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
#include<algorithm>
#include<vector>
#include<iostream>
using namespace std;
vector < vector < int > > L;
vector < int > Q;
vector < bool > odw;
//vector < vector < pair < int , char > > > L2;
vector < int > dp;
void DFS(int x, int r){
dp[x] = 1;
for(int i = 0 ; i < 26;i++){
if(L[x][i] && L[x][i] != r){
DFS(L[x][i],x);
dp[x] = max(dp[x],dp[L[x][i]] + 1);
}
}
//printf("%d %d\n",x,dp[x]);
}
void DFS2(int x, int r, bool pisz){
if(odw[x])
printf("P\n");
bool used = 0;
int last = 0;
for(int i = 0 ; i < 26;i++){
if(L[x][i] && L[x][i] != r){
if(!used && pisz == 0 && dp[L[x][i]] + 1 == dp[x]){
used = 1;
last = i;
}else{
printf("%c\n",i + 'a');
DFS2(L[x][i],x,1);
}
}
}
if(used){
printf("%c\n",last + 'a');
DFS2(L[x][last],x,0);
}
if(pisz)
printf("-\n");
}
int main(void){
int n,m,a,b,c,d,x;
string s;
char ch;
scanf("%d",&n);
L.resize(1);
L[0].resize(26);
odw.push_back(0);
int licznik = 0;
for(int i = 1; i<=n;i++){
cin >> s;
b = 0;
for(int a = 0 ;a < s.size();a++){
ch = s[a];
if(L[b][ch-'a']){
b = L[b][ch-'a'];
}else{
licznik++;
odw.push_back(0);
L[b][ch-'a'] = licznik;
L.push_back(Q);
L[licznik].resize(26);
b = licznik;
}
}
odw[b] = 1;
}
dp.resize(L.size());
DFS(0,0);
printf("%d\n",2*licznik-dp[0] + n + 1);
DFS2(0,0,0);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |