oj.uz

답안 #208606

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208606 2020-03-11T19:18:50 Z dolphingarlic Tug of War (BOI15_tug) C++14
100 / 100
 808 ms 9468 KB 
#include <bits/stdc++.h>
using namespace std;

multiset<pair<int, int>> graph[60001];
bool visited[60001];
bitset<600001> dp;
int tot = 0, sm = 0;

void dfs(int node) {
	visited[node] = true;
	if (!graph[node].size()) return;
	int nxt, cost;
	tie(nxt, cost) = *graph[node].begin();

	tot += cost;
	if (!visited[nxt]) {
		graph[nxt].erase(graph[nxt].find({node, -cost}));
		graph[node].clear();
		dfs(nxt);
	}
}

int main() {
	int n, k;
	scanf("%d %d", &n, &k);
	for (int i = 1; i <= 2 * n; i++) {
		int l, r, s;
		scanf("%d %d %d", &l, &r, &s);
		graph[l].insert({n + r, s});
		graph[n + r].insert({l, -s});
	}

	queue<int> q;
	for (int i = 1; i <= 2 * n; i++) {
		if (graph[i].size() == 1) q.push(i);
		if (graph[i].size() == 0) return printf("NO\n"), 0;
	}
	while (q.size()) {
		int curr = q.front();
		q.pop();
		if (graph[curr].size() == 0) return printf("NO\n"), 0;
		int nxt, cost;
		tie(nxt, cost) = *graph[curr].begin();
		tot += cost;

		graph[curr].clear();
		graph[nxt].erase(graph[nxt].find({curr, -cost}));
		if (graph[nxt].size() == 1) q.push(nxt);
	}

	vector<int> items;
	if (tot) items.push_back(abs(tot));
	for (int i = 1; i <= 2 * n; i++) if (!visited[i] && graph[i].size()) {
		tot = 0;
		graph[i].erase(graph[i].begin());
		dfs(i);
		if (tot) items.push_back(abs(tot));
	}
	sm = accumulate(items.begin(), items.end(), 0);

	dp[0] = 1;
	for (int i : items) dp |= dp << i;
	for (int i = 0; i <= sm; i++) if (dp[i] && abs(2 * i - sm) <= k) return printf("YES\n"), 0;
	printf("NO\n");
	return 0;
}

Compilation message

