oj.uz

답안 #156269

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
156269 2019-10-04T17:12:43 Z mdn2002 Cezar (COCI16_cezar) C++14
0 / 100
 30 ms 23844 KB 
#include<bits/stdc++.h>
using namespace std;
long long mod=1e9+7;
vector<string>v,an;
vector<int>gr[1000004];
vector<char>ans;
int n,d[1005],vis[1030],tt=1;
int dt[1030];
void dfs(int x)
{
    dt[x-1]=tt++;
    vis[x]=1;
    for(int i=0; i<gr[x].size(); i++)
    {
        int u=gr[x][i];
        if(vis[u]==1)
        {
            cout<<"NE";
            exit(0);
        }
        else if(vis[u]==0)dfs(u);
    }
    vis[x]=2;
}
int main()
{
    cin>>n;
    for(int i=0; i<n; i++)
    {
        string s;
        cin>>s;
        v.push_back(s);
    }
    for(int i=0; i<n; i++)
    {
        cin>>d[i];
        an.push_back(v[d[i]-1]);
    }
    for(int i=0; i<n-1; i++)
    {
        int x=0;
        while(an[i][x]==an[i+1][x])
        {
            x++;
            if(x>=an[i].size()||x>=an[i+1].size())
            {
                if(an[i].size()>an[i+1].size())
                {
                    cout<<"NE";
                    return 0;
                }
                break;
            }
        }
        if(x<an[i].size()&&x<an[i+1].size())gr[(an[i][x]-'a')+1].push_back((an[i+1][x]-'a')+1);
    }
    for(int i=0; i<n-1; i++)
    {
        int x=0;
        while(an[i][x]==an[i+1][x])
        {
            x++;
        }
        dfs(an[0][x]-'a'+1);
    }

    cout<<"DA"<<endl;
    for(int i=0; i<26; i++)
    {
        if(dt[i]!=0)ans.push_back('a'+(dt[i]-1));
        else
        {
            ans.push_back('a'+(tt-1));
            tt++;
        }
    }
    for(int i=0; i<26; i++)
    {
        cout<<ans[i];
    }
}
/*
2
abc
ab
1 2
*/

Compilation message

cezar.cpp: In function 'void dfs(int)':
cezar.cpp:13:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<gr[x].size(); i++)
                  ~^~~~~~~~~~~~~
cezar.cpp: In function 'int main()':
cezar.cpp:45:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(x>=an[i].size()||x>=an[i+1].size())
                ~^~~~~~~~~~~~~~
cezar.cpp:45:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(x>=an[i].size()||x>=an[i+1].size())
                                 ~^~~~~~~~~~~~~~~~
cezar.cpp:55:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(x<an[i].size()&&x<an[i+1].size())gr[(an[i][x]-'a')+1].push_back((an[i+1][x]-'a')+1);
            ~^~~~~~~~~~~~~
cezar.cpp:55:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(x<an[i].size()&&x<an[i+1].size())gr[(an[i][x]-'a')+1].push_back((an[i+1][x]-'a')+1);
                            ~^~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 23772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 23800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 23800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 23800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 23800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 23800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 23800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 23800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 23844 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 27 ms 23844 KB Output isn't correct
2 Halted 0 ms 0 KB -