#include <bits/stdc++.h>
#define int int64_t
using namespace std;
typedef pair<int, int> pii;
const int maxn = 1e5 + 10;
const int maxm = 5e5 + 10;
vector<int> grafo[maxn];
int n;
int s[maxn];
map<pair<int, int>, int> mapa;
int val[maxn], ans[maxn];
namespace tree{
int nivel[maxn], pai[maxn], soma[maxn];
void dfs(int u, int p = 0) {
pai[u] = p;
for(auto v : grafo[u]) {
if(v == p) continue;
nivel[v] = nivel[u] + 1;
dfs(v, u);
}
}
};
int32_t main() {
int m;
cin >> n >> m;
if(m > n) {
cout << "0\n";
return 0;
}
int total = 0;
for(int i=1;i<=n;i++)
cin >> s[i], s[i] *= 2, total += s[i];
for(int i=1;i<=m;i++) {
int a, b;
cin >> a >> b;
grafo[a].push_back(b);
grafo[a].push_back(b);
mapa[{a, b}] = i;
mapa[{b, a}] = i;
}
if(n - 1 == m) {
tree::dfs(1);
vector<pii> arr;
for(int i=1;i<=n;i++)
arr.push_back({tree::nivel[i], i});
sort(arr.begin(), arr.end(), greater<pii>());
for(auto e : arr) {
int v = e.second;
int u = tree::pai[v];
tree::soma[u] += (s[v] - tree::soma[v]);
ans[mapa[{u, v}]] = (s[v] - tree::soma[v]);
}
if(tree::soma[1] != s[1]){
cout << "0\n";
return 0;
}
for(int i=1;i<=m;i++)
cout << ans[i] << "\n";
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 2 |
Incorrect |
6 ms |
2688 KB |
Output isn't correct |
| 3 |
Incorrect |
5 ms |
2944 KB |
Output isn't correct |
| 4 |
Incorrect |
258 ms |
26468 KB |
Output isn't correct |
| 5 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 6 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 7 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 8 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 9 |
Incorrect |
5 ms |
2944 KB |
Output isn't correct |
| 10 |
Incorrect |
5 ms |
2944 KB |
Output isn't correct |
| 11 |
Incorrect |
6 ms |
2992 KB |
Output isn't correct |
| 12 |
Incorrect |
5 ms |
2944 KB |
Output isn't correct |
| 13 |
Incorrect |
198 ms |
21604 KB |
Output isn't correct |
| 14 |
Incorrect |
234 ms |
25188 KB |
Output isn't correct |
| 15 |
Incorrect |
254 ms |
26604 KB |
Output isn't correct |
| 16 |
Incorrect |
204 ms |
22952 KB |
Output isn't correct |
| 17 |
Incorrect |
256 ms |
26524 KB |
Output isn't correct |
| 18 |
Incorrect |
256 ms |
26728 KB |
Output isn't correct |
| 19 |
Incorrect |
255 ms |
26468 KB |
Output isn't correct |
| 20 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 21 |
Incorrect |
5 ms |
2944 KB |
Output isn't correct |
| 22 |
Incorrect |
303 ms |
26520 KB |
Output isn't correct |
| 23 |
Incorrect |
200 ms |
21556 KB |
Output isn't correct |
| 24 |
Incorrect |
255 ms |
26472 KB |
Output isn't correct |
| 25 |
Incorrect |
207 ms |
22804 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 2 |
Incorrect |
5 ms |
2816 KB |
Output isn't correct |
| 3 |
Incorrect |
206 ms |
17840 KB |
Output isn't correct |
| 4 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 5 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 6 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 7 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 8 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 9 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 10 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 11 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 12 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 14 |
Incorrect |
4 ms |
2688 KB |
Output isn't correct |
| 15 |
Incorrect |
5 ms |
2816 KB |
Output isn't correct |
| 16 |
Incorrect |
5 ms |
2816 KB |
Output isn't correct |
| 17 |
Incorrect |
5 ms |
2816 KB |
Output isn't correct |
| 18 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 19 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 20 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 21 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 22 |
Incorrect |
5 ms |
2816 KB |
Output isn't correct |
| 23 |
Incorrect |
175 ms |
15580 KB |
Output isn't correct |
| 24 |
Incorrect |
225 ms |
18620 KB |
Output isn't correct |
| 25 |
Incorrect |
204 ms |
17740 KB |
Output isn't correct |
| 26 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 27 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 28 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 29 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 30 |
Incorrect |
207 ms |
18256 KB |
Output isn't correct |
| 31 |
Incorrect |
211 ms |
18552 KB |
Output isn't correct |
| 32 |
Incorrect |
225 ms |
18640 KB |
Output isn't correct |
| 33 |
Incorrect |
218 ms |
18680 KB |
Output isn't correct |
| 34 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 35 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 36 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 37 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 38 |
Incorrect |
222 ms |
18632 KB |
Output isn't correct |
| 39 |
Incorrect |
214 ms |
18552 KB |
Output isn't correct |
| 40 |
Incorrect |
221 ms |
18552 KB |
Output isn't correct |
| 41 |
Incorrect |
225 ms |
18592 KB |
Output isn't correct |
| 42 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 43 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 44 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 45 |
Correct |
3 ms |
2688 KB |
Output is correct |
| 46 |
Incorrect |
214 ms |
18552 KB |
Output isn't correct |
| 47 |
Incorrect |
225 ms |
18684 KB |
Output isn't correct |
| 48 |
Incorrect |
227 ms |
18740 KB |
Output isn't correct |
| 49 |
Incorrect |
221 ms |
17696 KB |
Output isn't correct |
| 50 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 51 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 52 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 53 |
Correct |
4 ms |
2688 KB |
Output is correct |
| 54 |
Incorrect |
219 ms |
18396 KB |
Output isn't correct |