tug.cpp: In function 'int main()':
tug.cpp:25:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~
tug.cpp:28:8: 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
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3320 KB Output is correct
2 Correct 7 ms 3324 KB Output is correct
3 Correct 7 ms 3320 KB Output is correct
4 Correct 6 ms 3320 KB Output is correct
5 Correct 7 ms 3324 KB Output is correct
6 Correct 7 ms 3324 KB Output is correct
7 Correct 6 ms 3320 KB Output is correct
8 Correct 7 ms 3320 KB Output is correct
9 Correct 7 ms 3320 KB Output is correct
10 Correct 7 ms 3320 KB Output is correct
11 Correct 8 ms 3320 KB Output is correct
12 Correct 7 ms 3320 KB Output is correct
13 Correct 7 ms 3320 KB Output is correct
14 Correct 6 ms 3320 KB Output is correct
15 Correct 8 ms 3320 KB Output is correct
16 Correct 7 ms 3320 KB Output is correct
17 Correct 7 ms 3320 KB Output is correct
18 Correct 8 ms 3320 KB Output is correct
19 Correct 7 ms 3320 KB Output is correct
20 Correct 7 ms 3324 KB Output is correct
21 Correct 7 ms 3192 KB Output is correct
22 Correct 6 ms 3416 KB Output is correct
23 Correct 7 ms 3320 KB Output is correct
24 Correct 7 ms 3320 KB Output is correct
25 Correct 6 ms 3320 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3320 KB Output is correct
2 Correct 7 ms 3324 KB Output is correct
3 Correct 7 ms 3320 KB Output is correct
4 Correct 6 ms 3320 KB Output is correct
5 Correct 7 ms 3324 KB Output is correct
6 Correct 7 ms 3324 KB Output is correct
7 Correct 6 ms 3320 KB Output is correct
8 Correct 7 ms 3320 KB Output is correct
9 Correct 7 ms 3320 KB Output is correct
10 Correct 7 ms 3320 KB Output is correct
11 Correct 8 ms 3320 KB Output is correct
12 Correct 7 ms 3320 KB Output is correct
13 Correct 7 ms 3320 KB Output is correct
14 Correct 6 ms 3320 KB Output is correct
15 Correct 8 ms 3320 KB Output is correct
16 Correct 7 ms 3320 KB Output is correct
17 Correct 7 ms 3320 KB Output is correct
18 Correct 8 ms 3320 KB Output is correct
19 Correct 7 ms 3320 KB Output is correct
20 Correct 7 ms 3324 KB Output is correct
21 Correct 7 ms 3192 KB Output is correct
22 Correct 6 ms 3416 KB Output is correct
23 Correct 7 ms 3320 KB Output is correct
24 Correct 7 ms 3320 KB Output is correct
25 Correct 6 ms 3320 KB Output is correct
26 Correct 57 ms 3704 KB Output is correct
27 Correct 15 ms 3704 KB Output is correct
28 Correct 54 ms 3804 KB Output is correct
29 Correct 17 ms 3704 KB Output is correct
30 Correct 57 ms 3704 KB Output is correct
31 Correct 16 ms 3704 KB Output is correct
32 Correct 60 ms 3704 KB Output is correct
33 Correct 17 ms 3832 KB Output is correct
34 Correct 12 ms 3704 KB Output is correct
35 Correct 16 ms 3704 KB Output is correct
36 Correct 56 ms 3832 KB Output is correct
37 Correct 16 ms 3704 KB Output is correct
38 Correct 53 ms 3704 KB Output is correct
39 Correct 16 ms 3704 KB Output is correct
40 Correct 54 ms 3704 KB Output is correct
41 Correct 15 ms 3704 KB Output is correct
42 Correct 53 ms 3704 KB Output is correct
43 Correct 18 ms 3704 KB Output is correct
44 Correct 67 ms 3704 KB Output is correct
45 Correct 16 ms 3704 KB Output is correct
46 Correct 54 ms 3704 KB Output is correct
47 Correct 9 ms 3448 KB Output is correct
48 Correct 34 ms 3704 KB Output is correct
49 Correct 32 ms 3704 KB Output is correct
50 Correct 59 ms 3704 KB Output is correct
51 Correct 57 ms 3708 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 5084 KB Output is correct
2 Correct 18 ms 4984 KB Output is correct
3 Correct 18 ms 4984 KB Output is correct
4 Correct 19 ms 4988 KB Output is correct
5 Correct 19 ms 5112 KB Output is correct
6 Correct 20 ms 4984 KB Output is correct
7 Correct 21 ms 5104 KB Output is correct
8 Correct 19 ms 4984 KB Output is correct
9 Correct 18 ms 4984 KB Output is correct
10 Correct 18 ms 4984 KB Output is correct
11 Correct 19 ms 4984 KB Output is correct
12 Correct 22 ms 4984 KB Output is correct
13 Correct 21 ms 4984 KB Output is correct
14 Correct 23 ms 5112 KB Output is correct
15 Correct 20 ms 4984 KB Output is correct
16 Correct 18 ms 4984 KB Output is correct
17 Correct 19 ms 4984 KB Output is correct
18 Correct 20 ms 4984 KB Output is correct
19 Correct 18 ms 4984 KB Output is correct
20 Correct 18 ms 4984 KB Output is correct
21 Correct 19 ms 4984 KB Output is correct
22 Correct 25 ms 5112 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3320 KB Output is correct
2 Correct 7 ms 3324 KB Output is correct
3 Correct 7 ms 3320 KB Output is correct
4 Correct 6 ms 3320 KB Output is correct
5 Correct 7 ms 3324 KB Output is correct
6 Correct 7 ms 3324 KB Output is correct
7 Correct 6 ms 3320 KB Output is correct
8 Correct 7 ms 3320 KB Output is correct
9 Correct 7 ms 3320 KB Output is correct
10 Correct 7 ms 3320 KB Output is correct
11 Correct 8 ms 3320 KB Output is correct
12 Correct 7 ms 3320 KB Output is correct
13 Correct 7 ms 3320 KB Output is correct
14 Correct 6 ms 3320 KB Output is correct
15 Correct 8 ms 3320 KB Output is correct
16 Correct 7 ms 3320 KB Output is correct
17 Correct 7 ms 3320 KB Output is correct
18 Correct 8 ms 3320 KB Output is correct
19 Correct 7 ms 3320 KB Output is correct
20 Correct 7 ms 3324 KB Output is correct
21 Correct 7 ms 3192 KB Output is correct
22 Correct 6 ms 3416 KB Output is correct
23 Correct 7 ms 3320 KB Output is correct
24 Correct 7 ms 3320 KB Output is correct
25 Correct 6 ms 3320 KB Output is correct
26 Correct 57 ms 3704 KB Output is correct
27 Correct 15 ms 3704 KB Output is correct
28 Correct 54 ms 3804 KB Output is correct
29 Correct 17 ms 3704 KB Output is correct
30 Correct 57 ms 3704 KB Output is correct
31 Correct 16 ms 3704 KB Output is correct
32 Correct 60 ms 3704 KB Output is correct
33 Correct 17 ms 3832 KB Output is correct
34 Correct 12 ms 3704 KB Output is correct
35 Correct 16 ms 3704 KB Output is correct
36 Correct 56 ms 3832 KB Output is correct
37 Correct 16 ms 3704 KB Output is correct
38 Correct 53 ms 3704 KB Output is correct
39 Correct 16 ms 3704 KB Output is correct
40 Correct 54 ms 3704 KB Output is correct
41 Correct 15 ms 3704 KB Output is correct
42 Correct 53 ms 3704 KB Output is correct
43 Correct 18 ms 3704 KB Output is correct
44 Correct 67 ms 3704 KB Output is correct
45 Correct 16 ms 3704 KB Output is correct
46 Correct 54 ms 3704 KB Output is correct
47 Correct 9 ms 3448 KB Output is correct
48 Correct 34 ms 3704 KB Output is correct
49 Correct 32 ms 3704 KB Output is correct
50 Correct 59 ms 3704 KB Output is correct
51 Correct 57 ms 3708 KB Output is correct
52 Correct 19 ms 5084 KB Output is correct
53 Correct 18 ms 4984 KB Output is correct
54 Correct 18 ms 4984 KB Output is correct
55 Correct 19 ms 4988 KB Output is correct
56 Correct 19 ms 5112 KB Output is correct
57 Correct 20 ms 4984 KB Output is correct
58 Correct 21 ms 5104 KB Output is correct
59 Correct 19 ms 4984 KB Output is correct
60 Correct 18 ms 4984 KB Output is correct
61 Correct 18 ms 4984 KB Output is correct
62 Correct 19 ms 4984 KB Output is correct
63 Correct 22 ms 4984 KB Output is correct
64 Correct 21 ms 4984 KB Output is correct
65 Correct 23 ms 5112 KB Output is correct
66 Correct 20 ms 4984 KB Output is correct
67 Correct 18 ms 4984 KB Output is correct
68 Correct 19 ms 4984 KB Output is correct
69 Correct 20 ms 4984 KB Output is correct
70 Correct 18 ms 4984 KB Output is correct
71 Correct 18 ms 4984 KB Output is correct
72 Correct 19 ms 4984 KB Output is correct
73 Correct 25 ms 5112 KB Output is correct
74 Correct 723 ms 9464 KB Output is correct
75 Correct 93 ms 9208 KB Output is correct
76 Correct 723 ms 9468 KB Output is correct
77 Correct 92 ms 9080 KB Output is correct
78 Correct 773 ms 9336 KB Output is correct
79 Correct 762 ms 9468 KB Output is correct
80 Correct 91 ms 9080 KB Output is correct
81 Correct 93 ms 9208 KB Output is correct
82 Correct 760 ms 9464 KB Output is correct
83 Correct 714 ms 9336 KB Output is correct
84 Correct 96 ms 9208 KB Output is correct
85 Correct 736 ms 9332 KB Output is correct
86 Correct 91 ms 9084 KB Output is correct
87 Correct 762 ms 9464 KB Output is correct
88 Correct 85 ms 9080 KB Output is correct
89 Correct 707 ms 9464 KB Output is correct
90 Correct 92 ms 9080 KB Output is correct
91 Correct 744 ms 9464 KB Output is correct
92 Correct 88 ms 9080 KB Output is correct
93 Correct 725 ms 9336 KB Output is correct
94 Correct 56 ms 8824 KB Output is correct
95 Correct 395 ms 9336 KB Output is correct
96 Correct 426 ms 9208 KB Output is correct
97 Correct 782 ms 9468 KB Output is correct
98 Correct 808 ms 9464 KB Output is correct