Submission #1283342

#	Time	Username	Problem	Language	Result	Execution time	Memory
1283342		vahagng	Vlak (COCI20_vlak)	C++20	70 / 70	31 ms	55588 KiB

Main

//----------vahagng----------//
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;

// template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif

void print(long long t) { cerr << t; }
void print(int t) { cerr << t; }
void print(string t) { cerr << t; }
void print(char t) { cerr << t; }
void print(double t) { cerr << t; }
void print(long double t) { cerr << t; }
void print(unsigned long long t) { cerr << t; }

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[], V n) { cerr << "["; for (int i = 0; i < n; i++) { cerr << v[i] << " "; } cerr << "]"; }
template <class T, class V> void print(pair <T, V> p) { cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}"; }
template <class T> void print(vector <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(set <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T> void print(multiset <T> v) { cerr << "[ "; for (T i : v) { print(i); cerr << " "; } cerr << "]"; }
template <class T, class V> void print(map <T, V> v) { cerr << "[ "; for (auto i : v) { print(i); cerr << " "; } cerr << "]"; }

#define ll long long
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ld long double
#define sz(v) v.size()
#define endl '\n'

const ll inf = 2e18, mod = 1e9 + 7, mod2 = 998244353;

void SetIO(string str = "") {
    if (str != "") {
        freopen((str + ".in").c_str(), "r", stdin);
        freopen((str + ".out").c_str(), "w", stdout);
    }
    else {
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    }
}

void FastIO() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}

const int N = 2e5 + 10, M = 1e7 + 10;

mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());

ll binpow(ll a, ll b, ll m) {
    ll res = 1;
    while (b) {
        if (b & 1) {
            res = (res * a) % m;
        }
        b >>= 1;
        a = (a * a) % m;
    }
    return res;
}

const double eps = 1e-7;

int n, m;
string s[N], t[N];
vector<int>adj[N];

struct Trie{
    int t[N][26], qn[N], cnt = 0;
 
    void init(){
        cnt = 0;
        for(int i = 0; i < N; i++){
            for(int j = 0; j < 26; j++){
                t[i][j] = -1;
            }
            qn[i] = 0;
        }
    }
 
    void upd(string x){
        int st = 0;
        for(int i = 0; i < x.size(); i++) {
            qn[st]++;
            if(t[st][x[i] - 'a'] == -1){
                t[st][x[i] - 'a'] = ++cnt;
            }
            st = t[st][x[i] - 'a'];
        }
        qn[st]++;
    }

} tr[2];

bool dfs(int st1, int st2, bool hert){
    if(hert == 0){
        if(st1 == -1) return 0;
        if(st2 == -1) return 1;
        for(int i = 0; i < 26; i++){
            if(tr[0].t[st1][i] == -1) continue;
            if(dfs(tr[0].t[st1][i], tr[1].t[st2][i], hert^1) == 1){
                return 1;
            }
        }
        return 0;
    }else{
        if(st2 == -1) return 1;
        if(st1 == -1) return 0;
        for(int i = 0; i < 26; i++){
            if(tr[1].t[st2][i] == -1) continue;
            if(dfs(tr[0].t[st1][i], tr[1].t[st2][i], hert^1) == 0){
                return 0;
            }
        }
        return 1;
    }
}

void solve(int tc) {
    cin >> n;
    tr[0].init();
    tr[1].init();
    for(int i = 1; i <= n ;i++){
        cin >> s[i];
        tr[0].upd(s[i]);
    }
    cin >> m;
    for(int i = 1; i <= m; i++){
        cin >> t[i];
        tr[1].upd(t[i]);
    }
    bool flag = dfs(0, 0, 0);
    cout << (flag ? "Nina\n" : "Emilija\n");
}


void precalc() {

}

int main() {
    // SetIO("teamwork");
    FastIO();
    int test_case = 1;
    // cin >> test_case;
    precalc();
    int cnt = 1;
    while (test_case--) {
        solve(cnt++);
    }
    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'void SetIO(std::string)':
Main.cpp:47:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   47 |         freopen((str + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:48:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |         freopen((str + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:51:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:52:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |         freopen("output.txt", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

• 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