Submission #1153898

#	Time	Username	Problem	Language	Result	Execution time	Memory
1153898		kxd	Vlak (COCI20_vlak)	C++20	70 / 70	62 ms	25160 KiB

Main

#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb emplace_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif

using namespace std;
const int N = 2e5+5;
const int M = 2005;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;

int a[N];
int G[N][27];
map<int,int> mp;
int last = 0;
int flag = 0;

void add(string &s) {
    int curr = 0;
    for(char ch: s) {
        int &t = G[curr][ch-'a'];
        if(t == 0) t = ++last;
        if(mp.count(t)) mp[t] = 2;
        else mp[t] = flag;
        curr = t;
    }
}

int solve(int i, int turn) {
    int c = 0;
	int win = 0;
    forn(j,26) {
        if(G[i][j] && mp[G[i][j]] != (1-turn%2)) {
            if(solve(G[i][j], turn+1)) win++;
            c++;
        }
    }
    if(!c || c == win) return 0;
    else return 1;
}

signed main() {
	INIT
	#ifdef DEBUG
	freopen("input.txt", "r", stdin);
	#endif
	///////////
    int n, m;
    string s;
    cin >> n;
    while(n--) {
        cin >> s;
        add(s);
    }
    flag = 1;
    cin >> m;
    while(m--) {
        cin >> s;
        add(s);
    }
    if(solve(0,0)) cout << "Nina";
    else cout << "Emilija";
}

• 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