제출 #1132760

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1132760		steveonalex	Vlak (COCI20_vlak)	C++20	70 / 70	6 ms	10056 KiB

Main

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct Trie{
    struct Node{
        int mask;
        int child[26];
        Node(){mask = 0; memset(child, -1, sizeof child);}
    };

    vector<Node> a;

    Trie(int n){
        a.reserve(n);
        a.emplace_back();
    }

    void add_child(int &x){
        x = a.size();
        a.emplace_back();
    }

    void add(string s, int cur_mask){
        int id=  0;
        a[id].mask |= cur_mask;
        for(char c: s){
            int digit = c - 'a';
            if (a[id].child[digit] == -1) add_child(a[id].child[digit]);
            id = a[id].child[digit];
            a[id].mask |= cur_mask;
        }
    }

    bool dp_liem_liem(){
        return go(0, 1);
    }

    bool go(int id, int is_nina_turn){
        if (!GETBIT(a[id].mask, 1 - is_nina_turn)) return 0;
        for(int i = 0; i < 26; ++i) if (a[id].child[i] != -1){
            bool cur = !go(a[id].child[i], 1 - is_nina_turn);
            if (cur) return 1;
        }
        return 0;
    }
};

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
    clock_t start = clock();
 
    Trie tri(200000);
    int n; cin >> n;
    for(int i = 0; i < n; ++i){
        string s; cin >> s;
        tri.add(s, 1);
    }
    int m; cin >> m;
    for(int i = 0; i < m; ++i){
        string s; cin >> s;
        tri.add(s, 2);
    }

    if (tri.dp_liem_liem()) cout << "Nina\n";
    else cout << "Emilija\n";
 
    cerr << "Time elapsed: " << clock() - start << "ms!\n";
 
    return 0;
}

• 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