oj.uz

Submission #111635

# Submission time Handle Problem Language Result Execution time Memory
111635 2019-05-15T23:01:35 Z wilwxk Pipes (BOI13_pipes) C++11
74.0741 / 100
 478 ms 27424 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAXN=2e5+5;
vector<int> g[MAXN], lista[MAXN];
vector<int> ncyc;
ll v[MAXN], tenho[MAXN];
int gin[MAXN];
ll resp[MAXN], soma;
int n, m;

void poda() {
	queue<int> qu;
	for(int i=1; i<=n; i++) if(gin[i]==1) qu.push(i);
	while(!qu.empty()) {
		int cur=qu.front(); qu.pop();
		gin[cur]=0; ncyc.push_back(cur);
		for(int i=0; i<g[cur].size(); i++) {
			int viz=g[cur][i]; int ind=lista[cur][i];
			if(!gin[viz]) continue;
			gin[viz]--;
			if(gin[viz]<=1) qu.push(viz);
			resp[ind]=v[cur]-tenho[cur];
			tenho[viz]+=resp[ind];
			tenho[cur]+=resp[ind];
			// printf("%d -> %d (%d, %lld)\n", cur, viz, ind, tenho[cur]);
		}
	}
}

void dfs(int cur, int k) {
	// printf("%d %d\n", cur, k);
	gin[cur]=1;
	for(int i=0; i<g[cur].size(); i++) {
		int viz=g[cur][i]; int ind=lista[cur][i];
		if(gin[viz]!=2) continue;
		dfs(viz, k^1);
	}
	if(!k) soma+=v[cur];
	else soma-=v[cur];
}

void solve(int cur, int p, int ori) {
	gin[cur]=2;
	// printf("solve %d %d\n", cur, tenho[cur]);
	for(int i=0; i<g[cur].size(); i++) {
		int viz=g[cur][i]; int ind=lista[cur][i];
		if(viz==p||gin[viz]==0) continue;
		if(cur==p) resp[ind]=soma;
		else resp[ind]=v[cur]-tenho[cur];
		tenho[viz]+=resp[ind];
		tenho[cur]+=resp[ind];
		// printf("%d -> %d (%d)\n", cur, viz, tenho[cur]);
		if(viz!=ori) solve(viz, cur, ori);
		if(cur==ori) break;
	}
}

int main() {
	scanf("%d %d", &n, &m);
	for(int i=1; i<=n; i++) scanf("%lld", &v[i]), v[i]*=2;
	for(int i=1; i<=m; i++) {
		int a, b; scanf("%d %d", &a, &b);
		g[a].push_back(b); g[b].push_back(a);
		gin[a]++; gin[b]++;
		lista[a].push_back(i); lista[b].push_back(i);
	}

	poda();
	for(int i=1; i<=n; i++) if(gin[i]) v[i]-=tenho[i], tenho[i]=0;
	// for(int i=1; i<=n; i++) cout << tenho[i] << " " << v[i] << endl;
	// for(auto cur : ncyc) printf("C %d\n", cur);

	if(m>n||(n-ncyc.size())%2==0) {
		printf("0\n");
		return 0;
	}
	if(m==n-1&&tenho[ncyc.back()]!=v[ncyc.back()]) {
		printf("0\n");
		return 0;
	}

	for(int i=1; i<=n; i++) {
		if(!gin[i]) continue;
		dfs(i, 0);	
		// printf("ok %lld\n", soma);
		solve(i, i, i);
		break;
	}

	bool ok=1;
	for(int i=1; i<=n; i++) if(gin[i]&&tenho[i]!=v[i]) ok=0;
	// for(int i=1; i<=n; i++) cout << tenho[i] << " " << v[i] << endl;

	if(ok) {
		for(int i=1; i<=m; i++) printf("%lld\n", resp[i]);
	}
	else {
		printf("0\n");
	}

}

Compilation message

pipes.cpp: In function 'void poda()':
pipes.cpp:19:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<g[cur].size(); i++) {
                ~^~~~~~~~~~~~~~
pipes.cpp: In function 'void dfs(int, int)':
pipes.cpp:35:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<g[cur].size(); i++) {
               ~^~~~~~~~~~~~~~
pipes.cpp:36:26: warning: unused variable 'ind' [-Wunused-variable]
   int viz=g[cur][i]; int ind=lista[cur][i];
                          ^~~
pipes.cpp: In function 'void solve(int, int, int)':
pipes.cpp:47:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<g[cur].size(); i++) {
               ~^~~~~~~~~~~~~~
pipes.cpp: In function 'int main()':
pipes.cpp:61:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
  ~~~~~^~~~~~~~~~~~~~~~~
pipes.cpp:62:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1; i<=n; i++) scanf("%lld", &v[i]), v[i]*=2;
                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
