oj.uz

답안 #922896

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922896 2024-02-06T09:04:46 Z penguin133 Bootfall (IZhO17_bootfall) C++17
13 / 100
 1000 ms 14700 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

bitset <351*351*2>dp[505], dp2[505];
int n, A[505];
const int os = 350 * 350;

bool chk(int a, int b){
	if(os - a - b >= 0 && dp[n & 1][os - a - b])return 1;
	if(os - a + b >= 0 && os - a + b <= 2 * os && dp[n & 1][os - a + b])return 1;
	if(os + a - b >= 0 && os + a - b <= 2 * os && dp[n & 1][os + a - b])return 1;
	if(os + a + b <= 2 * os && dp[n & 1][os + a + b])return 1;
	return 0;
}

void solve(){
	cin >> n;
	for(int i = 1; i <= n; i++)cin >> A[i];
	//for(int i = 0; i <= 2 * os; i++)dp[0][i] = 0
	dp[0][os] = dp2[n + 1][os] = 1;
	for(int i = 1; i <= n; i++){
		dp[i] |= (dp[i - 1] >> A[i]);
		dp[i] |= (dp[i - 1] << A[i]);
	}
	for(int i = n; i >= 1; i--){
		dp2[i] |= (dp2[i + 1] >> A[i]);
		dp2[i] |= (dp2[i + 1] << A[i]);
	}
	if(!dp[n][os]){
		cout << 0;
		return;
	}
	set <int> s;
	for(int i = 1; i <= os; i++)s.insert(i);
	for(int i = 1; i <= n; i++){
		bitset <351*351*2> tmp = dp[i - 1], tmp2;
		for(int j = 0; j <= os; j++){
			if(dp2[i + 1][os - j] || dp2[i + 1][os + j]){
				if(1)tmp2 |= (tmp >> j), tmp2 |= (tmp << j);
			}
		}
		if(i == 2){
			//for(int j = 0; j <= os * 2; j++)if(tmp2[j])cout << j - os << ' ';
			//cout << '\n';
		}
		for(int j = 0; j <= os; j++)if(!tmp2[os - j] && !tmp2[os + j])s.erase(j);
	}
	cout << (int)s.size() << '\n';
	for(auto i : s)cout << i << ' ';
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

bootfall.cpp:62:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   62 | main(){
      | ^~~~

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 8536 KB Output is correct
2 Correct 28 ms 10596 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 25 ms 8404 KB Output is correct
5 Correct 46 ms 10588 KB Output is correct
6 Correct 31 ms 10588 KB Output is correct
7 Correct 28 ms 10356 KB Output is correct
8 Correct 45 ms 10596 KB Output is correct
9 Correct 38 ms 10604 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 8536 KB Output is correct
2 Correct 28 ms 10596 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 25 ms 8404 KB Output is correct
5 Correct 46 ms 10588 KB Output is correct
6 Correct 31 ms 10588 KB Output is correct
7 Correct 28 ms 10356 KB Output is correct
8 Correct 45 ms 10596 KB Output is correct
9 Correct 38 ms 10604 KB Output is correct
10 Correct 50 ms 10584 KB Output is correct
11 Correct 70 ms 10600 KB Output is correct
12 Correct 62 ms 10588 KB Output is correct
13 Correct 60 ms 10584 KB Output is correct
14 Correct 73 ms 10588 KB Output is correct
15 Correct 68 ms 10596 KB Output is correct
16 Correct 74 ms 10588 KB Output is correct
17 Correct 57 ms 10588 KB Output is correct
18 Correct 60 ms 10596 KB Output is correct
19 Correct 67 ms 10596 KB Output is correct
20 Correct 49 ms 10484 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 8536 KB Output is correct
2 Correct 28 ms 10596 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 25 ms 8404 KB Output is correct
5 Correct 46 ms 10588 KB Output is correct
6 Correct 31 ms 10588 KB Output is correct
7 Correct 28 ms 10356 KB Output is correct
8 Correct 45 ms 10596 KB Output is correct
9 Correct 38 ms 10604 KB Output is correct
10 Correct 50 ms 10584 KB Output is correct
11 Correct 70 ms 10600 KB Output is correct
12 Correct 62 ms 10588 KB Output is correct
13 Correct 60 ms 10584 KB Output is correct
14 Correct 73 ms 10588 KB Output is correct
15 Correct 68 ms 10596 KB Output is correct
16 Correct 74 ms 10588 KB Output is correct
17 Correct 57 ms 10588 KB Output is correct
18 Correct 60 ms 10596 KB Output is correct
19 Correct 67 ms 10596 KB Output is correct
20 Correct 49 ms 10484 KB Output is correct
21 Correct 665 ms 12652 KB Output is correct
22 Correct 834 ms 14700 KB Output is correct
23 Correct 428 ms 12888 KB Output is correct
24 Execution timed out 1049 ms 14684 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 8536 KB Output is correct
2 Correct 28 ms 10596 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 25 ms 8404 KB Output is correct
5 Correct 46 ms 10588 KB Output is correct
6 Correct 31 ms 10588 KB Output is correct
7 Correct 28 ms 10356 KB Output is correct
8 Correct 45 ms 10596 KB Output is correct
9 Correct 38 ms 10604 KB Output is correct
10 Correct 50 ms 10584 KB Output is correct
11 Correct 70 ms 10600 KB Output is correct
12 Correct 62 ms 10588 KB Output is correct
13 Correct 60 ms 10584 KB Output is correct
14 Correct 73 ms 10588 KB Output is correct
15 Correct 68 ms 10596 KB Output is correct
16 Correct 74 ms 10588 KB Output is correct
17 Correct 57 ms 10588 KB Output is correct
18 Correct 60 ms 10596 KB Output is correct
19 Correct 67 ms 10596 KB Output is correct
20 Correct 49 ms 10484 KB Output is correct
21 Correct 665 ms 12652 KB Output is correct
22 Correct 834 ms 14700 KB Output is correct
23 Correct 428 ms 12888 KB Output is correct
24 Execution timed out 1049 ms 14684 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 8536 KB Output is correct
2 Correct 28 ms 10596 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 25 ms 8404 KB Output is correct
5 Correct 46 ms 10588 KB Output is correct
6 Correct 31 ms 10588 KB Output is correct
7 Correct 28 ms 10356 KB Output is correct
8 Correct 45 ms 10596 KB Output is correct
9 Correct 38 ms 10604 KB Output is correct
10 Correct 50 ms 10584 KB Output is correct
11 Correct 70 ms 10600 KB Output is correct
12 Correct 62 ms 10588 KB Output is correct
13 Correct 60 ms 10584 KB Output is correct
14 Correct 73 ms 10588 KB Output is correct
15 Correct 68 ms 10596 KB Output is correct
16 Correct 74 ms 10588 KB Output is correct
17 Correct 57 ms 10588 KB Output is correct
18 Correct 60 ms 10596 KB Output is correct
19 Correct 67 ms 10596 KB Output is correct
20 Correct 49 ms 10484 KB Output is correct
21 Correct 665 ms 12652 KB Output is correct
22 Correct 834 ms 14700 KB Output is correct
23 Correct 428 ms 12888 KB Output is correct
24 Execution timed out 1049 ms 14684 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 8536 KB Output is correct
2 Correct 28 ms 10596 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 25 ms 8404 KB Output is correct
5 Correct 46 ms 10588 KB Output is correct
6 Correct 31 ms 10588 KB Output is correct
7 Correct 28 ms 10356 KB Output is correct
8 Correct 45 ms 10596 KB Output is correct
9 Correct 38 ms 10604 KB Output is correct
10 Correct 50 ms 10584 KB Output is correct
11 Correct 70 ms 10600 KB Output is correct
12 Correct 62 ms 10588 KB Output is correct
13 Correct 60 ms 10584 KB Output is correct
14 Correct 73 ms 10588 KB Output is correct
15 Correct 68 ms 10596 KB Output is correct
16 Correct 74 ms 10588 KB Output is correct
17 Correct 57 ms 10588 KB Output is correct
18 Correct 60 ms 10596 KB Output is correct
19 Correct 67 ms 10596 KB Output is correct
20 Correct 49 ms 10484 KB Output is correct
21 Correct 665 ms 12652 KB Output is correct
22 Correct 834 ms 14700 KB Output is correct
23 Correct 428 ms 12888 KB Output is correct
24 Execution timed out 1049 ms 14684 KB Time limit exceeded
25 Halted 0 ms 0 KB -