제출 #898371

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
898371		bachhoangxuan	Vlak (COCI20_vlak)	C++17	70 / 70	17 ms	31172 KiB

Main

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

struct node{
    int val=0,d=0;
    int nxt[26];
    node(){memset(nxt,0,sizeof(nxt));}
};

vector<node> T;

void add_string(string s,int t){
    int u=0;
    for(char c:s){
        int a=c-'a';
        if(!T[u].nxt[a]){
            T[u].nxt[a]=(int)T.size();
            T.push_back(node());
            T.back().d=T[u].d^1;
        }
        u=T[u].nxt[a];
        T[u].val|=(1<<t);
    }
}

bool dfs(int u){
    for(int i=0;i<26;i++){
        if(!T[u].nxt[i]) continue;
        int v=T[u].nxt[i];
        if((T[v].val&(1<<T[u].d)) && !dfs(v)) return true;
    }
    return false;
}

void solve(){
    T.push_back(node());
    int n,m;cin >> n;
    for(int i=0;i<n;i++){
        string s;cin >> s;
        add_string(s,0);
    }
    cin >> m;
    for(int i=0;i<m;i++){
        string s;cin >> s;
        add_string(s,1);
    }
    cout << (dfs(0)?"Nina":"Emilija") << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

• 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