# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
56541 | admin | Islands (IOI08_islands) | C++14 | 702 ms | 131908 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;
using ll = long long;
const int N = 1000010;
const ll INF = 1e18;
ll par[N], len[N], deg[N], h1[N], h2[N], dp[N];
int main()
{
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
int v, w;
scanf("%d%d", &v, &w);
par[i] = v;
len[i] = w;
++deg[v];
}
queue<int> Q;
for (int i = 1; i <= n; ++i) {
if (deg[i] == 0)
Q.push(i);
}
while (!Q.empty()) {
int u = Q.front(); Q.pop();
int v = par[u];
ll w = len[u];
if (h1[u]+w > h1[v]) {
h2[v] = h1[v];
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |