oj.uz

Submission #638988

# Submission time Handle Problem Language Result Execution time Memory
638988 2022-09-08T06:54:33 Z zaneyu Type Printer (IOI08_printer) C++14
100 / 100
 129 ms 100420 KB 
/*input
3
aa
acb
c
*/
#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();
    REP(i,26) 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']){
            cur->child[s[i]-'a']=create();
        }
        cur=cur->child[s[i]-'a'];
        MXTO(cur->mx,sz(s));
    }
    cur->cnt++;
}
vector<char> vv;
int tot=0;
int n;
void dfs(node *cur){
    REP(j,cur->cnt) vv.pb('P');
    tot+=cur->cnt;
    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;
        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);
    while(vv.back()=='-') vv.pop_back();
    cout<<sz(vv)<<'\n';
    cout<<vv;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1748 KB Output is correct
2 Correct 3 ms 2240 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5972 KB Output is correct
2 Correct 18 ms 12616 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 14808 KB Output is correct
2 Correct 8 ms 3328 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 36760 KB Output is correct
2 Correct 112 ms 84416 KB Output is correct
3 Correct 59 ms 43540 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 28744 KB Output is correct
2 Correct 129 ms 100420 KB Output is correct
3 Correct 71 ms 49484 KB Output is correct
4 Correct 123 ms 94964 KB Output is correct