oj.uz

Submission #1091204

# Submission time Handle Problem Language Result Execution time Memory
1091204 2024-09-20T06:02:02 Z Rafat Vlak (COCI20_vlak) C++14
70 / 70
 18 ms 34080 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <time.h>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <cstring>

using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iostream>

using namespace __gnu_pbds;
using namespace std;
template <class T>
using Tree =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// to erase in multiset-> less_equal<T> and 
// s.erase(s.find_by_order(s.order_of_key(x)))
// lower_bound(x)=>(cannot use the stl lower_bound function)
// ll idx = s.order_of_key(x)
// if(idx == s.size()) -> no lower_bound
// else lb = *s.find_by_order(idx) // as 0-indexing
// idx-1 will give highest value which is strictly less than x
// for upper_bound->do the same with (x+1)

typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef tuple<ll, ll, ll> t64;
typedef vector<t64> vt64;
typedef vector<vt64> vvt64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
typedef vector<vector<p32> > vvp32;
typedef vector<bool> vb;
ll mod =  1e9+7, MOD = 998244353;
double eps = 1e-12;
// #define forn(i,e) for(ll i = 0; i < e; i++)
#define FOR(s, e, i) for(int i = s; i <= e; i++)
// #define rforn(i,s) for(ll i = s; i >= 0; i--)
#define ROF(s ,e, i) for(int i = s; i >= e; i--)
#define coutAll(A) for(auto asdafas : A) cout <<  asdafas << " "; cout << "\n";
#define foutAll(A) for(auto asdafas : A) fout <<  asdafas << " "; cout << "\n";
#define cinAll(A) for(auto &asdafas : A) cin >>  asdafas;
#define finAll(A) for(auto &asdafas : A) fin >>  asdafas;
#define minpq priority_queue<ll, v64, greater<ll>>
#define maxpq priority_queue<ll> 
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
ll inf = LLONG_MAX;
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef pair<ll, ll> pll;
typedef pair<ll, ll> pii;
// #define MAXN 1000001

const int MAXN = 1e6+1;
int Trie[MAXN][26];
int reach[MAXN][2];
int node_count;
vv32 adj(MAXN);
// 0->root
void insert(string s, int p){
    int node = 0;
    int n = s.size();
    for(auto x : s){
        if(Trie[node][(int)(x-'a')] == 0){Trie[node][(int)(x-'a')] = ++node_count;}
        // adj[node].pb(Trie[node][(int)(x-'a')]);
        node = Trie[node][(int)(x-'a')];
        reach[node][p] = true;
    }
}
bool dp(int pos, int node){
    if(reach[node][pos] == false) return false;
    bool ans = true;
    FOR(0, 25, i){
        if(Trie[node][i]){
            ans = ans && !dp((pos^1), Trie[node][i]);
        }
    }
    return ans;
}

void solve(int it)
{
    int n, m;
    cin >> n;
    // vector<string>A(n);
    // cinAll(A);
    FOR(0, n -1, i){
        string s;
        cin >> s;
        insert(s, 0);
    }
    
    cin >> m;
    FOR(0, m -1, i){
        string s;
        cin >> s;
        insert(s, 1);
    }
    bool ans = false;
    FOR(0, 25, i){
        if(Trie[0][i]){
            ans = ans || dp(0, Trie[0][i]);
        }
    }
    cout << (ans ? "Nina" : "Emilija");
    
}


int main()
{
    fast_cin();    
    ll t = 1;
    // cin >> t;
    for(int it=1; it<=t; it++)
    {
        //cout << "Case " << it << ": ";
        solve(it);
    }
    return 0;
}

Compilation message

Main.cpp: In function 'void insert(std::string, int)':
Main.cpp:88:9: warning: unused variable 'n' [-Wunused-variable]
   88 |     int n = s.size();
      |         ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23900 KB Output is correct
2 Correct 11 ms 23900 KB Output is correct
3 Correct 9 ms 24088 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 23900 KB Output is correct
2 Correct 9 ms 23984 KB Output is correct
3 Correct 11 ms 23900 KB Output is correct
4 Correct 9 ms 23976 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23900 KB Output is correct
2 Correct 10 ms 23900 KB Output is correct
3 Correct 9 ms 23900 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 23904 KB Output is correct
2 Correct 10 ms 24028 KB Output is correct
3 Correct 10 ms 23932 KB Output is correct
4 Correct 10 ms 23896 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 33376 KB Output is correct
2 Correct 16 ms 32860 KB Output is correct
3 Correct 15 ms 32356 KB Output is correct
4 Correct 16 ms 33116 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 33628 KB Output is correct
2 Correct 15 ms 34080 KB Output is correct
3 Correct 15 ms 33304 KB Output is correct
4 Correct 15 ms 33372 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 33116 KB Output is correct
2 Correct 16 ms 32860 KB Output is correct
3 Correct 16 ms 32968 KB Output is correct
4 Correct 16 ms 33628 KB Output is correct