# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236388 | 2020-06-01T18:13:16 Z | gurkot | Type Printer (IOI08_printer) | C++14 | 39 ms | 1528 KB |
#include <iostream> #include <algorithm> #include <cstring> using namespace std; char S[21]; struct Word{ char s[21];}; bool operator <(Word a, Word b){ int ka=0,kb=0; int la=strlen(a.s), lb=strlen(b.s); for (int i=0;i<la;i++) if (a.s[i]==S[i]) ka++; else break; for (int i=0;i<lb;i++) if (b.s[i]==S[i]) kb++; else break; return ka<kb || ka==kb && strcmp(a.s,b.s)<0; } Word word[25001]; int n,lmax,l,lans; char ans[100001]; main(){ scanf("%d",&n); for (int i=0;i<n;i++) { scanf("%s",word[i].s); l=strlen(word[i].s); if (lmax<l){ lmax=l; strcpy(S,word[i].s); } } sort(word,word+n); lans=0; for (int i=0;i<strlen(word[0].s);i++) ans[lans++]=word[0].s[i]; ans[lans++]='P'; for (int i=1;i<n;i++){ int k=0; for (int j=0;j<min(strlen(word[i-1].s),strlen(word[i].s));j++) if(word[i-1].s[j]==word[i].s[j]) k++; else break; l=strlen(word[i-1].s); for (int j=1;j<=l-k;j++) ans[lans++]='-'; for (int j=k;j<strlen(word[i].s);j++) ans[lans++]=word[i].s[j]; ans[lans++]='P'; } printf("%d\n",lans); for (int i=0;i<lans;i++) printf("%c\n",ans[i]); } /* 3 print the poem */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 256 KB | Output is correct |
2 | Correct | 4 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 384 KB | Output is correct |
2 | Correct | 4 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 384 KB | Output is correct |
2 | Correct | 4 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 384 KB | Output is correct |
2 | Correct | 4 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | Output is correct |
2 | Correct | 5 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 384 KB | Output is correct |
2 | Correct | 6 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 512 KB | Output is correct |
2 | Incorrect | 16 ms | 776 KB | Line "" doesn't correspond to pattern "[a-z\-P]{1}" |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 17 ms | 896 KB | Line "5" doesn't correspond to pattern "[a-z\-P]{1}" |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 39 ms | 1528 KB | Line "&" doesn't correspond to pattern "[a-z\-P]{1}" |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 36 ms | 1528 KB | Line "" doesn't correspond to pattern "[a-z\-P]{1}" |
2 | Halted | 0 ms | 0 KB | - |