# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236602 | nickmet2004 | Type Printer (IOI08_printer) | C++11 | 0 ms | 0 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<bits/stdc++.h>
using namespace std;
const int N = 25005;
int n;
int mx , P , cnt;
char MX[21];
char ans[1000005];
struct word{char s[21];}Words[N];
bool operator<(const word& A , const word& B){
int prA = 0, prB = 0 , As = strlen(A.s) , Bs = strlen(B.s);
for(int i = 0; i < As; ++i){
if(A.s[i] != MX[i]) break; ++prA;
}
for(int i = 0; i < Bs; ++i){
if(B.s[i] != MX[i]) break; ++prB;
}
return prA < prB || prA == prB && strcmp(A.s , B.s) < 0;
}
int main (){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 0; i < n; ++i){
cin >> Words[i].s;
if(strlen(Words[i].s)> mx){mx = strlen(Words[i].s); MX = Words[i].s;}
}
sort(Words , Words + n);
cnt += strlen(Words[0].s);
for(int k = 0; k < strlen(Words[0].s); ++k) {ans[P] = Words[0].s[k]; ++P;} ans[P] = 'P'; ++P;
for(int i = 1; i < n; ++i){
int pr = 0;
for(int k = 0; k < min(strlen(Words[i].s) , strlen(Words[i - 1].s)); ++k){
if(Words[i].s[k] != Words[i-1].s[k]) break; pr++;
}
cnt += strlen(Words[i-1].s) - pr; cnt += strlen(Words[i].s) - pr;
for(int k = 1; k <= strlen(Words[i- 1].s) - pr; ++k){ans[P] = '-'; ++P;}
for(int k = pr; k < strlen(Words[i].s); ++k){ans[P] = Words[i].s[k]; ++P;}
ans[P] = 'P'; ++P;
}
cout << cnt + n << endl;
for(int i = 0; i < P; ++i) cout << ans[i] << endl;
return 0;
}