# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1038531 | vjudge1 | Werewolf (IOI18_werewolf) | C++17 | 175 ms | 32712 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;
vector<int>adj[100100];
bitset<100100> i_could1,i_could2;
int l,r;
void dfs_h(int n){
if(n<l)return;
if(i_could1[n])return;
i_could1[n]=1;
for(auto i:adj[n])
dfs_h(i);
}
void dfs_w(int n){
if(n>r)return;
if(i_could2[n])return;
i_could2[n]=1;
for(auto i:adj[n])
dfs_w(i);
}
std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y,
std::vector<int> S, std::vector<int> E,
std::vector<int> L, std::vector<int> R) {
for(int i=0;i<X.size();i++)
adj[X[i]].push_back(Y[i]),
adj[Y[i]].push_back(X[i]);
int Q = S.size();
std::vector<int> A(Q);
for (int i = 0; i < Q; ++i) {
i_could1.reset();
i_could2.reset();
l=L[i],r=R[i];
dfs_h(S[i]);
dfs_w(E[i]);
for(int j=l;j<=r;j++)
A[i]|=i_could1[j]&i_could2[j];
}
return A;
}
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... |