# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152697 | Segtree | Werewolf (IOI18_werewolf) | C++14 | 202 ms | 27280 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<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
vector<ll> g[3010];
bool vis[3010][2];
void dfs(ll x,ll l,ll r,bool dir){
if(not(l<=x&&x<=r))return;
if(vis[x][dir])return;
vis[x][dir]=1;
for(auto y:g[x]){
dfs(y,l,r,dir);
}
}
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++){
g[X[i]].push_back(Y[i]);
g[Y[i]].push_back(X[i]);
}
vector<int> ans;
for(int q=0;q<S.size();q++){
for(int i=1;i<=N;i++)vis[i][0]=vis[i][1]=0;
dfs(S[q],L[q],N,0);
dfs(E[q],1,R[q],1);
ans.push_back(0);
for(int i=1;i<=N;i++){
if(vis[i][0]==1&&vis[i][1]==1){
ans[q]=1;
}
}
}
return ans;
}/*
int main(){
return 0;
}*/
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... |