oj.uz

답안 #31798

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31798 2017-09-09T06:40:36 Z top34051 Cezar (COCI16_cezar) C++14
0 / 100
 0 ms 2024 KB 
#include<bits/stdc++.h>
using namespace std;
int n;
bool vis[30];
string s[105], p[105];
vector<int> from[30], to[30];
vector<int> topo;
void dfs(int x) {
    int i;
    vis[x] = 1;
    for(i=0;i<from[x].size();i++) if(!vis[from[x][i]]) dfs(from[x][i]);
    topo.push_back(x);
}
void dfs2(int x) {
    int i;
    vis[x] = 1;
    for(i=0;i<to[x].size();i++) if(!vis[to[x][i]]) dfs2(to[x][i]);
}
main() {
    int i,j,x;
    scanf("%d",&n);
    for(i=1;i<=n;i++) cin >> s[i];
    for(i=1;i<=n;i++) scanf("%d",&x), p[x] = s[i];
    for(x=1;x<n;x++) {
        i = j = 0;
        while(i<p[x].size() && j<p[x+1].size()) {
            if(p[x][i]!=p[x+1][j]) {
                from[p[x][i]-'a'].push_back(p[x+1][j]-'a');
                to[p[x+1][j]-'a'].push_back(p[x][i]-'a');
//                printf("%c -> %c\n",p[x][i],p[x+1][j]);
                break;
            }
            i++; j++;
        }
    }
    memset(vis,0,sizeof(vis));
    for(x=0;x<26;x++) if(!vis[x]) dfs(x);
    memset(vis,0,sizeof(vis));
    for(i=25;i>=0;i--) {
        x = topo[i];
        if(vis[x]) {
            printf("NE");
            return 0;
        }
        dfs2(x);
    }
    printf("DA\n");
    for(i=25;i>=0;i--) printf("%c",topo[i]+'a');
}

Compilation message

cezar.cpp: In function 'void dfs(int)':
cezar.cpp:11:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0;i<from[x].size();i++) if(!vis[from[x][i]]) dfs(from[x][i]);
              ^
cezar.cpp: In function 'void dfs2(int)':
cezar.cpp:17:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0;i<to[x].size();i++) if(!vis[to[x][i]]) dfs2(to[x][i]);
              ^
cezar.cpp: At global scope:
cezar.cpp:19:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
cezar.cpp: In function 'int main()':
cezar.cpp:26:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(i<p[x].size() && j<p[x+1].size()) {
                ^
cezar.cpp:26:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(i<p[x].size() && j<p[x+1].size()) {
                                 ^
cezar.cpp:21:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
cezar.cpp:23:50: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=1;i<=n;i++) scanf("%d",&x), p[x] = s[i];
                                                  ^

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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