# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197631 | 2020-01-22T04:46:14 Z | Sakamotoo | Type Printer (IOI08_printer) | C++14 | 1000 ms | 138956 KB |
#include<bits/stdc++.h> #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; typedef tree < long long , null_type , less<long long> , rb_tree_tag , tree_order_statistics_node_update > ordered_set; #define mp make_pair #define fi first #define se second //mt19937 rng(time(NULL)); //int mt19937_64 rng(time(NULL)); //Long Long //shuffle(a.begin(),a.end(),rng); //shuffle //rng(); //random struct node{ vector<int> v; node *c[30]; node *b; int cnt=0; int maxi=0; }; node *root= new node; void ins(string s){ node *now=root; for(int i=0; i<s.size(); i++){ int ind=s[i]-'a'+1; if(now->c[ind]==NULL){ now->c[ind]=new node; now->c[ind]->b=now; now->v.push_back(ind); } now=now->c[ind]; now->maxi=max(now->maxi,(int)s.size()-i); } now->cnt++; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n; cin>>n; for(int i=1; i<=n; i++){ string s; cin>>s; ins(s); } int pri=0; node *now=root; vector<char> v; while(true){ if(pri==n) break; if(now->cnt>0){ now->cnt--; v.push_back('P'); pri++; continue; } int ind=0; int lol=1e9; int wkwk=now->v.size(); int sk=0; for(int j=0; j<wkwk; j++){ int i=now->v[j]; if(now->c[i]==NULL){ }else if(now->c[i]->maxi<lol){ sk=j; ind=i; lol=now->c[i]->maxi; } } if(ind==0){ v.push_back('-'); now=now->b; }else { v.push_back('a'+ind-1); now->v.erase(now->v.begin()+sk); now=now->c[ind]; } } cout<<v.size()<<endl; for(int i=0; i<v.size(); i++){ cout<<v[i]<<endl; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 380 KB | Output is correct |
2 | Correct | 3 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 504 KB | Output is correct |
2 | Correct | 23 ms | 1656 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 41 ms | 2680 KB | Output is correct |
2 | Correct | 50 ms | 3164 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 144 ms | 8312 KB | Output is correct |
2 | Correct | 318 ms | 17592 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 382 ms | 20728 KB | Output is correct |
2 | Correct | 111 ms | 4600 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 955 ms | 51576 KB | Output is correct |
2 | Execution timed out | 1078 ms | 116988 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 779 ms | 39852 KB | Output is correct |
2 | Execution timed out | 1058 ms | 138956 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |