제출 #390499

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
390499		ngpin04	Vlak (COCI20_vlak)	C++14	0 / 70	11 ms	10316 KiB

Main

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
using namespace std;
const int N = 2e5 + 5;

int ptr[2][N][26];
int n, node;

bool Win[N];

void add(string &s, int id) {
    int cur = 0;
    for (char c : s) {
        int &p = ptr[id][cur][c - 'a'];
        if (p == 0)
            p = ++node;
        cur = p;
    }
}

bool solve(int i, int j, int cur) {
    bool res = false;

    for (int val = 0; val < 26; val++) {
        int pcur = ptr[cur][i][val];
        if (pcur == 0)
            continue;

        int pnxt = ptr[cur ^ 1][j][val];
        if (pnxt == 0)
            return true;
        res |= !solve(pnxt, pcur, cur ^ 1);
    }
    return res;
}

void proc() { cout << (solve(0, 0, 0) ? ("Nina\n") : ("Emilịa\n")); }

void enter() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        string s;
        cin >> s;
        add(s, 0);
    }
    cin >> n;
    for (int i = 1; i <= n; i++) {
        string s;
        cin >> s;
        add(s, 1);
    }
}

void preproc() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    // freopen("KARA.inp","r",stdin);
    // freopen("KARA.out","w",stdout);
}

int main() {
    preproc();
    enter();
    proc();
    return 0;
}

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