oj.uz

Submission #968670

# Submission time Handle Problem Language Result Execution time Memory
968670 2024-04-23T20:00:24 Z RandomUser Vlak (COCI20_vlak) C++17
70 / 70
 19 ms 17756 KB 
#include <bits/stdc++.h>
 
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long
 
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
 
void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}
 
struct Node {
    bool isWord;
    vector<int> dp;
    map<char, Node*> child;
 
    Node() : isWord(false), dp(2, 0) {}
};
 
struct Trie {
    Node *root;
 
    Trie() {
        root = new Node();
    }
 
    ~Trie() {
        delete root;
    }
 
    void insert(string word, int player) {
        Node *curr = root;
        for(char &ch : word) {
            if(!curr->child.count(ch))
                curr->child[ch] = new Node();
            curr = curr->child[ch];
            curr->dp[player] = 1;
        }
 
        curr->isWord = true;
    }
 
    bool search(string word) {
        Node *curr = root;
 
        for(char &ch : word) {
            if(!curr->child.count(ch)) return false;
            curr = curr->child[ch];
        }
 
        return curr->isWord;
    }
 
    bool dfs(Node *curr, int turn, char ch) {
        if(!curr->dp[turn] && ch != ' ') return false;
        bool ans = 1;
 
        for(auto &next : curr->child)
            ans &= dfs(next.second, 1 - turn, next.first);
 
        return 1 - ans;
    }
 
    void callDFS() {
        bool ans = dfs(root, 0, ' ');
        if(ans == 1) cout << "Nina\n";
        else cout << "Emilija\n";
    }
};
 
int32_t main() {
    setIO();
 
    Trie trie;
 
    int n;
    cin >> n;
    for(int i=0; i<n; i++) {
        string s;
        cin >> s;
        trie.insert(s, 0);
    }
 
    int m;
    cin >> m;
    for(int i=0; i<m; i++) {
        string s;
        cin >> s;
        trie.insert(s, 1);
    }
 
    trie.callDFS();
    return 0;
}

Subtask #1
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 1 ms 456 KB Output is correct

Subtask #2
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 464 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 1 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 0 ms 604 KB Output is correct
2 Correct 1 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 #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 16476 KB Output is correct
2 Correct 17 ms 15528 KB Output is correct
3 Correct 17 ms 14684 KB Output is correct
4 Correct 17 ms 16140 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 16956 KB Output is correct
2 Correct 15 ms 17756 KB Output is correct
3 Correct 13 ms 16264 KB Output is correct
4 Correct 14 ms 16728 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 16216 KB Output is correct
2 Correct 14 ms 15704 KB Output is correct
3 Correct 15 ms 15964 KB Output is correct
4 Correct 16 ms 16984 KB Output is correct