oj.uz

Submission #205064

# Submission time Handle Problem Language Result Execution time Memory
205064 2020-02-27T20:24:49 Z mode149256 Pipes (BOI13_pipes) C++14
100 / 100
 316 ms 42232 KB 
/*input
3 3
9
4
6
1 2
2 3
3 1

7 7
2
2
2
2
2
2
2
1 2
2 3
3 4
4 5
5 6
6 7
7 1
*/
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 500101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}

vl W(MX);
int N, M;
vector<vpi> edges(MX);
vi sz(MX, 0);
vb done(MX, false);
vl ats(MX, -1);

void bad() {
	printf("0\n");
	exit(0);
}

vb visited(MX, false);
int cnt = 0;
void dfs(int v) {
	cnt++;
	visited[v] = true;
	for (auto u : edges[v])
		if (!visited[u.x] and !done[u.y])
			dfs(u.x);
}

vi nodes;
vi edg;
int prad;

void dfs2(int v, int p) {
	if (visited[v]) return;
	nodes.push_back(v);
	visited[v] = true;

	for (auto u : edges[v]) {
		if (!done[u.y] and u.x != p) {
			edg.push_back(u.y);
			dfs2(u.x, v);
			break;
		}
	}
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> N >> M;
	for (int i = 0; i < N; ++i)
		cin >> W[i];

	for (int i = 0; i < M; ++i)
	{
		int a, b;
		cin >> a >> b; a--; b--;
		sz[a]++;
		sz[b]++;
		edges[a].push_back({b, i});
		edges[b].push_back({a, i});
	}

	queue<int> vienas;
	for (int i = 0; i < N; ++i)
	{
		if (sz[i] == 1)
			vienas.push(i);
	}

	while (vienas.size()) {
		int c = vienas.front(); vienas.pop();

		for (auto u : edges[c]) {
			if (done[u.y]) continue;

			sz[c]--;
			sz[u.x]--;
			done[u.y] = true;
			ats[u.y] = 2 * W[c];
			W[u.x] -= W[c];
			if (sz[u.x] == 1)
				vienas.push(u.x);
			break;
		}
	}

	bool visi2 = true;
	for (int i = 0; i < N; ++i)
	{
		if (sz[i] != 2 and sz[i] != 0) {
			visi2 = false;
			break;
		}
	}

	if (!visi2) bad();

	for (int i = 0; i < N; ++i)
	{
		if (visited[i]) continue;
		cnt = 0;
		dfs(i);
		if (cnt % 2 == 0) bad();
	}

	visited = vb(MX, false);

	auto daryk = [&]() {
		int K = (int)nodes.size();

		ll visux = 0;

		for (int i = 0; i < K; ++i)
			visux += W[nodes[i]];


		// printf("visux = %lld\n", visux);

		ll curr = 0;
		for (int i = 0; i < K; i += 2)
			curr += 2 * W[nodes[i]];

		for (int i = 0; i < K; i += 2)
		{
			curr -= 2 * W[nodes[i]];

			ats[edg[i]] = visux - curr;

			if (i + 1 < K)
				curr += 2 * W[nodes[i + 1]];
		}

		curr = 0;
		for (int i = 1; i < K; i += 2)
			curr += 2 * W[nodes[i]];

		for (int i = 1; i < K; i += 2)
		{
			curr += 2 * W[nodes[i - 1]];
			curr -= 2 * W[nodes[i]];

			ats[edg[i]] = visux - curr;
		}
	};

	for (int i = 0; i < N; ++i)
	{
		if (!visited[i]) {
			nodes.clear();
			edg.clear();
			dfs2(i, -1);
			if ((int)nodes.size() == 1) continue;
			// print(nodes);
			daryk();
		}
	}

	for (int i = 0; i < M; ++i)
		printf("%lld\n", ats[i]);
}

