oj.uz

Submission #46988

# Submission time Handle Problem Language Result Execution time Memory
46988 2018-04-25T19:24:00 Z diegogrc Cezar (COCI16_cezar) C++11
20 / 100
 2 ms 724 KB 
//  Copyright © 2018 Diego Garcia Rodriguez del Campo. All rights reserved.

#include<bits/stdc++.h>
#define MAX 105
#define ALPHA 30
#define optimiza_io cin.tie(0); ios_base::sync_with_stdio(0);
using namespace std;
typedef long long i64;

int N, tot;
string word[MAX];
int in[MAX];
int ord[MAX];
int ady[ALPHA][ALPHA];
vector < int > adyy[MAX];
queue < int > q;
queue < int > ans;

int main()
{
    optimiza_io
    cin >> N;
    for( int i = 1; i <= N; i ++ )
        cin >> word[i];
    for( int i = 1; i <= N; i ++ )
        cin >> ord[i];
    for( int i = 1; i <= N; i ++ )
        for( int j = i + 1; j <= N; j ++ )
        {
            int a = ord[i], b = ord[j];
            int idx = 0;
            while( idx < (int)word[a].size() && idx < (int)word[b].size() && word[a][idx] == word[b][idx] ) idx++;
            if( idx < (int)word[a].size() && idx < (int)word[b].size() )
                ady[word[a][idx] - 'a' + 1][word[b][idx] - 'a' + 1] = 1;
            else if( word[a].size() > word[b].size() )
            {
                cout << "NE\n";
                return 0;
            }
        }
    for( int i = 1; i <= 26; i ++ )
        for( int j = 1; j <= 26; j ++ )
            if( ady[i][j] )
            {
                in[j]++;
                adyy[i].push_back( j );
            }
    for( int i = 1; i <= 26; i ++ )
        if( ! in[i] )
        {
            q.push( i );
            tot++;
        }
    while( ! q.empty() )
    {
        int x = q.front(); q.pop();
        ans.push( x );
        for( auto v : adyy[x] )
        {
            in[v]--;
            if( ! in[v] )
            {
                tot++;
                q.push( v );
            }
        }
    }
    if( tot != 26 )
        cout << "NE\n";
    else
    {
        cout << "DA\n";
        while( ! ans.empty() )
        {
            char a = ans.front() + 'a' - 1;
            cout << a;
            ans.pop();
        }
    }
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 412 KB Output is correct
2 Correct 2 ms 596 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 724 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 724 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 724 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 724 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 724 KB Output isn't correct
2 Halted 0 ms 0 KB -