이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define ST first
#define ND second
#define PB push_back
using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;
const int mod = 1012414159, p = 317;
int n, m;
set<int>pl[2];
map<pair<int, bool>, bool>mp;
void rec(int hsh, bool turn) {
if(mp.count({hsh,turn})) return;
bool win = false;
for(int i = 1; i <= 26; ++i) {
int h2 = ((ll)hsh * p + i) % mod;
if(pl[turn].count(h2)) {
if(!mp.count({h2, turn ^ 1})) rec(h2, turn ^ 1);
if(!mp[{h2, turn ^ 1}]) win = true;
}
}
mp[{hsh, turn}] = win;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for(int i = 0; i < n; ++i) {
string s;
cin >> s;
int hsh = 0;
for(auto c : s) {
hsh = ((ll)hsh * p + (c - 'a' + 1)) % mod;
pl[0].insert(hsh);
}
}
cin >> m;
for(int i = 0; i < m; ++i) {
string s;
cin >> s;
int hsh = 0;
for(auto c : s) {
hsh = ((ll)hsh * p + (c - 'a' + 1)) % mod;
pl[1].insert(hsh);
}
}
rec(0, 0);
if(mp[{0, 0}]) cout << "Nina";
else cout << "Emilija";
}
# | 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... |