Submission #226154

#	Time	Username	Problem	Language	Result	Execution time	Memory
226154		inluminas	Type Printer (IOI08_printer)	C++14	20 / 100	750 ms	18780 KiB

printer

#include<bits/stdc++.h>
using namespace std;
const int lmt=1e6;
int adj[lmt][26];
bool vis[lmt];
int subtree[lmt];
int indx=1;
int cnt=0;
string ans;
void insert(string s,int now)
{
    for(char c:s)
    {
        int num=c-'a';
        if(adj[now][num]==0)
        {
            indx++;
            adj[now][num]=indx;
            now=indx;
        }
        else
        {
            now=adj[now][num];
        }
    }
}
void getsubtree(int u)
{
    subtree[u]=1;
    for(int i=0;i<26;i++)
    {
        if(adj[u][i]!=0)
        {
            int v=adj[u][i];
            getsubtree(v);
            subtree[u]+=subtree[v];
        }
    }
}
void dfs(int u)
{
    if(vis[u]==0)
    {
        cnt++;
        vis[u]=1;
    }
    vector<pair<int,int>>p;
    for(int i=0;i<26;i++)
    {
        if(adj[u][i]!=0)
        {
            p.push_back(make_pair(subtree[adj[u][i]],i));
        }
    }
    sort(p.begin(),p.end());
    for(int i=0;i<p.size();i++)
    {
        char c='a'+p[i].second;
        ans+=c;
        int v=adj[u][p[i].second];
        dfs(v);
    }
    if(p.empty()) ans+='P';
    if(cnt<indx) ans+='-';
}
int main()
{
    //#ifndef ONLINE_JUDGE
    //    freopen("take.in","r",stdin);
    //    freopen("give.out","w",stdout);
    //#endif
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        string s;
        cin>>s;
        insert(s,1);
    }
    getsubtree(1);
    dfs(1);
    cout<<ans.size()<<endl;
    for(char c:ans)
    {
        cout<<c<<endl;
    }
}

Compilation message (stderr)

printer.cpp: In function 'void dfs(int)':
printer.cpp:56:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<p.size();i++)
                 ~^~~~~~~~~

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