# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1172916 | Warinchai | Vlak (COCI20_vlak) | C++20 | 19 ms | 24648 KiB |
#include<bits/stdc++.h>
using namespace std;
vector<string>a;
vector<string>b;
struct node{
node* next[30];
int nhas,nwin,ehas,ewin;
node(){
for(int i=0;i<30;i++)next[i]=NULL;
nhas=nwin=ehas=ewin=0;
}
};
typedef node* pnode;
pnode rt=new node();
void dfs(pnode u){
int ewin=0;
int nwin=0;
//cerr<<u<<"\n";
for(int i=0;i<26;i++)if(u->next[i]){
//cerr<<"child:"<<u<<" "<<i<<" "<<u->next[i]<<"\n";
dfs(u->next[i]);
if((u->next[i]->nhas)&&(u->next[i]->ewin==0))nwin=1;
if((u->next[i]->ehas)&&(u->next[i]->nwin==0))ewin=1;
}
u->ewin=ewin,u->nwin=nwin;
}
int main(){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |