# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
332430 | pggp | Werewolf (IOI18_werewolf) | C++14 | 4045 ms | 31852 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 <bits/stdc++.h>
using namespace std;
vector < bool > used_wer;
vector < bool > used_hum;
vector < vector < int > > Ed;
int cur_R, cur_L;
void wer_dfs(int vertex){
used_wer[vertex] = true;
for(int v : Ed[vertex]){
if(!used_wer[v] and v <= cur_R){
wer_dfs(v);
}
}
}
void hum_dfs(int vertex){
used_hum[vertex] = true;
for(int v : Ed[vertex]){
if(!used_hum[v] and v >= cur_L){
hum_dfs(v);
}
}
}
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 > ans;
int Q = E.size();
Ed.resize(N);
used_wer.resize(N);
used_hum.resize(N);
for (int i = 0; i < X.size(); ++i)
{
Ed[X[i]].push_back(Y[i]);
Ed[Y[i]].push_back(X[i]);
}
for(int q = 0; q < Q; q++){
cur_R = R[q];
cur_L = L[q];
for (int i = 0; i < N; ++i)
{
used_hum[i] = false;
used_wer[i] = false;
}
hum_dfs(S[q]);
wer_dfs(E[q]);
int to_return = 0;
for (int i = 0; i < N; ++i)
{
if(used_hum[i] and used_wer[i]){
to_return = 1;
}
}
ans.push_back(to_return);
}
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... |