oj.uz

Submission #829457

# Submission time Handle Problem Language Result Execution time Memory
829457 2023-08-18T10:59:14 Z bachhoangxuan Type Printer (IOI08_printer) C++17
100 / 100
 188 ms 111800 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;
struct node{
    int nxt[26];
    bool leaf=false;
    node(){memset(nxt,0,sizeof(nxt));}
};

int n,cnt;
vector<char> ans;
vector<node> T;
vector<int> d,son;

void add(string s){
    int u=0;
    for(char c:s){
        int a=c-'a';
        if(!T[u].nxt[a]){
            T[u].nxt[a]=(int)T.size();
            T.push_back(node());
        }
        u=T[u].nxt[a];
    }
    T[u].leaf=true;
}
void dfs(int u){
    if(T[u].leaf) ans.push_back('P'),cnt++;
    for(int i=0;i<26;i++){
        int v=T[u].nxt[i];
        if(v && v!=son[u]){
            ans.push_back(char('a'+i));
            dfs(v);
            if(cnt!=n) ans.push_back('-');
        }
    }
    for(int i=0;i<26;i++){
        int v=T[u].nxt[i];
        if(v && v==son[u]){
            ans.push_back(char('a'+i));
            dfs(v);
            if(cnt!=n) ans.push_back('-');
        }
    }
}
void build(int u){
    for(int i=0;i<26;i++){
        int v=T[u].nxt[i];
        if(v){
            build(v);
            if(d[v]+1>d[u]) d[u]=d[v]+1,son[u]=v;
        }
    }
}
string s;
void solve(){
    cin >> n;
    T.push_back(node());
    for(int i=1;i<=n;i++) cin >> s,add(s);
    d.assign((int)T.size(),0);
    son.assign((int)T.size(),0);
    build(0);
    dfs(0);
    cout << (int)ans.size() << '\n';
    for(char c:ans) cout << c << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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 1 ms 340 KB Output is correct
2 Correct 1 ms 340 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 340 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 0 ms 212 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 2 ms 1300 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2156 KB Output is correct
2 Correct 4 ms 3848 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7364 KB Output is correct
2 Correct 22 ms 14400 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 15292 KB Output is correct
2 Correct 9 ms 3976 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 55876 KB Output is correct
2 Correct 151 ms 111608 KB Output is correct
3 Correct 85 ms 56268 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 29820 KB Output is correct
2 Correct 188 ms 111660 KB Output is correct
3 Correct 100 ms 56332 KB Output is correct
4 Correct 152 ms 111800 KB Output is correct