# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
753213 | 2023-06-04T20:12:50 Z | MilosMilutinovic | Vlak (COCI20_vlak) | C++14 | 15 ms | 9936 KB |
#include <bits/stdc++.h> using namespace std; const int N = 2e5 + 10; const int M = 20 * N; const int A = 26; int n, m, tsz, ch[M][A]; bool has[M][2]; char str[N]; void ins(int x) { int nd = 0; for (int i = 1; i <= strlen(str + 1); i++) { int c = (int) (str[i] - 'a'); if (!ch[nd][c]) ch[nd][c] = ++tsz; nd = ch[nd][c]; has[nd][x] = true; } } bool solve(int nd, int player) { bool win = false; for (int i = 0; i < A; i++) { if (!ch[nd][i]) continue; if (has[ch[nd][i]][player]) { win = (win | !solve(ch[nd][i], player ^ 1)); } } return win; } int main() { scanf("%d", &n); for (int i = 1; i <= n; i++) { scanf("%s", str + 1); ins(0); } scanf("%d", &m); for (int i = 1; i <= m; i++) { scanf("%s", str + 1); ins(1); } if (solve(0, 0)) printf("Nina\n"); else printf("Emilija\n"); return 0; } /* 2 aaa bbb 3 aab aba bbb */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 340 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 308 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 308 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 436 KB | Output is correct |
4 | Correct | 1 ms | 416 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 15 ms | 9336 KB | Output is correct |
2 | Correct | 12 ms | 8660 KB | Output is correct |
3 | Correct | 9 ms | 8248 KB | Output is correct |
4 | Correct | 10 ms | 9020 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 9428 KB | Output is correct |
2 | Correct | 10 ms | 9936 KB | Output is correct |
3 | Correct | 9 ms | 9076 KB | Output is correct |
4 | Correct | 10 ms | 9272 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 10 ms | 8992 KB | Output is correct |
2 | Correct | 10 ms | 8788 KB | Output is correct |
3 | Correct | 10 ms | 9048 KB | Output is correct |
4 | Correct | 12 ms | 9532 KB | Output is correct |