# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1043497 | Zicrus | Werewolf (IOI18_werewolf) | C++17 | 4072 ms | 21644 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>
#include "werewolf.h"
using namespace std;
typedef long long ll;
ll n, m, q;
vector<vector<ll>> adj;
bool solve(ll s, ll e, ll l, ll r) {
queue<ll> q;
q.push(s);
vector<bool> vstH(n), vstW(n);
while (!q.empty()) {
ll node = q.front(); q.pop();
if (vstH[node]) continue;
vstH[node] = true;
for (auto &e : adj[node]) {
if (e < l) continue;
q.push(e);
}
}
q.push(e);
while (!q.empty()) {
ll node = q.front(); q.pop();
if (vstH[node]) return true;
if (vstW[node]) continue;
vstW[node] = true;
for (auto &e : adj[node]) {
if (e > r) continue;
# | 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... |