답안 #404481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
404481 2021-05-14T13:21:39 Z fvogel499 Tug of War (BOI15_tug) C++14
100 / 100
717 ms 10176 KB
#include <bits/stdc++.h>
using namespace std;

multiset<pair<int, int>> graph[60001];
bool visited[60001];
bitset<600001> possible;
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);

	possible[0] = 1;
	for (int i : items) possible |= possible << i;
	for (int i = 0; i <= sm; i++)
		if (possible[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]
   25 |  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]
   28 |   scanf("%d %d %d", &l, &r, &s);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3276 KB Output is correct
2 Correct 2 ms 3276 KB Output is correct
3 Correct 3 ms 3276 KB Output is correct
4 Correct 2 ms 3276 KB Output is correct
5 Correct 2 ms 3276 KB Output is correct
6 Correct 3 ms 3276 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 3 ms 3276 KB Output is correct
9 Correct 3 ms 3276 KB Output is correct
10 Correct 2 ms 3276 KB Output is correct
11 Correct 2 ms 3276 KB Output is correct
12 Correct 2 ms 3276 KB Output is correct
13 Correct 3 ms 3276 KB Output is correct
14 Correct 3 ms 3276 KB Output is correct
15 Correct 2 ms 3276 KB Output is correct
16 Correct 3 ms 3276 KB Output is correct
17 Correct 2 ms 3276 KB Output is correct
18 Correct 3 ms 3276 KB Output is correct
19 Correct 3 ms 3276 KB Output is correct
20 Correct 3 ms 3276 KB Output is correct
21 Correct 2 ms 3148 KB Output is correct
22 Correct 3 ms 3276 KB Output is correct
23 Correct 2 ms 3276 KB Output is correct
24 Correct 2 ms 3276 KB Output is correct
25 Correct 3 ms 3276 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3276 KB Output is correct
2 Correct 2 ms 3276 KB Output is correct
3 Correct 3 ms 3276 KB Output is correct
4 Correct 2 ms 3276 KB Output is correct
5 Correct 2 ms 3276 KB Output is correct
6 Correct 3 ms 3276 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 3 ms 3276 KB Output is correct
9 Correct 3 ms 3276 KB Output is correct
10 Correct 2 ms 3276 KB Output is correct
11 Correct 2 ms 3276 KB Output is correct
12 Correct 2 ms 3276 KB Output is correct
13 Correct 3 ms 3276 KB Output is correct
14 Correct 3 ms 3276 KB Output is correct
15 Correct 2 ms 3276 KB Output is correct
16 Correct 3 ms 3276 KB Output is correct
17 Correct 2 ms 3276 KB Output is correct
18 Correct 3 ms 3276 KB Output is correct
19 Correct 3 ms 3276 KB Output is correct
20 Correct 3 ms 3276 KB Output is correct
21 Correct 2 ms 3148 KB Output is correct
22 Correct 3 ms 3276 KB Output is correct
23 Correct 2 ms 3276 KB Output is correct
24 Correct 2 ms 3276 KB Output is correct
25 Correct 3 ms 3276 KB Output is correct
26 Correct 47 ms 3660 KB Output is correct
27 Correct 10 ms 3708 KB Output is correct
28 Correct 48 ms 3716 KB Output is correct
29 Correct 10 ms 3660 KB Output is correct
30 Correct 50 ms 3660 KB Output is correct
31 Correct 11 ms 3608 KB Output is correct
32 Correct 46 ms 3660 KB Output is correct
33 Correct 11 ms 3660 KB Output is correct
34 Correct 8 ms 3660 KB Output is correct
35 Correct 10 ms 3700 KB Output is correct
36 Correct 47 ms 3704 KB Output is correct
37 Correct 11 ms 3640 KB Output is correct
38 Correct 46 ms 3660 KB Output is correct
39 Correct 10 ms 3660 KB Output is correct
40 Correct 47 ms 3660 KB Output is correct
41 Correct 10 ms 3660 KB Output is correct
42 Correct 49 ms 3708 KB Output is correct
43 Correct 11 ms 3640 KB Output is correct
44 Correct 46 ms 3660 KB Output is correct
45 Correct 11 ms 3660 KB Output is correct
46 Correct 46 ms 3660 KB Output is correct
47 Correct 4 ms 3532 KB Output is correct
48 Correct 26 ms 3660 KB Output is correct
49 Correct 26 ms 3660 KB Output is correct
50 Correct 49 ms 3660 KB Output is correct
51 Correct 49 ms 3644 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 5164 KB Output is correct
2 Correct 13 ms 5068 KB Output is correct
3 Correct 13 ms 5156 KB Output is correct
4 Correct 13 ms 5144 KB Output is correct
5 Correct 14 ms 5068 KB Output is correct
6 Correct 13 ms 5068 KB Output is correct
7 Correct 16 ms 5068 KB Output is correct
8 Correct 13 ms 5068 KB Output is correct
9 Correct 13 ms 5100 KB Output is correct
10 Correct 13 ms 5068 KB Output is correct
11 Correct 13 ms 5156 KB Output is correct
12 Correct 13 ms 5044 KB Output is correct
13 Correct 14 ms 5156 KB Output is correct
14 Correct 14 ms 5068 KB Output is correct
15 Correct 13 ms 5068 KB Output is correct
16 Correct 13 ms 5056 KB Output is correct
17 Correct 15 ms 5136 KB Output is correct
18 Correct 16 ms 5068 KB Output is correct
19 Correct 13 ms 5128 KB Output is correct
20 Correct 14 ms 5116 KB Output is correct
21 Correct 13 ms 5068 KB Output is correct
22 Correct 15 ms 5068 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3276 KB Output is correct
2 Correct 2 ms 3276 KB Output is correct
3 Correct 3 ms 3276 KB Output is correct
4 Correct 2 ms 3276 KB Output is correct
5 Correct 2 ms 3276 KB Output is correct
6 Correct 3 ms 3276 KB Output is correct
7 Correct 3 ms 3276 KB Output is correct
8 Correct 3 ms 3276 KB Output is correct
9 Correct 3 ms 3276 KB Output is correct
10 Correct 2 ms 3276 KB Output is correct
11 Correct 2 ms 3276 KB Output is correct
12 Correct 2 ms 3276 KB Output is correct
13 Correct 3 ms 3276 KB Output is correct
14 Correct 3 ms 3276 KB Output is correct
15 Correct 2 ms 3276 KB Output is correct
16 Correct 3 ms 3276 KB Output is correct
17 Correct 2 ms 3276 KB Output is correct
18 Correct 3 ms 3276 KB Output is correct
19 Correct 3 ms 3276 KB Output is correct
20 Correct 3 ms 3276 KB Output is correct
21 Correct 2 ms 3148 KB Output is correct
22 Correct 3 ms 3276 KB Output is correct
23 Correct 2 ms 3276 KB Output is correct
24 Correct 2 ms 3276 KB Output is correct
25 Correct 3 ms 3276 KB Output is correct
26 Correct 47 ms 3660 KB Output is correct
27 Correct 10 ms 3708 KB Output is correct
28 Correct 48 ms 3716 KB Output is correct
29 Correct 10 ms 3660 KB Output is correct
30 Correct 50 ms 3660 KB Output is correct
31 Correct 11 ms 3608 KB Output is correct
32 Correct 46 ms 3660 KB Output is correct
33 Correct 11 ms 3660 KB Output is correct
34 Correct 8 ms 3660 KB Output is correct
35 Correct 10 ms 3700 KB Output is correct
36 Correct 47 ms 3704 KB Output is correct
37 Correct 11 ms 3640 KB Output is correct
38 Correct 46 ms 3660 KB Output is correct
39 Correct 10 ms 3660 KB Output is correct
40 Correct 47 ms 3660 KB Output is correct
41 Correct 10 ms 3660 KB Output is correct
42 Correct 49 ms 3708 KB Output is correct
43 Correct 11 ms 3640 KB Output is correct
44 Correct 46 ms 3660 KB Output is correct
45 Correct 11 ms 3660 KB Output is correct
46 Correct 46 ms 3660 KB Output is correct
47 Correct 4 ms 3532 KB Output is correct
48 Correct 26 ms 3660 KB Output is correct
49 Correct 26 ms 3660 KB Output is correct
50 Correct 49 ms 3660 KB Output is correct
51 Correct 49 ms 3644 KB Output is correct
52 Correct 15 ms 5164 KB Output is correct
53 Correct 13 ms 5068 KB Output is correct
54 Correct 13 ms 5156 KB Output is correct
55 Correct 13 ms 5144 KB Output is correct
56 Correct 14 ms 5068 KB Output is correct
57 Correct 13 ms 5068 KB Output is correct
58 Correct 16 ms 5068 KB Output is correct
59 Correct 13 ms 5068 KB Output is correct
60 Correct 13 ms 5100 KB Output is correct
61 Correct 13 ms 5068 KB Output is correct
62 Correct 13 ms 5156 KB Output is correct
63 Correct 13 ms 5044 KB Output is correct
64 Correct 14 ms 5156 KB Output is correct
65 Correct 14 ms 5068 KB Output is correct
66 Correct 13 ms 5068 KB Output is correct
67 Correct 13 ms 5056 KB Output is correct
68 Correct 15 ms 5136 KB Output is correct
69 Correct 16 ms 5068 KB Output is correct
70 Correct 13 ms 5128 KB Output is correct
71 Correct 14 ms 5116 KB Output is correct
72 Correct 13 ms 5068 KB Output is correct
73 Correct 15 ms 5068 KB Output is correct
74 Correct 685 ms 9264 KB Output is correct
75 Correct 74 ms 8968 KB Output is correct
76 Correct 673 ms 9248 KB Output is correct
77 Correct 73 ms 8924 KB Output is correct
78 Correct 675 ms 9236 KB Output is correct
79 Correct 684 ms 10176 KB Output is correct
80 Correct 78 ms 9788 KB Output is correct
81 Correct 77 ms 9776 KB Output is correct
82 Correct 686 ms 10060 KB Output is correct
83 Correct 671 ms 10056 KB Output is correct
84 Correct 76 ms 9736 KB Output is correct
85 Correct 678 ms 10052 KB Output is correct
86 Correct 77 ms 9796 KB Output is correct
87 Correct 682 ms 10052 KB Output is correct
88 Correct 82 ms 9880 KB Output is correct
89 Correct 679 ms 10060 KB Output is correct
90 Correct 82 ms 9752 KB Output is correct
91 Correct 689 ms 10060 KB Output is correct
92 Correct 80 ms 9732 KB Output is correct
93 Correct 684 ms 10056 KB Output is correct
94 Correct 47 ms 9668 KB Output is correct
95 Correct 368 ms 9960 KB Output is correct
96 Correct 378 ms 9976 KB Output is correct
97 Correct 705 ms 9940 KB Output is correct
98 Correct 717 ms 10052 KB Output is correct