oj.uz

Submission #688576

# Submission time Handle Problem Language Result Execution time Memory
688576 2023-01-27T18:23:10 Z rieyuw Vlak (COCI20_vlak) C++17
70 / 70
 100 ms 67656 KB 
#include <bits/stdc++.h>

using namespace std;

const int mxN = 2e5+1;
vector<vector<array<int,3>>> nxt(mxN, vector<array<int,3>>(26));
 
bool dfs(int node, int depth)
{
    int par = (depth & 1);
    bool res = !par;
    for (int i = 0; i < 26 && res != par; ++i)
    {
        array<int,3>& p = nxt[node][i];
        if (p[0] != 0 & p[2-par])
        {
            bool neigRes = dfs(p[0], depth+1);
            if (par)
                res |= neigRes;
            else
                res &= neigRes;
        }
    }
    return res;
}

int main() 
{
    ios::sync_with_stdio(0), cin.tie(0);
    int n; cin >> n;
    string s;
    int MAXID = 0;
    while(n--)
    {
        cin >> s;
        int node = 0;
        for (char c : s)
        {
            array<int,3>& p = nxt[node][c-'a'];
            if (p[0] == 0)
                p[0] = ++MAXID;
            p[1] = 1;
            node = p[0];
        }        
    }
 
    int m; cin >> m;
    while(m--)
    {
        cin >> s;
        int node = 0;
        for (char c : s)
        {
            array<int,3>& p = nxt[node][c-'a'];
            if (p[0] == 0)
                p[0] = ++MAXID;
            p[2] = 1;
            node = p[0];
        }        
    }
    cout << (dfs(0, 1) ? "Nina" : "Emilija") << "\n";
}

Compilation message

Main.cpp: In function 'bool dfs(int, int)':
Main.cpp:15:18: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
   15 |         if (p[0] != 0 & p[2-par])

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 67568 KB Output is correct
2 Correct 84 ms 67580 KB Output is correct
3 Correct 85 ms 67656 KB Output is correct
4 Correct 83 ms 67620 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 67584 KB Output is correct
2 Correct 87 ms 67512 KB Output is correct
3 Correct 89 ms 67584 KB Output is correct
4 Correct 86 ms 67560 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 67624 KB Output is correct
2 Correct 84 ms 67552 KB Output is correct
3 Correct 86 ms 67544 KB Output is correct
4 Correct 86 ms 67628 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 67620 KB Output is correct
2 Correct 85 ms 67592 KB Output is correct
3 Correct 84 ms 67556 KB Output is correct
4 Correct 83 ms 67552 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 67632 KB Output is correct
2 Correct 89 ms 67568 KB Output is correct
3 Correct 92 ms 67612 KB Output is correct
4 Correct 91 ms 67612 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 67588 KB Output is correct
2 Correct 89 ms 67560 KB Output is correct
3 Correct 91 ms 67544 KB Output is correct
4 Correct 100 ms 67536 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 67532 KB Output is correct
2 Correct 91 ms 67532 KB Output is correct
3 Correct 90 ms 67628 KB Output is correct
4 Correct 97 ms 67612 KB Output is correct