pipes.cpp:64:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int a, b; scanf("%d %d", &a, &b);
             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9728 KB Output is correct
2 Correct 9 ms 9728 KB Output is correct
3 Correct 9 ms 9856 KB Output is correct
4 Correct 126 ms 20116 KB Output is correct
5 Correct 9 ms 9728 KB Output is correct
6 Correct 9 ms 9728 KB Output is correct
7 Correct 8 ms 9728 KB Output is correct
8 Correct 12 ms 9728 KB Output is correct
9 Correct 10 ms 9856 KB Output is correct
10 Correct 14 ms 9900 KB Output is correct
11 Correct 12 ms 9856 KB Output is correct
12 Correct 9 ms 9856 KB Output is correct
13 Correct 115 ms 18088 KB Output is correct
14 Correct 136 ms 19556 KB Output is correct
15 Correct 143 ms 20032 KB Output is correct
16 Correct 141 ms 18544 KB Output is correct
17 Correct 144 ms 20100 KB Output is correct
18 Correct 148 ms 20168 KB Output is correct
19 Correct 175 ms 19824 KB Output is correct
20 Correct 10 ms 9728 KB Output is correct
21 Correct 12 ms 9856 KB Output is correct
22 Correct 157 ms 20060 KB Output is correct
23 Correct 125 ms 18032 KB Output is correct
24 Correct 154 ms 20172 KB Output is correct
25 Correct 129 ms 18524 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 9828 KB Output isn't correct
2 Incorrect 11 ms 9852 KB Output isn't correct
3 Correct 126 ms 18900 KB Output is correct
4 Correct 107 ms 19060 KB Output is correct
5 Correct 108 ms 19432 KB Output is correct
6 Correct 418 ms 27380 KB Output is correct
7 Incorrect 10 ms 9728 KB Output isn't correct
8 Incorrect 9 ms 9728 KB Output isn't correct
9 Correct 9 ms 9728 KB Output is correct
10 Correct 9 ms 9768 KB Output is correct
11 Correct 9 ms 9728 KB Output is correct
12 Correct 10 ms 9728 KB Output is correct
13 Correct 21 ms 9856 KB Output is correct
14 Incorrect 10 ms 9728 KB Output isn't correct
15 Incorrect 10 ms 9856 KB Output isn't correct
16 Incorrect 14 ms 9848 KB Output isn't correct
17 Correct 13 ms 9856 KB Output is correct
18 Correct 12 ms 9856 KB Output is correct
19 Correct 14 ms 9856 KB Output is correct
20 Correct 10 ms 9856 KB Output is correct
21 Correct 10 ms 9856 KB Output is correct
22 Incorrect 10 ms 9828 KB Output isn't correct
23 Incorrect 99 ms 21436 KB Output isn't correct
24 Incorrect 193 ms 23316 KB Output isn't correct
25 Correct 135 ms 19024 KB Output is correct
26 Correct 195 ms 19168 KB Output is correct
27 Correct 109 ms 18808 KB Output is correct
28 Correct 147 ms 19488 KB Output is correct
29 Correct 359 ms 25332 KB Output is correct
30 Incorrect 190 ms 22504 KB Output isn't correct
31 Incorrect 204 ms 25852 KB Output isn't correct
32 Incorrect 148 ms 20848 KB Output isn't correct
33 Correct 125 ms 19320 KB Output is correct
34 Correct 129 ms 19068 KB Output is correct
35 Correct 125 ms 19080 KB Output is correct
36 Correct 144 ms 19444 KB Output is correct
37 Correct 478 ms 27424 KB Output is correct
38 Incorrect 194 ms 22752 KB Output isn't correct
39 Incorrect 153 ms 20420 KB Output isn't correct
40 Incorrect 154 ms 23080 KB Output isn't correct
41 Correct 106 ms 18952 KB Output is correct
42 Correct 110 ms 18796 KB Output is correct
43 Correct 109 ms 18832 KB Output is correct
44 Correct 122 ms 19544 KB Output is correct
45 Correct 395 ms 23800 KB Output is correct
46 Incorrect 171 ms 22388 KB Output isn't correct
47 Incorrect 168 ms 23104 KB Output isn't correct
48 Incorrect 208 ms 25544 KB Output isn't correct
49 Correct 146 ms 19268 KB Output is correct
50 Correct 119 ms 19320 KB Output is correct
51 Correct 135 ms 19392 KB Output is correct
52 Correct 128 ms 18936 KB Output is correct
53 Correct 396 ms 24212 KB Output is correct
54 Incorrect 174 ms 21916 KB Output isn't correct