Submission #1179265

#	Time	Username	Problem	Language	Result	Execution time	Memory
1179265		asli_bg	Vlak (COCI20_vlak)	C++20	70 / 70	25 ms	49224 KiB

Main

#include<bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long
//#define int double

typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;

#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<

#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;

#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (double)(l+r)/2

const int MAXN=2e5+5;
const int INF=1e9+7;

int t[MAXN][30];
//t[nd][harf]=kom --> nd'dan harf ile gittiğimde ulaştığım komşuyu tutar

int nd; //nd sayısı

int mark[MAXN][2];

void add_word(string s,int kim){
    int cur_node=0; //empty node, root
    FOR(i,s.length()){
        if(t[cur_node][s[i]-'a']==-1){
            nd++;
            t[cur_node][s[i]-'a']=nd;
        }
        
        cur_node=t[cur_node][s[i]-'a'];

        if(i==s.length()-1) mark[cur_node][kim]=true;
    }
}

bool dfs(int nd,int h){
    /*if h%2==0 ninanın sırası
    else emilijanın sırası*/
    
    bool f2=false;
    int say=0;
    FOR(i,27){
        if(t[nd][i]!=-1){
            f2=(f2 or dfs(t[nd][i],h+1));
            say++;
        }
    }

    if(!say){
        //leaf node
        return mark[nd][h%2];
    }


    if(nd==0){
        if(f2) return true;
        else return false;
    }
    else{
        if(!f2) return true;
        else return false;
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    memset(t,-1,sizeof t);
    nd=0;

    int n;
    cin>>n;
    vector<string> ni(n);
    FOR(i,n){
        cin>>ni[i];
        add_word(ni[i],1);
    }

    int m;
    cin>>m;
    vector<string> em(m);
    FOR(i,m){
        cin>>em[i];
        add_word(em[i],0);
    }

    if(dfs(0,0)) cout<<"Nina"<<endl;
    else cout<<"Emilija"<<endl;
    
}   

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10