# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
430561 | keko37 | From Hacks to Snitches (BOI21_watchmen) | C++14 | 3001 ms | 173708 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;
typedef long long llint;
typedef pair <int, int> pi;
const int MAXN = 250005;
const llint INF = 1000000000000000000LL;
int n, m, k;
int d[MAXN], ost[MAXN], koji[MAXN], prv[MAXN], nxt[MAXN];
llint best[MAXN], dist[3005][3005];
vector <pi> edges;
bool watched[MAXN];
vector <int> good, bad, sus_good[MAXN], sus_bad[MAXN];
void build () {
for (int i = 1; i <= n; i++) {
if (watched[i]) bad.push_back(i); else good.push_back(i);
}
for (int i = 0; i < bad.size(); i++) {
koji[bad[i]] = i;
}
for (auto pp : edges) {
int a = pp.first, b = pp.second;
if (watched[b]) sus_bad[a].push_back(b); else sus_good[a].push_back(b);
if (watched[a]) sus_bad[b].push_back(a); else sus_good[b].push_back(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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |