# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1023904 | 2024-07-15T09:22:57 Z | Double_Slash | Cezar (COCI16_cezar) | C++17 | 1 ms | 440 KB |
#include <bits/stdc++.h> #define debug(x) [&] { auto _x = x; cerr << __LINE__ << ": " << #x << " = " << _x << endl; return _x; }() using namespace std; int n, deg[26], ans[26]; string raw[101], 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 + 1][j] - 'a'].emplace_back(words[i][j] - 'a'); deg[words[i][j] - 'a']++; break; } } } queue<int> q; for (int i = 0; i < 26; ++i) { if (not deg[i]) q.emplace(i); } int idx = 26; 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) 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 = 1; i <= n; ++i) cin >> raw[i]; for (int i = 1; i <= n; ++i) { int j; cin >> j; words[i] = raw[j]; } if (not solve()) cout << "NE\n"; else { for (int i = 1; i <= n; ++i) { for (char &c: words[i]) { c = ans[c - 'a'] + 'a'; } if (i > 1) assert(words[i] > words[i - 1]); } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 440 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |