제출 #1094379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1094379		lenron	Type Printer (IOI08_printer)	C++17	0 / 100	2 ms	860 KiB

printer

#include <bits/stdc++.h>
using namespace std;
using ll = long long;


int node_num=0,pcount=0;
vector<vector<int>> trie(1000,vector<int>(26,0));
vector<bool> stop(100000,false);


void insert(string word){
    int node=0;
    for(char c:word){
      if(trie[node][c-'a']==0){trie[node][c-'a']=++node_num;pcount++;}
      node=trie[node][c-'a'];
    }
    stop[node]=true;
}

string s="";

void dfs(int u){

     int node=u;
    if(stop[node]==true){cout<<"P"<<endl;}
     for(int i=0;i<26;i++){
        if(trie[node][i]==0){continue;}
        s.push_back(char('a'+i));
        cout<<char('a'+i)<<endl;
        pcount--;
        int v=trie[node][i];

        dfs(v);
        s.pop_back();
        if(pcount==0){return;}
        cout<<"-"<<endl;
     }

}


void solve(){
   ll n;cin>>n;
   for(int i=0;i<n;i++){
    string s;cin>>s;
    insert(s);
   }
   dfs(0);
}


int main(){
	solve();
}

• 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