# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
84247 | IOrtroiii | Pipes (BOI13_pipes) | C++14 | 91 ms | 9380 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 N = 100005;
int n, m;
int deg[N];
bool ok[N];
long long a[N], ans[N];
vector<pair<int,int>> g[N];
void dfs(int u,int p) {
}
int main() {
scanf("%d %d", &n, &m);
if (n < m) return printf("0\n"),0;
for (int i = 1; i <= n; ++i) scanf("%lld", a + i);
for (int i = 1; i <= m; ++i) {
int u, v; scanf("%d %d", &u, &v);
++deg[u], ++deg[v];
g[u].push_back({v, i}), g[v].push_back({u, i});
}
queue<int> q;
for (int u = 1; u <= n; ++u) if (deg[u] == 1) {
q.push(u);
}
while (!q.empty()) {
int u = q.front(); q.pop();
for (auto e : g[u]) {
int v = e.first;
int id = e.second;
if (ok[v] == false) {
ans[id] = a[u];
a[u] -= ans[id];
a[v] -= ans[id];
ok[u] = true;
if (--deg[v] == 1) {
q.push(v);
}
}
}
}
for (int i = 1; i <= n; ++i) if (a[i]) return printf("0\n"),0;
for (int i = 1; i <= m; ++i) if (ans[i] > (long long) 5e8 || ans[i] < (long long) -5e8) {
return printf("0\n"),0;
}
for (int i = 1; i <= m; ++i) printf("%lld\n", 2 * ans[i]);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |