oj.uz

Submission #931854

# Submission time Handle Problem Language Result Execution time Memory
931854 2024-02-22T12:37:09 Z Whisper Vlak (COCI20_vlak) C++17
70 / 70
 14 ms 20572 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nA, nB;
struct Node{
    bool mark[2];
    Node *child[26];
    Node(){
        mark[0] = mark[1] = 0;
        REP(c, 26) child[c] = nullptr;
    }
};
Node *root = new Node();


void Add(string &s, int x){
    Node *p = root;
    for (auto&c : s){
        int nxt = c - 'a';
        if (p -> child[nxt] == nullptr){
            p -> child[nxt] = new Node();
        }
        p = p -> child[nxt];
        p -> mark[x] = 1;
    }
}

bool dfs(Node* p, int turn = 0){
    REP(c, 26){
        if (p -> child[c] == nullptr) continue;
        if (p -> child[c] -> mark[turn] == 0) continue;
        if (dfs(p -> child[c], turn ^ 1) == turn) return turn;
    }
    return 1 - turn;
}
vector<char> r;
void Whisper(){
    cin >> nA;
    FOR(i, 1, nA){
        string s; cin >> s;
        Add(s, 0);
    }
    cin >> nB;
    FOR(i, 1, nB){
        string s; cin >> s;
        Add(s, 1);
    }
    int ans = 0;
    cout << (!dfs(root) ? "Nina" : "Emilija");
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Compilation message

Main.cpp: In function 'void Whisper()':
Main.cpp:90:9: warning: unused variable 'ans' [-Wunused-variable]
   90 |     int ans = 0;
      |         ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 604 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 19292 KB Output is correct
2 Correct 11 ms 18012 KB Output is correct
3 Correct 14 ms 16984 KB Output is correct
4 Correct 12 ms 18780 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 19544 KB Output is correct
2 Correct 11 ms 20572 KB Output is correct
3 Correct 11 ms 18780 KB Output is correct
4 Correct 12 ms 19208 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 18576 KB Output is correct
2 Correct 11 ms 18012 KB Output is correct
3 Correct 10 ms 18524 KB Output is correct
4 Correct 12 ms 19816 KB Output is correct