oj.uz

Submission #43842

# Submission time Handle Problem Language Result Execution time Memory
43842 2018-03-25T11:25:45 Z Bruteforceman Pipes (BOI13_pipes) C++11
96.1111 / 100
 303 ms 130152 KB 
#include "bits/stdc++.h"
using namespace std;
bool vis[100010];
int l[500010], r[500010];
vector <int> g[100010];
long long a[100010];
bool del[500010];
int deg[100010];
long long ans[100010];

vector <int> can;
bool bad;
void check(int x) {
	vis[x] = true;
	can.push_back(x);
	int deg = 0;
	for(auto i : g[x]) {
		if(del[i]) continue;
		int y = l[i] ^ r[i] ^ x;
		++deg;
		if(vis[y] == false) check(y);
	}
	if(deg != 2 && deg != 0) {
		bad = true;
	}
}

int edge(int x, int y) {
	for(auto i : g[x]) {
		int p = l[i] ^ r[i] ^ x;
		if(p == y) return i;
	}
	return -1;
}
void solve(vector <int> v) {
	int size = v.size();
	vector <long long> Odd (size), Even (size);
	long long odd = 0;
	long long even = 0;
	long long sum = 0;
	for(int i = 0; i < size; i++) {
		if(i & 1) {
			odd += a[v[i]];
		} else {
			even += a[v[i]];
		}
		Even[i] = even;
		Odd[i] = odd;
		sum += a[v[i]];
	}
	if(sum % 2 != 0) {
		printf("0\n");
		exit(0);
	}
	sum /= 2;
	for(int i = 0; i < size; i++) {
		int p = v[i];
		int q = v[(i + 1) % size];
		int id = edge(p, q);
		if(i & 1) {
			ans[id] = Even[i];
			ans[id] += odd - Odd[i];
		} else {
			ans[id] = Odd[i];
			ans[id] += even - Even[i]; 
		}
		ans[id] = sum - ans[id];
	}
}
int main(int argc, char const *argv[])
{
	int n, m;
	scanf("%d %d", &n, &m);
	for(int i = 1; i <= n; i++) {
		scanf("%lld", &a[i]);
	}
	queue <int> Q;
	for(int i = 1; i <= m; i++) {
		int p, q;
		scanf("%d %d", &p, &q);
		g[p].push_back(i);
		g[q].push_back(i);
		l[i] = p;
		r[i] = q;
	}
	for(int i = 1; i <= n; i++) {
		deg[i] = g[i].size();
		if(g[i].size() == 1) {
			Q.push(i);
		}
	}
	while(!Q.empty()) {
		int p = Q.front();
		Q.pop();
		if(deg[p] != 1) {
			if(a[p] != 0) {
				printf("0\n");
				exit(0);
			}
			continue;
		}
		for(auto i : g[p]) {
			if(del[i] == true) continue;
			int j = l[i] ^ r[i] ^ p;
			deg[j]--;
			if(deg[j] == 1) {
				Q.push(j);
			}
			ans[i] = a[p];
			a[j] -= a[p];
			del[i] = true; 
		}
	}

	for(int i = 1; i <= n; i++) {
		if(vis[i] == false) {
			bad = false;
			can.clear();
			check(i);
			if(can.size() % 2 == 0) {
				bad = true;
			} 
			if(bad) {
				printf("0\n");
				exit(0);
			}
			if(can.size() > 1) {
				solve(can);
			}
		}
	}
	for(int i = 1; i <= m; i++) {
		printf("%lld\n", ans[i] << 1);
	}
	return 0;
}

Compilation message

pipes.cpp: In function 'int main(int, const char**)':
pipes.cpp:73:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
                        ^
pipes.cpp:75:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &a[i]);
                       ^
