oj.uz

답안 #24465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
24465 2017-06-09T08:56:56 Z Bruteforceman Tug of War (BOI15_tug) C++11
23 / 100
 43 ms 5376 KB 
#include "bits/stdc++.h"
using namespace std;
bool del[2 * 30005];
int deg[2][30005];
vector <int> g[2][30005];

struct data
{
	int l, r, s;
	data () {}
	data (int l, int r, int s) : l(l), r(r), s(s) {}
} a[2 * 30005];

struct node
{
	int i, side;
	node () {}
	node (int i, int side) : i(i), side(side) {}
};

bool play[2 * 30010];
bool vis[2][30010];
int sum;
void cycle(node n) {
	// cout << n.i << " " << n.side << endl;
	if(n.side == -1) {
		play[n.i] = true;
		if(vis[0][a[n.i].l] == false) {
			cycle(node(a[n.i].l, 0));
			sum += a[n.i].s;
		} else {
			cycle(node(a[n.i].r, 1));
			sum -= a[n.i].s;
		}
	} else {
		vis[n.side][n.i] = true;
		for(auto i : g[n.side][n.i]) {
			if(del[i] == false && play[i] == false) {
				cycle(node(i, -1));
				break;
			}
		}
	}
}

const int tot = 20 * 2005;
bitset <tot> dp;

void knapsack(vector <int> v) {
	dp[0] = 1;
	for(auto i : v) {
		dp |= dp << i;
	}
}

int main(int argc, char const *argv[])
{
	int n, k;
	scanf("%d %d", &n, &k);
	for(int i = 1; i <= n+n; i++) {
		int l, r, s;
		scanf("%d %d %d", &l, &r, &s);
		a[i] = data(l, r, s);
		g[0][l].push_back(i);
		g[1][r].push_back(i);
		++deg[0][l];
		++deg[1][r];
	}
	queue <node> Q;
	for(int i = 1; i <= n; i++) {
		if(deg[0][i] == 1) Q.push(node(i, 0));
		if(deg[1][i] == 1) Q.push(node(i, 1));
		
		if(deg[0][i] == 0 || deg[1][i] == 0) {
			printf("NO\n");
			exit(0);
		}
	}
	int add[2];
	add[0] = add[1] = 0;
	while(!Q.empty()) {
		node p = Q.front();
		Q.pop();
		for(auto i : g[p.side][p.i]) {
			if(del[i] == false) {
				add[p.side] += a[i].s;
				del[i] = true;
				if(p.side == 0) {
					--deg[1][a[i].r];
					if(deg[1][a[i].r] == 1) {
						Q.push(node(a[i].r, 1));
					}
					if(deg[1][a[i].r] == 0) {
						printf("NO\n");
						exit(0);
					}
				} else {
					--deg[0][a[i].l];
					if(deg[0][a[i].l] == 1) {
						Q.push(node(a[i].l, 0));
					}
					if(deg[0][a[i].l] == 0) {
						printf("NO\n");
						exit(0);
					}
				}
			}
		}
	}
	vector <int> v;
	int neg = 0;
	for(int i = 1; i <= n+n; i++) {
		if(play[i] == false) {
			int k1;
			sum = 0;
			cycle(node(i, -1));
			k1 = sum;
			v.push_back(abs(k1));
			neg -= abs(k1);
		}
	} 
	knapsack(v);

	add[0] -= add[1];

	for(int i = 0; i < tot; i++) {
		if(dp[i] == 1) {
			int hehe = i + i + neg + add[0];
			if(abs(hehe) <= k) {
				printf("YES\n");
				exit(0);
			}
		}
	}
 	printf("NO\n");
	return 0; 
}

Compilation message

tug.cpp: In function 'int main(int, const char**)':
tug.cpp:59:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
                        ^
tug.cpp:62:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &l, &r, &s);
                                ^

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4548 KB Output is correct
2 Correct 0 ms 4548 KB Output is correct
3 Correct 0 ms 4548 KB Output is correct
4 Correct 0 ms 4548 KB Output is correct
5 Correct 0 ms 4548 KB Output is correct
6 Correct 0 ms 4548 KB Output is correct
7 Correct 0 ms 4548 KB Output is correct
8 Correct 0 ms 4548 KB Output is correct
9 Correct 0 ms 4548 KB Output is correct
10 Correct 0 ms 4548 KB Output is correct
11 Correct 0 ms 4548 KB Output is correct
12 Correct 0 ms 4548 KB Output is correct
13 Correct 0 ms 4548 KB Output is correct
14 Correct 0 ms 4548 KB Output is correct
15 Correct 0 ms 4548 KB Output is correct
16 Correct 0 ms 4548 KB Output is correct
17 Correct 0 ms 4548 KB Output is correct
18 Correct 0 ms 4548 KB Output is correct
19 Correct 0 ms 4548 KB Output is correct
20 Correct 0 ms 4548 KB Output is correct
21 Correct 0 ms 4548 KB Output is correct
22 Correct 0 ms 4548 KB Output is correct
23 Incorrect 0 ms 4548 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4548 KB Output is correct
2 Correct 0 ms 4548 KB Output is correct
3 Correct 0 ms 4548 KB Output is correct
4 Correct 0 ms 4548 KB Output is correct
5 Correct 0 ms 4548 KB Output is correct
6 Correct 0 ms 4548 KB Output is correct
7 Correct 0 ms 4548 KB Output is correct
8 Correct 0 ms 4548 KB Output is correct
9 Correct 0 ms 4548 KB Output is correct
10 Correct 0 ms 4548 KB Output is correct
11 Correct 0 ms 4548 KB Output is correct
12 Correct 0 ms 4548 KB Output is correct
13 Correct 0 ms 4548 KB Output is correct
14 Correct 0 ms 4548 KB Output is correct
15 Correct 0 ms 4548 KB Output is correct
16 Correct 0 ms 4548 KB Output is correct
17 Correct 0 ms 4548 KB Output is correct
18 Correct 0 ms 4548 KB Output is correct
19 Correct 0 ms 4548 KB Output is correct
20 Correct 0 ms 4548 KB Output is correct
21 Correct 0 ms 4548 KB Output is correct
22 Correct 0 ms 4548 KB Output is correct
23 Incorrect 0 ms 4548 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 5376 KB Output is correct
2 Correct 13 ms 5208 KB Output is correct
3 Correct 23 ms 5376 KB Output is correct
4 Correct 9 ms 5208 KB Output is correct
5 Correct 23 ms 5376 KB Output is correct
6 Correct 23 ms 5208 KB Output is correct
7 Correct 23 ms 5376 KB Output is correct
8 Correct 9 ms 5208 KB Output is correct
9 Correct 23 ms 5376 KB Output is correct
10 Correct 13 ms 5208 KB Output is correct
11 Correct 26 ms 5376 KB Output is correct
12 Correct 13 ms 5208 KB Output is correct
13 Correct 23 ms 5376 KB Output is correct
14 Correct 23 ms 5376 KB Output is correct
15 Correct 13 ms 5208 KB Output is correct
16 Correct 16 ms 5376 KB Output is correct
17 Correct 13 ms 5208 KB Output is correct
18 Correct 19 ms 5376 KB Output is correct
19 Correct 9 ms 5208 KB Output is correct
20 Correct 23 ms 5376 KB Output is correct
21 Correct 6 ms 5076 KB Output is correct
22 Correct 43 ms 5344 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 4548 KB Output is correct
2 Correct 0 ms 4548 KB Output is correct
3 Correct 0 ms 4548 KB Output is correct
4 Correct 0 ms 4548 KB Output is correct
5 Correct 0 ms 4548 KB Output is correct
6 Correct 0 ms 4548 KB Output is correct
7 Correct 0 ms 4548 KB Output is correct
8 Correct 0 ms 4548 KB Output is correct
9 Correct 0 ms 4548 KB Output is correct
10 Correct 0 ms 4548 KB Output is correct
11 Correct 0 ms 4548 KB Output is correct
12 Correct 0 ms 4548 KB Output is correct
13 Correct 0 ms 4548 KB Output is correct
14 Correct 0 ms 4548 KB Output is correct
15 Correct 0 ms 4548 KB Output is correct
16 Correct 0 ms 4548 KB Output is correct
17 Correct 0 ms 4548 KB Output is correct
18 Correct 0 ms 4548 KB Output is correct
19 Correct 0 ms 4548 KB Output is correct
20 Correct 0 ms 4548 KB Output is correct
21 Correct 0 ms 4548 KB Output is correct
22 Correct 0 ms 4548 KB Output is correct
23 Incorrect 0 ms 4548 KB Output isn't correct
24 Halted 0 ms 0 KB -