| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 602365 | jairRS | Werewolf (IOI18_werewolf) | C++17 | 4059 ms | 29320 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;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
vvi adj;
void dfsHuman(int src, vector<bool> &reachable, int L)
{
if (src < L)
return;
reachable[src] = true;
for (int a : adj[src])
{
if (reachable[a])
continue;
dfsHuman(a, reachable, L);
}
}
void dfsWolf(int src, vector<bool> &reachable, int R)
{
if (src > R)
return;
reachable[src] = true;
for (int a : adj[src])
{
if (reachable[a])
continue;
dfsWolf(a, reachable, R);
}
}
vi check_validity(int N, vi X, vi Y, vi S, vi E, vi L, vi R)
{
adj = vvi(N);
for (int i = 0; i < X.size(); i++)
{
adj[X[i]].push_back(Y[i]);
adj[Y[i]].push_back(X[i]);
}
auto printVec = [](vector<bool> &vec)
{
for (bool x : vec)
cout << x << " ";
cout << endl;
};
int Q = S.size();
vi ans(Q, false);
for (int i = 0; i < Q; i++)
{
// cout << "Query ID: " << i << '\n';
vector<bool> reachableHuman(N, false);
dfsHuman(S[i], reachableHuman, L[i]);
// printVec(reachableHuman);
vector<bool> reachableWolf(N, false);
dfsWolf(E[i], reachableWolf, R[i]);
// printVec(reachableWolf);
for (int a = L[i]; a <= R[i]; a++)
ans[i] |= (reachableHuman[a] && reachableWolf[a]);
}
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... | ||||
