# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445765 | 2021-07-19T14:07:44 Z | dxz05 | Type Printer (IOI08_printer) | C++14 | 1000 ms | 43212 KB |
#include <bits/stdc++.h> #pragma GCC optimize("Ofast") using namespace std; #define SZ(x) (int)(x).size() const int MAXN = 1e6 + 3e2; pair<int, string> str[MAXN]; int main(){ //ios_base::sync_with_stdio(false); //cin.tie(nullptr); cout.tie(nullptr); int n; scanf("%d", &n); int ind = 0; for (int i = 1; i <= n; i++){ char c[25]; scanf("%s", &c); int len = strlen(c); str[i].second.resize(len); for (int j = 0; j < len; j++) str[i].second[j] = c[j]; if (str[i].second.size() > str[ind].second.size()) ind = i; } string longest = str[ind].second; for (int i = 1; i <= n; i++){ int j = 0; while (j < str[i].second.size() && str[i].second[j] == longest[j]) j++; str[i].first = j; } sort(str + 1, str + n + 1); vector<char> ans; for (int it = 1; it <= n; it++){ string s = str[it].second, t = str[it - 1].second; if (SZ(t) > SZ(s)){ int need = SZ(t) - SZ(s); while (need--) ans.push_back('-'); t.resize(s.size()); } int cnt = 0; for (int i = 0; i < min(SZ(t), SZ(s)); i++){ if (t[i] == s[i]) cnt++; else break; } int need = max(0, SZ(t) - cnt); while (need--){ ans.push_back('-'); } for (int i = cnt; i < s.size(); i++){ ans.push_back(s[i]); } ans.push_back('P'); } cout << ans.size() << endl; for (char c : ans) cout << c << endl; return 0; } /** 3 print the poem */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 21 ms | 39408 KB | Output is correct |
2 | Correct | 21 ms | 39372 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 22 ms | 39364 KB | Output is correct |
2 | Correct | 20 ms | 39372 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 21 ms | 39420 KB | Output is correct |
2 | Correct | 21 ms | 39348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 39372 KB | Output is correct |
2 | Correct | 21 ms | 39436 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 39404 KB | Output is correct |
2 | Correct | 33 ms | 39472 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 42 ms | 39372 KB | Output is correct |
2 | Correct | 48 ms | 39508 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 104 ms | 39604 KB | Output is correct |
2 | Correct | 204 ms | 39904 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 239 ms | 40000 KB | Output is correct |
2 | Correct | 84 ms | 39748 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 543 ms | 40820 KB | Output is correct |
2 | Execution timed out | 1085 ms | 42672 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 448 ms | 40380 KB | Output is correct |
2 | Execution timed out | 1095 ms | 43212 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |