#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
const int NMAX = 100010;
vector <pair <int, int>> adia[NMAX + 10];
int tata[NMAX + 10];
int taken[NMAX + 10];
int h[NMAX + 10];
bool activ[NMAX + 10];
bool ok = 1;
i64 ce_s_vrea[NMAX + 10];
int ans[5 * NMAX + 10];
vector <vector <int>> centers;
bool dfs(int nod, bool did)
{
activ[nod] = 1;
for (auto i : adia[nod]) {
if (i.first == tata[nod])
continue;
if (tata[i.first] != 0) {
if (h[i.first] > h[nod])
continue;
assert(activ[i.first]);
if (did) {
cout << 0;
exit(0);
return 1;
}
vector <int> c;
for (int j = nod; j != tata[i.first]; j = tata[j]) {
if (j == -1)
while (1);
if (taken[j]) {
cout << 0;
exit(0);
return 1;
}
taken[j] = 1;
c.push_back(j);
}
centers.push_back(c);
did = 1;
}
else {
tata[i.first] = nod;
h[i.first] = 1 + h[nod];
did |= dfs(i.first, did);
if (!ok) {
cout << 0;
exit(0);
return 1;
}
}
}
activ[nod] = 0;
return did;
}
int solve_arb(int nod, int tata)
{
int ce_tata;
for (auto i : adia[nod]) {
if (i.first != tata) {
ans[i.second] = solve_arb(i.first, nod);
ce_s_vrea[nod] -= ans[i.second];
}
}
return ce_s_vrea[nod];
}
void solve_ciclu(vector <int> ciclu)
{
vector <int> a(ciclu.size());
vector <i64> s_st(ciclu.size()), s_dr(ciclu.size());
int n = ciclu.size();
if (n % 2 == 0) {
ok = 0;
return;
}
for (int i = 0; i < n; i++) {
for (auto j : adia[ciclu[i]]) {
if (j.first != ciclu[(i + 1) % n] && j.first != ciclu[(i + n - 1) % n]) {
int x = solve_arb(j.first, ciclu[i]);
ce_s_vrea[ciclu[i]] -= x;
ans[j.second] = x;
}
else if (j.first == ciclu[(i + n - 1) % n])
a[i] = j.second;
}
}
i64 s_total = 0;
for (auto i : ciclu)
s_total += ce_s_vrea[i];
if ((s_total & 1LL) || (s_total && n == 1)) {
ok = 0;
return;
}
s_st[0] = ce_s_vrea[ciclu[0]];
for (int i = 1; i < n; i++)
s_st[i] = ce_s_vrea[ciclu[i]] - s_st[i - 1];
s_dr[n - 1] = ce_s_vrea[ciclu[n - 1]];
for (int i = n - 2; i >= 0; i--)
s_dr[i] = ce_s_vrea[ciclu[i]] - s_dr[i + 1];
for (int i = 0; i < n; i++)
ans[a[i]] = (s_st[i] + s_dr[i] - ce_s_vrea[ciclu[i]]) / 2;
}
int main()
{
//cout << 0;
//return 0;
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m, a, b;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> ce_s_vrea[i];
for (int i = 1; i <= m; i++) {
cin >> a >> b;
adia[a].push_back({ b, i });
adia[b].push_back({ a, i });
}
for (int i = 1; i <= n; i++) {
if (!tata[i]) {
tata[i] = -1;
auto x = dfs(i, 0);
if (!x)
centers.push_back({ i });
}
}
if (!ok) {
cout << 0 << '\n';
return 0;
}
for (auto i : centers)
solve_ciclu(i);
if (!ok) {
cout << 0 << '\n';
return 0;
}
for (int i = 1; i <= m; i++)
cout << 2LL * ans[i] << '\n';
return 0;
}
Compilation message
pipes.cpp: In function 'int solve_arb(int, int)':
pipes.cpp:65:13: warning: unused variable 'ce_tata' [-Wunused-variable]
int ce_tata;
^~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
2680 KB |
Output is correct |
| 2 |
Correct |
4 ms |
2680 KB |
Output is correct |
| 3 |
Correct |
4 ms |
2968 KB |
Output is correct |
| 4 |
Correct |
85 ms |
9192 KB |
Output is correct |
| 5 |
Correct |
4 ms |
9192 KB |
Output is correct |
| 6 |
Correct |
4 ms |
9192 KB |
Output is correct |
| 7 |
Correct |
4 ms |
9192 KB |
Output is correct |
| 8 |
Correct |
4 ms |
9192 KB |
Output is correct |
| 9 |
Correct |
4 ms |
9192 KB |
Output is correct |
| 10 |
Correct |
5 ms |
9192 KB |
Output is correct |
| 11 |
Correct |
4 ms |
9192 KB |
Output is correct |
| 12 |
Correct |
5 ms |
9192 KB |
Output is correct |
| 13 |
Correct |
60 ms |
9192 KB |
Output is correct |
| 14 |
Correct |
87 ms |
9192 KB |
Output is correct |
| 15 |
Correct |
81 ms |
9200 KB |
Output is correct |
| 16 |
Correct |
76 ms |
9200 KB |
Output is correct |
| 17 |
Correct |
87 ms |
9200 KB |
Output is correct |
| 18 |
Correct |
105 ms |
9272 KB |
Output is correct |
| 19 |
Correct |
109 ms |
15576 KB |
Output is correct |
| 20 |
Correct |
4 ms |
15576 KB |
Output is correct |
| 21 |
Correct |
4 ms |
15576 KB |
Output is correct |
| 22 |
Correct |
82 ms |
15576 KB |
Output is correct |
| 23 |
Correct |
74 ms |
15576 KB |
Output is correct |
| 24 |
Correct |
88 ms |
15576 KB |
Output is correct |
| 25 |
Correct |
84 ms |
15576 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
4 ms |
15576 KB |
Output isn't correct |
| 2 |
Incorrect |
5 ms |
15576 KB |
Output isn't correct |
| 3 |
Correct |
84 ms |
15868 KB |
Output is correct |
| 4 |
Correct |
88 ms |
19500 KB |
Output is correct |
| 5 |
Correct |
58 ms |
19500 KB |
Output is correct |
| 6 |
Correct |
253 ms |
19500 KB |
Output is correct |
| 7 |
Incorrect |
4 ms |
19500 KB |
Output isn't correct |
| 8 |
Incorrect |
4 ms |
19500 KB |
Output isn't correct |
| 9 |
Correct |
4 ms |
19500 KB |
Output is correct |
| 10 |
Correct |
4 ms |
19500 KB |
Output is correct |
| 11 |
Correct |
4 ms |
19500 KB |
Output is correct |
| 12 |
Correct |
5 ms |
19500 KB |
Output is correct |
| 13 |
Correct |
4 ms |
19500 KB |
Output is correct |
| 14 |
Incorrect |
4 ms |
19500 KB |
Output isn't correct |
| 15 |
Incorrect |
4 ms |
19500 KB |
Output isn't correct |
| 16 |
Incorrect |
5 ms |
19500 KB |
Output isn't correct |
| 17 |
Correct |
4 ms |
19500 KB |
Output is correct |
| 18 |
Correct |
4 ms |
19500 KB |
Output is correct |
| 19 |
Correct |
4 ms |
19500 KB |
Output is correct |
| 20 |
Correct |
4 ms |
19500 KB |
Output is correct |
| 21 |
Correct |
5 ms |
19500 KB |
Output is correct |
| 22 |
Incorrect |
5 ms |
19500 KB |
Output isn't correct |
| 23 |
Incorrect |
74 ms |
19500 KB |
Output isn't correct |
| 24 |
Incorrect |
107 ms |
19500 KB |
Output isn't correct |
| 25 |
Correct |
86 ms |
19500 KB |
Output is correct |
| 26 |
Correct |
83 ms |
19500 KB |
Output is correct |
| 27 |
Correct |
95 ms |
19500 KB |
Output is correct |
| 28 |
Correct |
65 ms |
19500 KB |
Output is correct |
| 29 |
Correct |
227 ms |
19500 KB |
Output is correct |
| 30 |
Incorrect |
118 ms |
22216 KB |
Output isn't correct |
| 31 |
Incorrect |
122 ms |
23656 KB |
Output isn't correct |
| 32 |
Incorrect |
98 ms |
23656 KB |
Output isn't correct |
| 33 |
Correct |
90 ms |
23656 KB |
Output is correct |
| 34 |
Correct |
96 ms |
23656 KB |
Output is correct |
| 35 |
Correct |
98 ms |
23656 KB |
Output is correct |
| 36 |
Correct |
60 ms |
23656 KB |
Output is correct |
| 37 |
Correct |
275 ms |
23656 KB |
Output is correct |
| 38 |
Incorrect |
103 ms |
23656 KB |
Output isn't correct |
| 39 |
Incorrect |
88 ms |
23656 KB |
Output isn't correct |
| 40 |
Incorrect |
138 ms |
23656 KB |
Output isn't correct |
| 41 |
Correct |
97 ms |
23656 KB |
Output is correct |
| 42 |
Correct |
88 ms |
23656 KB |
Output is correct |
| 43 |
Correct |
95 ms |
23656 KB |
Output is correct |
| 44 |
Correct |
57 ms |
23656 KB |
Output is correct |
| 45 |
Correct |
197 ms |
23656 KB |
Output is correct |
| 46 |
Incorrect |
113 ms |
23656 KB |
Output isn't correct |
| 47 |
Incorrect |
116 ms |
23656 KB |
Output isn't correct |
| 48 |
Incorrect |
131 ms |
23656 KB |
Output isn't correct |
| 49 |
Correct |
86 ms |
23656 KB |
Output is correct |
| 50 |
Correct |
95 ms |
23656 KB |
Output is correct |
| 51 |
Correct |
74 ms |
23656 KB |
Output is correct |
| 52 |
Correct |
75 ms |
23656 KB |
Output is correct |
| 53 |
Correct |
214 ms |
23656 KB |
Output is correct |
| 54 |
Incorrect |
116 ms |
23656 KB |
Output isn't correct |
