oj.uz

Submission #1023848

# Submission time Handle Problem Language Result Execution time Memory
1023848 2024-07-15T07:49:41 Z Double_Slash Cezar (COCI16_cezar) C++17
20 / 100
 1 ms 600 KB 
#include <bits/stdc++.h>

using namespace std;

int n, deg[26], ans[26];
string raw[100], words[101];
vector<int> adj[26];

bool solve() {
    for (int i = 1; i < n; ++i) {
        for (int j = 0; j < words[i].size(); ++j) {
            if (j == words[i + 1].size()) return false;
            if (words[i][j] != words[i + 1][j]) {
                adj[words[i][j] - 'a'].emplace_back(words[i + 1][j] - 'a');
                deg[words[i + 1][j] - 'a']++;
            }
        }
    }
    queue<int> q;
    for (int i = 0; i < 26; ++i) {
        if (not deg[i]) q.emplace(i);
    }
    int idx = 0;
    while (not q.empty()) {
        int i = q.front();
        q.pop();
        ans[i] = idx++;
        for (int j: adj[i]) {
            if (not --deg[j]) q.emplace(j);
        }
    }
    if (idx < 26) return false;
    cout << "DA\n";
    for (int i = 0; i < 26; ++i) cout << (char) ('a' + ans[i]);
    cout << endl;
    return true;
}

int main() {
    cin >> n;
    for (int i = 0; i < n; ++i) cin >> raw[i];
    for (int i = 0; i < n; ++i) {
        int j;
        cin >> j;
        words[j] = raw[i];
    }
    if (not solve()) cout << "NE\n";
}

Compilation message

cezar.cpp: In function 'bool solve()':
cezar.cpp:11:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |         for (int j = 0; j < words[i].size(); ++j) {
      |                         ~~^~~~~~~~~~~~~~~~~
cezar.cpp:12:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |             if (j == words[i + 1].size()) return false;
      |                 ~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 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 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 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 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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