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 <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("00")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
ll time() {return chrono::system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
const int inf = 1e9;
const ll inf64 = 1e18;
#define ft first
#define fin(x) ifstream cin("x.in");
#define fout(x) ofstream cout("x.out");
#define sd second
#define pb push_back
#define sz(x) (int)x.size()
struct trie
{
trie *nxt[26]{};
bool who[2]{}, ok{};
void add(char* now, int n, int wh)
{
who[wh] = true;
if (!n)
return;
auto& to = nxt[*now - 'a'];
if (!to)
to = new trie();
to->add(now + 1, n - 1, wh);
}
void play(int whoMove)
{
ok = whoMove ^ 1;
for (int i = 0; i < 26; i++)
{
if (!nxt[i])
continue;
nxt[i]->play(whoMove ^ 1);
if (nxt[i]->ok == whoMove && nxt[i]->who[whoMove])
ok = whoMove;
}
}
};
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
trie root;
int n;
cin >> n;
for (int i = 0; i < n; i++)
{
string s;
cin >> s;
root.add(&s[0], (int)s.size(), 0);
}
int m;
cin >> m;
for (int i = 0; i < m; i++)
{
string s;
cin >> s;
root.add(&s[0], (int)s.size(), 1);
}
root.play(0);
cout << (root.ok ? "Emilija" : "Nina");
}
# | 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... |