oj.uz

Submission #111627

# Submission time Handle Problem Language Result Execution time Memory
111627 2019-05-15T21:30:14 Z wilwxk Pipes (BOI13_pipes) C++11
70.1852 / 100
 438 ms 43488 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MAXN=1e5+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];
			// 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+=tenho[cur];
	else soma-=tenho[cur];
}

void solve(int cur, int p) {
	gin[cur]=2;
	for(int i=0; i<g[cur].size(); i++) {
		int viz=g[cur][i]; int ind=lista[cur][i];
		if(viz==p||gin[viz]!=1) continue;
		if(cur==p) resp[ind]=soma;
		else resp[ind]=v[cur]-tenho[cur];
		tenho[viz]+=soma;
		solve(viz, cur);
	}
}

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++) cout << gin[i] << endl;

	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\n");
		solve(i, i);
		break;
	}

	for(int i=1; i<=m; i++) printf("%lld\n", resp[i]);

}

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:34:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<g[cur].size(); i++) {
               ~^~~~~~~~~~~~~~
pipes.cpp:35: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)':
pipes.cpp:45: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:56: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:57: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:59: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 5 ms 5120 KB Output is correct
2 Correct 5 ms 4992 KB Output is correct
3 Correct 5 ms 5120 KB Output is correct
4 Correct 164 ms 15344 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 6 ms 5120 KB Output is correct
7 Correct 7 ms 4992 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Correct 7 ms 5120 KB Output is correct
11 Correct 9 ms 5120 KB Output is correct
12 Correct 9 ms 5248 KB Output is correct
13 Correct 121 ms 13296 KB Output is correct
14 Correct 144 ms 14728 KB Output is correct
15 Correct 181 ms 15424 KB Output is correct
16 Correct 125 ms 13808 KB Output is correct
17 Correct 170 ms 15404 KB Output is correct
18 Correct 135 ms 15304 KB Output is correct
19 Correct 174 ms 15084 KB Output is correct
20 Correct 6 ms 4992 KB Output is correct
21 Correct 8 ms 5120 KB Output is correct
22 Correct 133 ms 15300 KB Output is correct
23 Correct 100 ms 13248 KB Output is correct
24 Correct 121 ms 15356 KB Output is correct
25 Correct 95 ms 13664 KB Output is correct

Subtask #2
40.1851851852 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 5068 KB Output isn't correct
2 Incorrect 6 ms 5120 KB Output isn't correct
3 Correct 110 ms 14076 KB Output is correct
4 Correct 109 ms 14328 KB Output is correct
5 Correct 138 ms 14736 KB Output is correct
6 Runtime error 412 ms 43488 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Incorrect 10 ms 5120 KB Output isn't correct
8 Incorrect 6 ms 4992 KB Output isn't correct
9 Correct 5 ms 5120 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct
12 Correct 6 ms 5120 KB Output is correct
13 Correct 6 ms 4992 KB Output is correct
14 Incorrect 6 ms 4992 KB Output isn't correct
15 Incorrect 6 ms 5120 KB Output isn't correct
16 Incorrect 7 ms 5120 KB Output isn't correct
17 Correct 6 ms 5120 KB Output is correct
18 Correct 7 ms 5120 KB Output is correct
19 Correct 9 ms 5120 KB Output is correct
20 Correct 7 ms 5120 KB Output is correct
21 Correct 7 ms 5120 KB Output is correct
22 Incorrect 9 ms 5120 KB Output isn't correct
23 Incorrect 129 ms 16448 KB Output isn't correct
24 Incorrect 194 ms 18324 KB Output isn't correct
25 Correct 133 ms 14192 KB Output is correct
26 Correct 114 ms 14456 KB Output is correct
27 Correct 105 ms 14072 KB Output is correct
28 Correct 151 ms 14680 KB Output is correct
29 Runtime error 348 ms 39512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
30 Incorrect 171 ms 17496 KB Output isn't correct
31 Incorrect 186 ms 20336 KB Output isn't correct
32 Incorrect 195 ms 16364 KB Output isn't correct
33 Correct 149 ms 14712 KB Output is correct
34 Correct 125 ms 14328 KB Output is correct
35 Correct 122 ms 14360 KB Output is correct
36 Correct 140 ms 14664 KB Output is correct
37 Runtime error 438 ms 43424 KB Execution killed with signal 11 (could be triggered by violating memory limits)
38 Incorrect 183 ms 17796 KB Output isn't correct
39 Incorrect 153 ms 15940 KB Output isn't correct
40 Incorrect 172 ms 18052 KB Output isn't correct
41 Correct 92 ms 14200 KB Output is correct
42 Correct 96 ms 14020 KB Output is correct
43 Correct 92 ms 14072 KB Output is correct
44 Correct 109 ms 14852 KB Output is correct
45 Correct 241 ms 18552 KB Output is correct
46 Incorrect 154 ms 17420 KB Output isn't correct
47 Incorrect 146 ms 18156 KB Output isn't correct
48 Incorrect 161 ms 20032 KB Output isn't correct
49 Correct 91 ms 14516 KB Output is correct
50 Correct 116 ms 14584 KB Output is correct
51 Correct 125 ms 14688 KB Output is correct
52 Correct 98 ms 14168 KB Output is correct
53 Correct 342 ms 19056 KB Output is correct
54 Incorrect 187 ms 17080 KB Output isn't correct