# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
420371 | A_D | Werewolf (IOI18_werewolf) | C++14 | 4070 ms | 28112 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
const int N=2e5+100;
vector<int> g[N];
bool vis[N][2];
int l,r;
bool ok(int u,int f)
{
if(f==1){
if(u>r)return 0;
}
else{
if(u<l)return 0;
}
return 1;
}
void dfs(int u,int f)
{
vis[u][f]=1;
if(l<=u&&u<=r&&f==0){
dfs(u,1);
}
for(auto x:g[u]){
if(vis[x][f])continue;
if(ok(x,f)){
dfs(x,f);
}
}
}
vector<int> check_validity(int N,vector<int> X,vector<int> Y,vector<int> S,vector<int> E,vector<int> L,vector<int> R){
vector<int> ret;
for(int i=0;i<X.size();i++){
g[X[i]].push_back(Y[i]);
}
for(int t=0;t<S.size();t++){
for(int i=0;i<=N;i++){
vis[i][0]=0;
vis[i][1]=0;
}
l=L[t];
r=R[t];
dfs(S[t],0);
if(vis[E[t]][1]){
ret.push_back(1);
}
else{
ret.push_back(0);
}
}
return ret;
}
Compilation message (stderr)
# | 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... |