제출 #1154057

#제출 시각아이디문제언어결과실행 시간메모리
1154057dzuizzVlak (COCI20_vlak)C++20
70 / 70
96 ms11592 KiB
#include<bits/stdc++.h> using namespace std; int n,m,i; string s,r; struct node{ map<int,node*> v; bool k; node(bool _k): k(_k) {} void add(string s){ if(!s.size()) return; if(!v[s[0]-'a']) v[s[0]-'a']=new node(k^1); v[s[0]-'a']->add(s.substr(1,(int)s.size()-1)); } bool qry(){ for(auto&[i,nx]:v) if(nx&&nx->qry()==k^1) return k^1; return k; } } *root=new node(1); signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n; for(i=0;i<n;++i){ cin>>s; r=""; for(auto&c:s) if((r+=c).size()&1) root->add(r); } cin>>m; for(i=0;i<m;++i){ cin>>s; r=""; for(auto&c:s) if((r+=c).size()&1^1) root->add(r); } cout<<(root->qry()?"Emilija\n":"Nina\n"); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...