Submission #448720

#	Time	Username	Problem	Language	Result	Execution time	Memory
448720		2548631	Vlak (COCI20_vlak)	C++17	70 / 70	21 ms	21580 KiB

Main

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

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vii> vvii;

#define fastIO ios::sync_with_stdio(false), cin.tie(NULL)
#define forw(i, l, r) for( int i = (l) ; i < (r) ; i++ )
#define forb(i, r, l) for( int i = (r) ; i >= (l) ; i-- )
#define log2i(x) (64 - __builtin_clzll(1ll * (x)) - 1)
#define numBit(x) (__builtin_popcountll(1ll * (x)))
#define getBit(x, i) ((x) >> (i) & 1)
#define Pi acos(-1.0l)
#define sz(x) int(x.size())
#define mt make_tuple
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define debug(x) cerr << #x << " = " << x << '\n';

const int N = 2e5 + 7;
int n, m, numNode = 1;
int nxt[N][26], dp[N], fav[N];

void add(string s, int v) {
    int r = 0;
    forw(i, 0, sz(s)) {
        if(nxt[r][s[i] - 'a'] == -1)  nxt[r][s[i] - 'a'] = numNode++;
        r = nxt[r][s[i] - 'a'];
    }
    fav[r] |= 1 << v;
}

void dfs(int u, int r = 0) {
    dp[u] = 0;
    forw(i, 0, 26) {
        int v = nxt[u][i];
        if(v == -1) continue;
        dfs(v, 1 - r);
        fav[u] |= fav[v];
        if(getBit(fav[v], r)) dp[u] |= 1 - dp[v];
    }
}

int main() {
    fastIO;
#ifndef ONLINE_JUDGE
    //freopen("test.inp","r",stdin);
    //freopen("test.out","w",stdout);
#endif

    memset(nxt, -1, sizeof nxt);
    cin >> n;
    forw(i, 0, n) {
        string st; cin >> st;
        add(st, 0);
    }
    cin >> m;
    forw(i, 0, m) {
        string st; cin >> st;
        add(st, 1);
    }

    dfs(0);
    cout << (dp[0] ? "Nina" : "Emilija");
    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