제출 #1153991

#제출 시각아이디문제언어결과실행 시간메모리
1153991zhehanVlak (COCI20_vlak)C++20
0 / 70
5 ms1096 KiB
#include <bits/stdc++.h>
using namespace std;

signed main(){
    int n,m;
    cin>>n;
    vector<string> nina (n,"");
    for(auto &e:nina){
        cin>>e;
    }
    cin>>m;
    vector<string> emilija (m,"");
    for(auto &e:emilija){
        cin>>e;
    }
    sort(nina.begin(),nina.end());
    sort(emilija.begin(),emilija.end());
    int np=0, mp = 0, chars=1;
    while(np<n){
        mp = lower_bound(emilija.begin(),emilija.end(), nina[np].substr(0,chars)) - emilija.begin();
        bool found=false;
        while(emilija[mp].substr(0,chars)==nina[np].substr(0,chars)){
            found=true;
            if((*lower_bound(nina.begin(),nina.end(),emilija[mp].substr(0,chars+1))).substr(0,chars+1)==emilija[mp].substr(0,chars+1)){
                ++mp;
                if(mp==m){
                    cout<<"Nina\n";
                    return 0;
                }
            }else{
                ++np;
                break;
            }
        }
        if(!found){
            cout<<"Nina\n";
            return 0;
        }
        if(nina[np].length()<chars+2){
            ++np;
            continue;
        }
        chars+=2;
    }
    if(np==n){
        cout<<"Emilija\n";
    }else{
        cout<<"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...