Submission #638976

#TimeUsernameProblemLanguageResultExecution timeMemory
638976zaneyuType Printer (IOI08_printer)C++14
10 / 100
56 ms36788 KiB
/*input 3 print print printt */ #include<bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set; //order_of_key #of elements less than x // find_by_order kth element using ll=long long; using ld=long double; using pii=pair<int,int>; #define f first #define s second #define pb push_back #define REP(i,n) for(int i=0;i<n;i++) #define REP1(i,n) for(int i=1;i<=n;i++) #define FILL(n,x) memset(n,x,sizeof(n)) #define ALL(_a) _a.begin(),_a.end() #define sz(x) (int)x.size() #define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end())))) #define GET(v,x) lower_bound(ALL(v),x)-v.begin() const int maxn=1e6+3; const int INF=0x3f3f3f3f; const int MOD=1e6+3; const ld PI=acos(-1.0l); const ld eps=1e-6; const ll INF64=9e18+1; #define lowb(x) x&(-x) #define MNTO(x,y) x=min(x,(__typeof__(x))y) #define MXTO(x,y) x=max(x,(__typeof__(x))y) template<typename T1,typename T2> ostream& operator<<(ostream& out,pair<T1,T2> P){ out<<P.f<<' '<<P.s; return out; } template<typename T> ostream& operator<<(ostream& out,vector<T> V){ REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":""); return out; } int mult(int a,int b){ return 1LL*a*b%MOD; } ll mypow(ll a,ll b,ll mod){ if(b<=0) return 1; a%=mod; ll res=1LL; while(b){ if(b&1) res=(res*a)%mod; a=(a*a)%mod; b>>=1; } return res; } struct node{ int cnt=0,mx=0; node* child[26]; }; node* create(){ node* ret = new node(); for(int i=0;i<26;i++)ret->child[i]=NULL; return ret; } node *root=create(); void add(string s){ node *cur=root; REP(i,sz(s)){ if(cur->child[s[i]-'a']==NULL){ cur->child[s[i]-'a']=create(); } cur=cur->child[s[i]-'a']; } cur->cnt++; } vector<char> vv; int tot=0; int n; void dfs(node *cur){ REP(j,cur->cnt) vv.pb('P'); tot+=cur->cnt; if(tot==n){ cout<<sz(vv)<<'\n'; cout<<vv; exit(0); } vector<pii> tmp; REP(i,26) if(cur->child[i]) tmp.pb({cur->child[i]->mx,i}); sort(ALL(tmp)); for(auto x:tmp){ int i=x.s; if(cur->child[i]){ vv.pb(i+'a'); dfs(cur->child[i]); vv.pb('-'); } } } int main(){ ios::sync_with_stdio(false),cin.tie(0); cin>>n; REP(i,n){ string s; cin>>s; add(s); } dfs(root); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...