oj.uz

Submission #415981

# Submission time Handle Problem Language Result Execution time Memory
415981 2021-06-01T18:50:11 Z fvogel499 Vlak (COCI20_vlak) C++14
70 / 70
 48 ms 28708 KB 
/*
File created on 06/01/2021 at 20:08:52.
Link to problem: https://oj.uz/problem/view/COCI20_vlak
Description: create a trie and run a DP win/lose
Time complexity: O()
Space complexity: O()
Status: DEV
Copyright: Ⓒ 2021 Francois Vogel
*/

#include <iostream>
#include <cmath>
#include <vector>
#include <bitset>
#include <queue>
#include <cstring>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <algorithm>

using namespace std;

#define pb push_back
#define ins insert
#define cls clear

#define ll long long

struct Node {
    Node() {
        for (int i = 0; i < 26; i++) c[i] = nullptr;
    }
    void add(string& s, int player) {
        if (!s.empty()) {
            int i = s[s.size()-1]-'a';
            if (c[i] == nullptr) c[i] = new Node();
            p[player].pb(c[i]);
            s.pop_back();
            c[i]->add(s, player);
        }
    }
    Node* c [26];
    vector<Node*> p [2];
};

map<pair<Node*, int>, bool> se;

// true if player wins if his turn is on node i, false otherwise
bool recDP(Node* i, int player) {
    pair<Node*, int> lp = pair<Node*, int>(i, player);
    if (se.find(lp) != se.end()) return se[lp];
    for (Node* j : i->p[player]) {
        if (!recDP(j, (player == 0 ? 1 : 0))) {
            return se[lp] = true;
        }
    }
    return se[lp] = false;
}

signed main() {
    cin.tie(0);
    // ios_base::sync_with_stdio(0);

    Node* root = new Node();

    int aS;
    cin >> aS;
    string lS;
    for (int i = 0; i < aS; i++) {
        cin >> lS;
        reverse(lS.begin(), lS.end());
        root->add(lS, 0);
    }
    
    int bS;
    cin >> bS;
    for (int i = 0; i < bS; i++) {
        cin >> lS;
        reverse(lS.begin(), lS.end());
        root->add(lS, 1);
    }

    bool res = recDP(root, 0);

    if (res) cout << "Nina";
    else cout << "Emilija";

    int d = 0;
    d++;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Correct 2 ms 588 KB Output is correct
4 Correct 1 ms 548 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 26632 KB Output is correct
2 Correct 48 ms 25284 KB Output is correct
3 Correct 37 ms 24004 KB Output is correct
4 Correct 37 ms 26144 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 27440 KB Output is correct
2 Correct 35 ms 28708 KB Output is correct
3 Correct 35 ms 26668 KB Output is correct
4 Correct 45 ms 26948 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 25896 KB Output is correct
2 Correct 41 ms 25468 KB Output is correct
3 Correct 36 ms 26128 KB Output is correct
4 Correct 40 ms 27648 KB Output is correct