pipes.cpp:80:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &p, &q);
                         ^

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2700 KB Output is correct
2 Correct 3 ms 2788 KB Output is correct
3 Correct 5 ms 2844 KB Output is correct
4 Correct 95 ms 11292 KB Output is correct
5 Correct 3 ms 11292 KB Output is correct
6 Correct 3 ms 11292 KB Output is correct
7 Correct 3 ms 11292 KB Output is correct
8 Correct 3 ms 11292 KB Output is correct
9 Correct 5 ms 11292 KB Output is correct
10 Correct 4 ms 11292 KB Output is correct
11 Correct 5 ms 11292 KB Output is correct
12 Correct 4 ms 11292 KB Output is correct
13 Correct 75 ms 11392 KB Output is correct
14 Correct 94 ms 13892 KB Output is correct
15 Correct 99 ms 15952 KB Output is correct
16 Correct 78 ms 16184 KB Output is correct
17 Correct 94 ms 18640 KB Output is correct
18 Correct 93 ms 20348 KB Output is correct
19 Correct 118 ms 21728 KB Output is correct
20 Correct 4 ms 21728 KB Output is correct
21 Correct 4 ms 21728 KB Output is correct
22 Correct 96 ms 23668 KB Output is correct
23 Correct 76 ms 23668 KB Output is correct
24 Correct 91 ms 26292 KB Output is correct
25 Correct 73 ms 26524 KB Output is correct

Subtask #2
66.1111111111 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 26524 KB Output is correct
2 Correct 4 ms 26524 KB Output is correct
3 Correct 77 ms 30552 KB Output is correct
4 Correct 98 ms 33948 KB Output is correct
5 Correct 82 ms 33948 KB Output is correct
6 Runtime error 296 ms 68344 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Correct 3 ms 68344 KB Output is correct
8 Correct 4 ms 68344 KB Output is correct
9 Correct 3 ms 68344 KB Output is correct
10 Correct 3 ms 68344 KB Output is correct
11 Correct 3 ms 68344 KB Output is correct
12 Correct 3 ms 68344 KB Output is correct
13 Correct 3 ms 68344 KB Output is correct
14 Correct 3 ms 68344 KB Output is correct
15 Correct 4 ms 68344 KB Output is correct
16 Correct 4 ms 68344 KB Output is correct
17 Correct 4 ms 68344 KB Output is correct
18 Correct 4 ms 68344 KB Output is correct
19 Correct 4 ms 68344 KB Output is correct
20 Correct 4 ms 68344 KB Output is correct
21 Correct 5 ms 68344 KB Output is correct
22 Correct 4 ms 68344 KB Output is correct
23 Correct 88 ms 68344 KB Output is correct
24 Correct 108 ms 68344 KB Output is correct
25 Correct 86 ms 68344 KB Output is correct
26 Correct 97 ms 68344 KB Output is correct
27 Correct 105 ms 68828 KB Output is correct
28 Correct 79 ms 68828 KB Output is correct
29 Runtime error 240 ms 77132 KB Execution killed with signal 11 (could be triggered by violating memory limits)
30 Correct 110 ms 77132 KB Output is correct
31 Correct 122 ms 77132 KB Output is correct
32 Correct 110 ms 77132 KB Output is correct
33 Correct 92 ms 77132 KB Output is correct
34 Correct 103 ms 77300 KB Output is correct
35 Correct 100 ms 79732 KB Output is correct
36 Correct 75 ms 79732 KB Output is correct
37 Runtime error 303 ms 100120 KB Execution killed with signal 11 (could be triggered by violating memory limits)
38 Correct 103 ms 100120 KB Output is correct
39 Correct 95 ms 100120 KB Output is correct
40 Correct 108 ms 100120 KB Output is correct
41 Correct 96 ms 100120 KB Output is correct
42 Correct 100 ms 100256 KB Output is correct
43 Correct 97 ms 102732 KB Output is correct
44 Correct 83 ms 102732 KB Output is correct
45 Correct 228 ms 112604 KB Output is correct
46 Correct 104 ms 112604 KB Output is correct
47 Correct 108 ms 112604 KB Output is correct
48 Correct 120 ms 116092 KB Output is correct
49 Correct 79 ms 116092 KB Output is correct
50 Correct 92 ms 116092 KB Output is correct
51 Correct 90 ms 116868 KB Output is correct
52 Correct 123 ms 117856 KB Output is correct
53 Correct 260 ms 130152 KB Output is correct
54 Correct 109 ms 130152 KB Output is correct