#include <bits/stdc++.h>
using namespace std;
int trie[200001][26];
bitset<200001>var[2];
int las=1;
void ekle(string word,bool player){
int pos=0;
for(char c:word){
if(!trie[pos][c-'a']){
trie[pos][c-'a']=las++;
}
pos=trie[pos][c-'a'];
var[player][pos]=true;
}
}
bool dfs(int pos,bool sira){
if(pos&&!var[sira][pos])return !sira;
for(int i=0;i<26;i++){
if(!trie[pos][i])continue;
if(!var[sira][trie[pos][i]])continue;
if(dfs(trie[pos][i],sira^1)==sira)return sira;
}
return !sira;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
int n;cin>>n;
for(int i=0;i<n;i++){
string s;cin>>s;
ekle(s,0);
}
cin>>n;
for(int i=0;i<n;i++){
string s;cin>>s;
ekle(s,1);
}
if(dfs(0,0))cout<<"Emilija";
else cout<<"Nina";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
604 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
604 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
356 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
9048 KB |
Output is correct |
2 |
Correct |
6 ms |
8540 KB |
Output is correct |
3 |
Correct |
6 ms |
8028 KB |
Output is correct |
4 |
Correct |
6 ms |
8796 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
9308 KB |
Output is correct |
2 |
Correct |
6 ms |
9564 KB |
Output is correct |
3 |
Correct |
5 ms |
8796 KB |
Output is correct |
4 |
Correct |
5 ms |
9052 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
8796 KB |
Output is correct |
2 |
Correct |
6 ms |
8636 KB |
Output is correct |
3 |
Correct |
6 ms |
8796 KB |
Output is correct |
4 |
Correct |
8 ms |
9308 KB |
Output is correct |