# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
314363 | 2020-10-19T18:39:57 Z | ShiftyBlock | Type Printer (IOI08_printer) | C++11 | 690 ms | 3056 KB |
#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); cout.tie(0); } } pair<int, string> arr[25001]; char s[25001][21]; int main() { setIO("printer", 0); int N; cin>>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(); int plen=arr[i-1].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()<<endl; for(char x: res){ cout<<x<<endl; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 1280 KB | printed invalid word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 1280 KB | printed invalid word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 1280 KB | printed invalid word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 1280 KB | printed invalid word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 1280 KB | printed invalid word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 1280 KB | printed invalid word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 94 ms | 1600 KB | printed invalid word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 270 ms | 2044 KB | printed invalid word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 690 ms | 3056 KB | printed invalid word |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 572 ms | 2988 KB | printed invalid word |
2 | Halted | 0 ms | 0 KB | - |