# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114765 | luciocf | Pipes (BOI13_pipes) | C++14 | 1082 ms | 131072 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;
const int maxn = 1e5+10;
const int maxm = 5e5+10;
typedef pair<int, int> pii;
int a[maxn], cur[maxn];
int edge[maxn], costEdge[maxm];
vector<pii> grafo[maxn];
void dfs(int u, int p)
{
for (auto pp: grafo[u])
{
int v = pp.first, e = pp.second;
if (v == p) continue;
edge[v] = e;
dfs(v, u);
cur[u] += costEdge[e]/2;
}
if (u != 1)
{
costEdge[edge[u]] = 2*(a[u]-cur[u]);
cur[u] = a[u];
}
}
int main(void)
{
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= m; i++)
{
int u, v;
scanf("%d %d", &u, &v);
grafo[u].push_back({v, i});
grafo[v].push_back({u, i});
}
dfs(1, 0);
for (int i = 1; i <= m; i++)
printf("%d\n", costEdge[i]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |