Submission #1330730

#	Time	Username	Problem	Language	Result	Execution time	Memory
1330730		aren_dance	Type Printer (IOI08_printer)	C++20	0 / 100	3 ms	2372 KiB

printer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
vector<int> solve(vector<string> s){
    if(s.empty()){
        return {};
    }
    if(s[0].size()==1){
        vector<int> p[27];
        for(int i=0;i<int(s.size());++i){
            int x=s[i][0]-'a';
            p[x].push_back(i);
        }
        vector<int> answ;
        for(int i=0;i<27;++i){
            for(auto j:p[i]){
                answ.push_back(j);
            }
        }
        return answ;
    }
    vector<int> p[27];
    for(int i=0;i<int(s.size());++i){
        int x=s[i][0]-'a';
        p[x].push_back(i);
    }
    vector<int> answ;
    for(int i=0;i<27;++i){
        vector<string> pj;
        for(auto j:p[i]){
            s[j].erase(s[j].begin());
            pj.push_back(s[j]);
        }
        vector<int> u=solve(pj);
        for(int j=0;j<int(u.size());++j){
            answ.push_back(p[i][u[j]]);
        }
    }
    return answ;
}
int main()
{
    cin.tie(NULL);
    cout.tie(NULL);
    ios_base::sync_with_stdio(false);
    int n;
    cin>>n;
    vector<string> s(n);
    for(int i=0;i<n;++i){
        cin>>s[i];
    }
    vector<int> r=solve(s);
    for(auto j:s[r[0]]){
        cout<<j<<'\n';
    }
    cout<<'P'<<'\n';
    for(int i=1;i<n;++i){
        int v=min(int(s[r[i-1]].size()),int(s[r[i]].size()));
        for(int j=0;j<min(int(s[r[i-1]].size()),int(s[r[i]].size()));++j){
            if(s[r[i]][j]!=s[r[i-1]][j]){
                v=j;
                break;
            }
        }
        for(int j=v;j<s[r[i-1]].size();++j){
            cout<<'-'<<'\n';
        }
        for(int j=v;j<s[r[i]].size();++j){
            cout<<s[r[i]][j]<<'\n';
        }
        cout<<"P"<<'\n';
    }
    return 0;
} 

• Subtask 1: 0 / 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