oj.uz

답안 #111630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
111630 2019-05-15T21:55:14 Z wilwxk Pipes (BOI13_pipes) C++11
74.0741 / 100
 464 ms 27252 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) {
	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;
		// tenho[cur]+=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++) if(gin[i]) v[i]-=tenho[i], tenho[i]=0;
	// for(int i=1; i<=n; i++) cout << v[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, 1);	
		// printf("ok %lld\n", soma);
		solve(i, i);
		break;
	}

	bool ok=1;
	for(int i=1; i<=n; i++) if(tenho[i]!=v[i]) ok=0;

	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)':
pipes.cpp:46: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:58: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:59: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:61: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

# 결과 실행 시간 메모리 Grader output
1 Correct 10 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 154 ms 20080 KB Output is correct
5 Correct 11 ms 9728 KB Output is correct
6 Correct 9 ms 9728 KB Output is correct
7 Correct 10 ms 9728 KB Output is correct
8 Correct 10 ms 9728 KB Output is correct
9 Correct 10 ms 9856 KB Output is correct
10 Correct 22 ms 9856 KB Output is correct
11 Correct 10 ms 9856 KB Output is correct
12 Correct 11 ms 9856 KB Output is correct
13 Correct 122 ms 18088 KB Output is correct
14 Correct 135 ms 19508 KB Output is correct
15 Correct 172 ms 20160 KB Output is correct
16 Correct 113 ms 18736 KB Output is correct
17 Correct 158 ms 20136 KB Output is correct
18 Correct 154 ms 20148 KB Output is correct
19 Correct 154 ms 19852 KB Output is correct
20 Correct 9 ms 9728 KB Output is correct
21 Correct 10 ms 9856 KB Output is correct
22 Correct 144 ms 20140 KB Output is correct
23 Correct 110 ms 18028 KB Output is correct
24 Correct 175 ms 19984 KB Output is correct
25 Correct 156 ms 18472 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 9776 KB Output isn't correct
2 Incorrect 12 ms 9856 KB Output isn't correct
3 Correct 110 ms 18908 KB Output is correct
4 Correct 110 ms 19064 KB Output is correct
5 Correct 165 ms 19496 KB Output is correct
6 Correct 455 ms 27232 KB Output is correct
7 Incorrect 10 ms 9728 KB Output isn't correct
8 Incorrect 11 ms 9728 KB Output isn't correct
9 Correct 9 ms 9728 KB Output is correct
10 Correct 9 ms 9728 KB Output is correct
11 Correct 9 ms 9728 KB Output is correct
12 Correct 9 ms 9728 KB Output is correct
13 Correct 9 ms 9728 KB Output is correct
14 Incorrect 9 ms 9728 KB Output isn't correct
15 Incorrect 11 ms 9856 KB Output isn't correct
16 Incorrect 11 ms 9984 KB Output isn't correct
17 Correct 10 ms 9856 KB Output is correct
18 Correct 9 ms 9856 KB Output is correct
19 Correct 10 ms 9856 KB Output is correct
20 Correct 32 ms 9856 KB Output is correct
21 Correct 11 ms 9856 KB Output is correct
22 Incorrect 10 ms 9856 KB Output isn't correct
23 Incorrect 115 ms 20668 KB Output isn't correct
24 Incorrect 179 ms 22392 KB Output isn't correct
25 Correct 140 ms 18868 KB Output is correct
26 Correct 150 ms 19124 KB Output is correct
27 Correct 117 ms 18808 KB Output is correct
28 Correct 167 ms 19444 KB Output is correct
29 Correct 368 ms 25220 KB Output is correct
30 Incorrect 185 ms 21780 KB Output isn't correct
31 Incorrect 181 ms 24312 KB Output isn't correct
32 Incorrect 184 ms 20660 KB Output isn't correct
33 Correct 176 ms 19448 KB Output is correct
34 Correct 126 ms 19064 KB Output is correct
35 Correct 120 ms 19064 KB Output is correct
36 Correct 129 ms 19444 KB Output is correct
37 Correct 464 ms 27252 KB Output is correct
38 Incorrect 168 ms 21984 KB Output isn't correct
39 Incorrect 142 ms 20256 KB Output isn't correct
40 Incorrect 177 ms 22328 KB Output isn't correct
41 Correct 130 ms 18940 KB Output is correct
42 Correct 126 ms 18780 KB Output is correct
43 Correct 119 ms 18756 KB Output is correct
44 Correct 143 ms 19452 KB Output is correct
45 Correct 354 ms 23668 KB Output is correct
46 Incorrect 157 ms 21756 KB Output isn't correct
47 Incorrect 178 ms 22332 KB Output isn't correct
48 Incorrect 186 ms 24296 KB Output isn't correct
49 Correct 121 ms 19128 KB Output is correct
50 Correct 134 ms 19192 KB Output is correct
51 Correct 144 ms 19320 KB Output is correct
52 Correct 124 ms 18860 KB Output is correct
53 Correct 388 ms 24292 KB Output is correct
54 Incorrect 146 ms 21304 KB Output isn't correct