Submission #1302076

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302076		ghammazhassan	Type Printer (IOI08_printer)	C++20	10 / 100	34 ms	19896 KiB

printer

// #include <bits/stdc++.h>
#include <iostream>
#include <cmath>
#include <algorithm>
#include <map>
#include <unordered_map>
#include <vector>
#include <iomanip>
#include <string>
#include <queue>
#include <set>
#include <deque>
using namespace std;
// #define int long long
#define endl "\n"
#define fi first
#define se second
const int M=998244353;
// const int inf = 1e14;
const int LOG=18;
const int N=20e5+5;
int n , m , c , w , k , t=1 , q=1 , x , y , z , l , r;
int tr[N][26];
int cn[N];
int vn[N];
int v=1;
void add(string s){
    int cur=0;
    int n=s.size();
    for (int i=0;i<n;i++){
        if (!tr[cur][s[i]-'a']){
            tr[cur][s[i]-'a']=v++;
        }
        cur=tr[cur][s[i]-'a'];
        cn[cur]++;
        vn[cur]++;
    }
}
int co=0;
vector<int>ln;
vector<char>an;
void rem(string s){
    int cur=0;
    int n=s.size();
    int f=0;
    int u=0;
    for (int i=0;i<n;i++){
        int t=tr[cur][s[i]-'a'];
        if (cn[t]==vn[t]){
            an.push_back(s[i]);
        }
        cn[t]--;
        f++;
        if (!cn[t]){
            tr[cur][s[i]-'a']=0;
            co++;
            u++;
        }
        cur=t;
    }
    an.push_back('P');
    for (int i=0;i<u;i++){
        an.push_back('-');
    }
    ln.push_back(f);
}
void solve(){
    cin >> n;
    vector<pair<int,string>>a(n);
    for (int i=0;i<n;i++){
        cin >> a[i].se;
        a[i].fi=(a[i].se).size();
    }
    sort(a.begin(),a.end());
    for (int i=0;i<n;i++){
        add(a[i].se);
    }
    for (int i=0;i<n;i++){
        rem(a[i].se);
    }
    sort(ln.rbegin(),ln.rend());
    int k=2*co+n-ln[0];
    cout << k << endl;
    for (int i=0;i<k;i++){
        cout << an[i] << endl;
    }
}
signed main()    
{   

    // ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    // cin.tie(0), cout.tie(0);//DO NOT USE IN INTERACTIVE
    cout << fixed << setprecision(9);
    srand(time(0));
    // int t=1;
    // cin >> t;
    for (int _=1;_<=t;_++){
        solve();
        q++;
    }
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10