제출 #158201

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
158201		GoldNextYear	Cezar (COCI16_cezar)	C++14	30 / 100	3 ms	376 KiB

cezar

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;
const ll mod2=998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
int n;
    string s[109],ss[109];
    vi v[29];
    int done[29],deg[29],ans[29],yes[29];
    void dfs(int node){
            done[node]=1;
            for(auto u:v[node]){
                    if(done[u]==2)C;
                    if(done[u]==1)cout<<"NE"<<endl,exit(0);
                    dfs(u);
            }
            done[node]=2;
    }
    void make(string a,string b){
            int z=0;
            for(int i=0;i<min((int) a.size(),(int) b.size());i++){
                    if(a[i]==b[i])C;
                    z=1;
                    v[a[i]-'a'].pb(b[i]-'a');
                    deg[b[i]-'a']++;
                break;
            }
            if(!z && a.size()>b.size())cout<<"NE"<<endl,exit(0);
    }
    int main(){
            cin>>n;
            for(int i=0;i<n;i++)cin>>ss[i];
            for(int i=0;i<n;i++){
                    int x;cin>>x;
                    x--;
                    s[i]=ss[x];
            }
            for(int i=0;i<n-1;i++){
                    make(s[i],s[i+1]);
            }
            for(int i=0;i<26;i++){
                    if(done[i]==0)dfs(i);
            }
            queue<int>q;
            for(int i=0;i<26;i++)
                    if(deg[i]==0)q.push(i),yes[i]=1;
            int last=(int) 'a';
            while(q.size()){
                    int node=q.front();q.pop();
                    ans[node]=last++;
                    for(auto u:v[node]){
                            if(yes[u])C;
                            deg[u]--;
                            if(deg[u]==0)q.push(u),yes[u]=1;
                    }
            }
      cout<<"DA"<<endl;
            for(int i=0;i<26;i++)cout<<(char)ans[i];
            cout<<endl;
    }

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