/* Look for:
* special cases (n=1?)
* overflow (ll vs int?)
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* array bounds
*/

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 22112 KB Output is correct
2 Correct 19 ms 22008 KB Output is correct
3 Correct 18 ms 22136 KB Output is correct
4 Correct 114 ms 27868 KB Output is correct
5 Correct 21 ms 22128 KB Output is correct
6 Correct 21 ms 22136 KB Output is correct
7 Correct 27 ms 22012 KB Output is correct
8 Correct 19 ms 22136 KB Output is correct
9 Correct 19 ms 22136 KB Output is correct
10 Correct 19 ms 22136 KB Output is correct
11 Correct 19 ms 22136 KB Output is correct
12 Correct 20 ms 22136 KB Output is correct
13 Correct 91 ms 26744 KB Output is correct
14 Correct 109 ms 27640 KB Output is correct
15 Correct 127 ms 27988 KB Output is correct
16 Correct 99 ms 27128 KB Output is correct
17 Correct 115 ms 27868 KB Output is correct
18 Correct 114 ms 27996 KB Output is correct
19 Correct 131 ms 27360 KB Output is correct
20 Correct 19 ms 22008 KB Output is correct
21 Correct 20 ms 22136 KB Output is correct
22 Correct 117 ms 27992 KB Output is correct
23 Correct 91 ms 26744 KB Output is correct
24 Correct 120 ms 27992 KB Output is correct
25 Correct 113 ms 27000 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 22140 KB Output is correct
2 Correct 25 ms 22136 KB Output is correct
3 Correct 113 ms 28280 KB Output is correct
4 Correct 91 ms 26872 KB Output is correct
5 Correct 88 ms 27256 KB Output is correct
6 Correct 316 ms 42232 KB Output is correct
7 Correct 18 ms 22136 KB Output is correct
8 Correct 19 ms 22008 KB Output is correct
9 Correct 18 ms 22008 KB Output is correct
10 Correct 24 ms 22012 KB Output is correct
11 Correct 26 ms 21932 KB Output is correct
12 Correct 18 ms 22008 KB Output is correct
13 Correct 20 ms 22008 KB Output is correct
14 Correct 19 ms 22008 KB Output is correct
15 Correct 19 ms 22136 KB Output is correct
16 Correct 18 ms 22136 KB Output is correct
17 Correct 18 ms 22008 KB Output is correct
18 Correct 19 ms 22008 KB Output is correct
19 Correct 26 ms 22008 KB Output is correct
20 Correct 18 ms 22136 KB Output is correct
21 Correct 20 ms 22136 KB Output is correct
22 Correct 19 ms 22136 KB Output is correct
23 Correct 100 ms 30296 KB Output is correct
24 Correct 119 ms 31348 KB Output is correct
25 Correct 98 ms 28280 KB Output is correct
26 Correct 87 ms 27000 KB Output is correct
27 Correct 82 ms 26744 KB Output is correct
28 Correct 97 ms 27392 KB Output is correct
29 Correct 267 ms 38268 KB Output is correct
30 Correct 117 ms 30520 KB Output is correct
31 Correct 128 ms 33608 KB Output is correct
32 Correct 114 ms 29048 KB Output is correct
33 Correct 93 ms 28792 KB Output is correct
34 Correct 87 ms 26872 KB Output is correct
35 Correct 85 ms 26872 KB Output is correct
36 Correct 85 ms 27256 KB Output is correct
37 Correct 301 ms 42108 KB Output is correct
38 Correct 122 ms 30804 KB Output is correct
39 Correct 126 ms 28668 KB Output is correct
40 Correct 123 ms 31056 KB Output is correct
41 Correct 93 ms 29560 KB Output is correct
42 Correct 88 ms 26744 KB Output is correct
43 Correct 88 ms 26744 KB Output is correct
44 Correct 87 ms 27256 KB Output is correct
45 Correct 225 ms 39560 KB Output is correct
46 Correct 129 ms 30292 KB Output is correct
47 Correct 119 ms 31220 KB Output is correct
48 Correct 122 ms 33356 KB Output is correct
49 Correct 98 ms 27640 KB Output is correct
50 Correct 99 ms 27000 KB Output is correct
51 Correct 88 ms 27128 KB Output is correct
52 Correct 82 ms 26872 KB Output is correct
53 Correct 258 ms 39672 KB Output is correct
54 Correct 117 ms 30068 KB Output is correct