# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
483287 | rainboy | Vlak (COCI20_vlak) | C11 | 10 ms | 9804 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <string.h>
#define N_ 200002
#define A 26
int tt[N_][A]; char msk[N_];
int dfs(int i, int t) {
int a;
for (a = 0; a < A; a++) {
int j = tt[i][a];
if ((msk[j] & 1 << t) != 0 && !dfs(j, t ^ 1))
return 1;
}
return 0;
}
int main() {
int n, n_;
scanf("%d", &n);
n_ = 2;
while (n--) {
static char cc[N_];
int l, h, i;
scanf("%s", cc), l = strlen(cc);
for (h = 0, i = 1; h < l; h++) {
int a = cc[h] - 'a';
if (!tt[i][a])
tt[i][a] = n_++;
i = tt[i][a];
msk[i] |= 1;
}
}
scanf("%d", &n);
while (n--) {
static char cc[N_];
int l, h, i;
scanf("%s", cc), l = strlen(cc);
for (h = 0, i = 1; h < l; h++) {
int a = cc[h] - 'a';
if (!tt[i][a])
tt[i][a] = n_++;
i = tt[i][a];
msk[i] |= 2;
}
}
printf(dfs(1, 0) ? "Nina\n" : "Emilija\n");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |