# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197616 | 2020-01-22T03:26:32 Z | Sakamotoo | Type Printer (IOI08_printer) | C++14 | 951 ms | 44404 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{ node *c[30]; int val=0; int awal=0; 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=now->c[ind]; now->val=1; 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; root->awal=1; for(int i=1; i<=n; i++){ string s; cin>>s; ins(s); } int pri=0; node *now=root; vector<char> v; while(true){ int ind=0; int lol=1e9; for(int i=1; i<=26; i++){ if(now->c[i]==NULL){ }else if(now->c[i]->val>0&&now->c[i]->maxi<lol){ ind=i; lol=now->c[i]->maxi; } } if(ind==0){ if(now->cnt>0){ now->cnt--; v.push_back('P'); pri++; }else{ v.push_back('-'); now=now->b; } }else { v.push_back('a'+ind-1); now=now->c[ind]; now->val--; } if(pri==n) break; } 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 | 3 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 376 KB | Output is correct |
2 | Incorrect | 2 ms | 376 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 504 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 42 ms | 2244 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 151 ms | 7188 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 382 ms | 17860 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 951 ms | 44404 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 772 ms | 34672 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |