oj.uz

Submission #974314

# Submission time Handle Problem Language Result Execution time Memory
974314 2024-05-03T08:17:28 Z PieArmy Vlak (COCI20_vlak) C++17
70 / 70
 8 ms 9820 KB 
#pragma GCC optimize("O3,fast-math,unroll-all-loops")
#include <bits/stdc++.h>
using namespace std;

int trie[200001][26];
bool var[200001][2];
int las=1;

void ekle(string word,int player){
    int pos=0;
    for(char c:word){
        if(!trie[pos][c-'a']){
            trie[pos][c-'a']=las++;
        }
        pos=trie[pos][c-'a'];
        var[pos][player]=1;
    }
}

bool dfs(int pos,int sira){
    for(int i=0;i<26;i++){
        if(!trie[pos][i])continue;
        if(!var[trie[pos][i]][sira])continue;
        if(dfs(trie[pos][i],sira^1)==sira)return sira;
    }
    return sira^1;
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(NULL);
	int n;cin>>n;
    for(int i=0;i<n;i++){
        string s;cin>>s;
        ekle(s,0);
    }
    cin>>n;
    for(int i=0;i<n;i++){
        string s;cin>>s;
        ekle(s,1);
    }
    if(dfs(0,0))cout<<"Emilija";
    else cout<<"Nina";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9052 KB Output is correct
2 Correct 8 ms 8540 KB Output is correct
3 Correct 6 ms 8028 KB Output is correct
4 Correct 7 ms 9000 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9428 KB Output is correct
2 Correct 7 ms 9820 KB Output is correct
3 Correct 6 ms 9052 KB Output is correct
4 Correct 6 ms 9052 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8796 KB Output is correct
2 Correct 6 ms 8540 KB Output is correct
3 Correct 6 ms 8796 KB Output is correct
4 Correct 7 ms 9308 KB Output is correct