답안 #173511

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
173511	2020-01-04T10:52:34 Z	AllMight	Bootfall (IZhO17_bootfall)	C++14	13 / 100	1000 ms	736 KB

bootfall

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>

using namespace std;

const int N = 502;

int n;
int a[N];
int cnt[N * N];
vector <int> v;

void check(int ind)
{
	vector <bool> knp(N * N, false);
	knp[0] = true;
	priority_queue <int> pq[2];
	pq[0].push(0);

	for (int i = 0, f = 0; i < n; i++, f = 1 - f) {
		if (i == ind) {
			f = 1 - f;
			continue;
		}

		while (!pq[f].empty()) {
			int tp = pq[f].top();
			pq[f].pop();

			pq[1 - f].push(tp);
			if (!knp[tp + a[i]])
				pq[1 - f].push(tp + a[i]);

			knp[tp + a[i]] = true;
		}
	}
	
	int sum;
	if (pq[0].empty())
		sum = pq[1].top();
	else
		sum = pq[0].top();
	
	for (int i = 0; 2 * i < sum; i++) {
		if (!knp[i])	continue;
		int ans = sum - 2 * i;
		cnt[ans]++;
		if (ind == 0)
			v.push_back(ans);
	}
}

int main()
{
	ios_base::sync_with_stdio(false);

	cin >> n;
	vector <bool> knp(N * N, false);
	knp[0] = true;
	priority_queue <int> pq[2];
	pq[0].push(0);
	for (int i = 0, f = 0; i < n; i++, f = 1 - f) {
		cin >> a[i];
		while (!pq[f].empty()) {
			int tp = pq[f].top();
			pq[f].pop();

			pq[1 - f].push(tp);
			if (!knp[tp + a[i]])
				pq[1 - f].push(tp + a[i]);
			
			knp[tp + a[i]] = true;
		}
	}
	int sum;
	if (pq[0].empty())
		sum = pq[1].top();
	else
		sum = pq[0].top();
	if (sum % 2 || !knp[sum / 2]) {
		cout << "0\n";
		return 0;
	}

	for (int i = 0; i < n; i++)
		check(i);

	vector <int> ans;
	for (int i = 0; i < v.size(); i++)
		if (cnt[v[i]] == n)
			ans.push_back(v[i]);

	sort(ans.begin(), ans.end());
	cout << ans.size() << endl;
	for (int i = 0; i < ans.size(); i++)
		cout << ans[i] << ' ';
	cout << endl;

	return 0;
}

Compilation message

bootfall.cpp: In function 'int main()':
bootfall.cpp:92:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < v.size(); i++)
                  ~~^~~~~~~~~~
bootfall.cpp:98:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ans.size(); i++)
                  ~~^~~~~~~~~~~~

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	504 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct

Subtask #2
7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	504 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	9 ms	376 KB	Output is correct
12	Correct	7 ms	376 KB	Output is correct
13	Correct	6 ms	376 KB	Output is correct
14	Correct	8 ms	376 KB	Output is correct
15	Correct	6 ms	376 KB	Output is correct
16	Correct	7 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	6 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct

Subtask #3
0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	504 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	9 ms	376 KB	Output is correct
12	Correct	7 ms	376 KB	Output is correct
13	Correct	6 ms	376 KB	Output is correct
14	Correct	8 ms	376 KB	Output is correct
15	Correct	6 ms	376 KB	Output is correct
16	Correct	7 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	6 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	478 ms	552 KB	Output is correct
22	Correct	731 ms	736 KB	Output is correct
23	Correct	208 ms	504 KB	Output is correct
24	Execution timed out	1077 ms	632 KB	Time limit exceeded
25	Halted	0 ms	0 KB	-

Subtask #4
0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	504 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	9 ms	376 KB	Output is correct
12	Correct	7 ms	376 KB	Output is correct
13	Correct	6 ms	376 KB	Output is correct
14	Correct	8 ms	376 KB	Output is correct
15	Correct	6 ms	376 KB	Output is correct
16	Correct	7 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	6 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	478 ms	552 KB	Output is correct
22	Correct	731 ms	736 KB	Output is correct
23	Correct	208 ms	504 KB	Output is correct
24	Execution timed out	1077 ms	632 KB	Time limit exceeded
25	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	504 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	9 ms	376 KB	Output is correct
12	Correct	7 ms	376 KB	Output is correct
13	Correct	6 ms	376 KB	Output is correct
14	Correct	8 ms	376 KB	Output is correct
15	Correct	6 ms	376 KB	Output is correct
16	Correct	7 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	6 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	478 ms	552 KB	Output is correct
22	Correct	731 ms	736 KB	Output is correct
23	Correct	208 ms	504 KB	Output is correct
24	Execution timed out	1077 ms	632 KB	Time limit exceeded
25	Halted	0 ms	0 KB	-

Subtask #6
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	380 KB	Output is correct
5	Correct	3 ms	504 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	3 ms	504 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	3 ms	376 KB	Output is correct
11	Correct	9 ms	376 KB	Output is correct
12	Correct	7 ms	376 KB	Output is correct
13	Correct	6 ms	376 KB	Output is correct
14	Correct	8 ms	376 KB	Output is correct
15	Correct	6 ms	376 KB	Output is correct
16	Correct	7 ms	376 KB	Output is correct
17	Correct	3 ms	376 KB	Output is correct
18	Correct	5 ms	376 KB	Output is correct
19	Correct	6 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	478 ms	552 KB	Output is correct
22	Correct	731 ms	736 KB	Output is correct
23	Correct	208 ms	504 KB	Output is correct
24	Execution timed out	1077 ms	632 KB	Time limit exceeded
25	Halted	0 ms	0 KB	-

답안 #173511

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 7.0 / 7.0

Subtask #3 0 / 15.0

Subtask #4 0 / 16.0

Subtask #5 0 / 21.0

Subtask #6 0 / 35.0

Subtask #1
6.0 / 6.0

Subtask #2
7.0 / 7.0

Subtask #3
0 / 15.0

Subtask #4
0 / 16.0

Subtask #5
0 / 21.0

Subtask #6
0 / 35.0