# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1066965 | Muhammad_Aneeq | Werewolf (IOI18_werewolf) | C++17 | 4062 ms | 39148 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 <vector>
#include <queue>
#include <iostream>
#include <algorithm>
#include "bits/stdc++.h"
using namespace std;
int const N=2e5+10;
vector<int>nei[N]={};
bool reach[N]={};
int l,r;
void dfs(int u,int form=0)
{
reach[u]=1;
for (auto i:nei[u])
{
if (reach[i])
continue;
if (i>r&&form==1)
continue;
if (u<l&&i>r)
continue;
if (u>r&&i<l)
continue;
if (i<l)
dfs(i,1);
else
dfs(i,form);
}
}
vector<int> check_validity(int N, vector<int> X, vector<int> Y,vector<int> S, vector<int> E,vector<int> L, vector<int> R)
{
for (int i=0;i<X.size();i++)
{
nei[X[i]].push_back(Y[i]);
nei[Y[i]].push_back(X[i]);
}
vector<int>ans;
for (int i=0;i<S.size();i++)
{
l=L[i],r=R[i];
dfs(S[i]);
ans.push_back(reach[E[i]]);
for (int j=0;j<N;j++)
reach[j]=0;
}
return ans;
}
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... |