Submission #1142489

#TimeUsernameProblemLanguageResultExecution timeMemory
1142489ImperialALENVlak (COCI20_vlak)C++20
0 / 70
32 ms22856 KiB
// #pragma GCC optomize ("Ofast") // #pragma GCC optomize ("unroll-loops") // #pragma GCC target ("avx,avx2,fma") #include <bits/stdc++.h> #define F first #define S second #define ll long long #define int long long #define pb push_back #define all(x) (x.begin(),x.end()) #define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); using namespace std; const ll N = 5e5+7, INF = 1e18, inf = 1e9 , mod = 998244353; string s[N]; map<string,int>mp; signed main(){ ios; int tt=1; // cin>>tt; while(tt--){ int n; cin>>n; for(int i=1;i<=n;i++)cin>>s[i]; int m; cin>>m; for(int j=1;j<=m;j++){ string x; cin>>x; string pref=""; for(int i=0;i<x.size();i++){ pref+=x[i]; mp[pref]=1; } } bool ans=0; for(int j=1;j<=n;j++){ string x=s[j]; string pref=""; int ind=-1; for(int i=0;i<x.size();i++){ pref+=x[i]; if(mp[pref]==0){ ans=1; ind=i; break; } } if(mp[pref]==0 && pref.size()%2==0)ans=0; if(ans)break; } if(ans)cout<<"Nina"; else cout<<"Emilija"; } }
#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...