# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314380 | ShiftyBlock | 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;
#define f first
#define s second
#define pii pair<int, int>
#define long long long
#define v vector
#define rep(i,a,b) for(int i=a; i<b; i++)
void setIO(string name, int submit) {
if (submit) {
ios_base::sync_with_stdio(0);
cin.tie(0);
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
else{
ios_base::sync_with_stdio(0);
cin.tie(0);
}
}
pair<int, string> arr[25001];
char s[25001][21];
int main() {
setIO("printer", 0);
int N;
scanf("%d", &N);
v<int> sim; sim.push_back(0);
int worst=0;
for (int i = 0; i < N; ++i)
{
scanf("%s",s[i]);
if(strlen(s[worst])<strlen(s[i])){
worst=i;
}
}
rep(i,0,N){
int same=0;
rep(j,0, strlen(s[i])){
if(s[worst][j]==s[i][j]) same++;
else break;
}
arr[i]= make_pair( same, s[i]);
}
sort(arr,arr+N );
v<char> res;
rep(i, 0,N){
int len=arr[i].s.size();
//cout<<arr[i].f<<endl;
if(i==0){
rep(j,0,len){
res.push_back(arr[i].s[j]);
}
res.push_back('P');
}
else{
int same=0;
rep(j,0,min(len,plen)){
if(arr[i].s[j]!=arr[i-1].s[j]) break;
same++;
}
rep(j,0, plen-same) {
res.push_back('-');
}
rep(j,same, len){
res.push_back(arr[i].s[j]);
}
res.push_back('P');
}
}
cout<<res.size()<<"\n";
for(char x: res){
cout<<x<<"\n";
}
return 0;
}