oj.uz

답안 #572812

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572812 2022-06-05T10:23:58 Z vovamr Bootfall (IZhO17_bootfall) C++17
44 / 100
 392 ms 1820 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

const int N = 550;
const int MX = N * N;
int a[N], dp[MX + 1];

const int md = 998244353;
inline void add(int &a, int b) { a += b; if (a >= md){a -= md;} }
inline void sub(int &a, int b) { a -= b; if (a < 0){a += md;} }

inline void solve() {
	int n;
	cin >> n;
	for (int i = 0; i < n; ++i) cin >> a[i];

	dp[0] = 1;
	for (int i = 0; i < n; ++i) {
		for (int j = MX - a[i]; ~j; --j) {
			add(dp[a[i] + j], dp[j]);
		}
	}

	int s = accumulate(a, a + n, 0);
	if (!dp[s >> 1]) return void(cout << 0);

	bitset<MX> res; res.set();

	for (int i = 0; i < n; ++i) {
		for (int j = 0; j <= MX - a[i]; ++j) {
			sub(dp[a[i] + j], dp[j]);
		}
		bitset<MX> now;
		for (int x = 0; x < MX; ++x) {
			if ((s - a[i] + x) & 1) continue;
			if (dp[(s - a[i] + x) >> 1]) now.set(x);
		}
		res &= now;
		for (int j = MX - a[i]; ~j; --j) {
			add(dp[a[i] + j], dp[j]);
		}
	}

	int ans = res.count();

	cout << ans << '\n';
	int pos = res._Find_first();

	for (int i = 0; i < ans; ++i) {
		cout << pos << " ";
		pos = res._Find_next(pos);
	}
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1516 KB Output is correct
2 Correct 8 ms 1492 KB Output is correct
3 Correct 2 ms 1548 KB Output is correct
4 Correct 5 ms 1492 KB Output is correct
5 Correct 14 ms 1580 KB Output is correct
6 Correct 9 ms 1492 KB Output is correct
7 Correct 8 ms 1492 KB Output is correct
8 Correct 14 ms 1552 KB Output is correct
9 Correct 13 ms 1580 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1516 KB Output is correct
2 Correct 8 ms 1492 KB Output is correct
3 Correct 2 ms 1548 KB Output is correct
4 Correct 5 ms 1492 KB Output is correct
5 Correct 14 ms 1580 KB Output is correct
6 Correct 9 ms 1492 KB Output is correct
7 Correct 8 ms 1492 KB Output is correct
8 Correct 14 ms 1552 KB Output is correct
9 Correct 13 ms 1580 KB Output is correct
10 Correct 33 ms 1576 KB Output is correct
11 Correct 37 ms 1560 KB Output is correct
12 Correct 35 ms 1572 KB Output is correct
13 Correct 33 ms 1492 KB Output is correct
14 Correct 32 ms 1492 KB Output is correct
15 Correct 35 ms 1552 KB Output is correct
16 Correct 37 ms 1492 KB Output is correct
17 Correct 21 ms 1492 KB Output is correct
18 Correct 27 ms 1548 KB Output is correct
19 Correct 30 ms 1492 KB Output is correct
20 Correct 34 ms 1556 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1516 KB Output is correct
2 Correct 8 ms 1492 KB Output is correct
3 Correct 2 ms 1548 KB Output is correct
4 Correct 5 ms 1492 KB Output is correct
5 Correct 14 ms 1580 KB Output is correct
6 Correct 9 ms 1492 KB Output is correct
7 Correct 8 ms 1492 KB Output is correct
8 Correct 14 ms 1552 KB Output is correct
9 Correct 13 ms 1580 KB Output is correct
10 Correct 33 ms 1576 KB Output is correct
11 Correct 37 ms 1560 KB Output is correct
12 Correct 35 ms 1572 KB Output is correct
13 Correct 33 ms 1492 KB Output is correct
14 Correct 32 ms 1492 KB Output is correct
15 Correct 35 ms 1552 KB Output is correct
16 Correct 37 ms 1492 KB Output is correct
17 Correct 21 ms 1492 KB Output is correct
18 Correct 27 ms 1548 KB Output is correct
19 Correct 30 ms 1492 KB Output is correct
20 Correct 34 ms 1556 KB Output is correct
21 Correct 69 ms 1560 KB Output is correct
22 Correct 86 ms 1572 KB Output is correct
23 Correct 60 ms 1556 KB Output is correct
24 Correct 110 ms 1572 KB Output is correct
25 Correct 100 ms 1564 KB Output is correct
26 Correct 110 ms 1564 KB Output is correct
27 Correct 122 ms 1568 KB Output is correct
28 Correct 108 ms 1492 KB Output is correct
29 Correct 108 ms 1564 KB Output is correct
30 Correct 111 ms 1560 KB Output is correct
31 Correct 108 ms 1572 KB Output is correct
32 Correct 111 ms 1564 KB Output is correct
33 Correct 105 ms 1556 KB Output is correct
34 Correct 105 ms 1492 KB Output is correct
35 Correct 108 ms 1492 KB Output is correct
36 Correct 111 ms 1560 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1516 KB Output is correct
2 Correct 8 ms 1492 KB Output is correct
3 Correct 2 ms 1548 KB Output is correct
4 Correct 5 ms 1492 KB Output is correct
5 Correct 14 ms 1580 KB Output is correct
6 Correct 9 ms 1492 KB Output is correct
7 Correct 8 ms 1492 KB Output is correct
8 Correct 14 ms 1552 KB Output is correct
9 Correct 13 ms 1580 KB Output is correct
10 Correct 33 ms 1576 KB Output is correct
11 Correct 37 ms 1560 KB Output is correct
12 Correct 35 ms 1572 KB Output is correct
13 Correct 33 ms 1492 KB Output is correct
14 Correct 32 ms 1492 KB Output is correct
15 Correct 35 ms 1552 KB Output is correct
16 Correct 37 ms 1492 KB Output is correct
17 Correct 21 ms 1492 KB Output is correct
18 Correct 27 ms 1548 KB Output is correct
19 Correct 30 ms 1492 KB Output is correct
20 Correct 34 ms 1556 KB Output is correct
21 Correct 69 ms 1560 KB Output is correct
22 Correct 86 ms 1572 KB Output is correct
23 Correct 60 ms 1556 KB Output is correct
24 Correct 110 ms 1572 KB Output is correct
25 Correct 100 ms 1564 KB Output is correct
26 Correct 110 ms 1564 KB Output is correct
27 Correct 122 ms 1568 KB Output is correct
28 Correct 108 ms 1492 KB Output is correct
29 Correct 108 ms 1564 KB Output is correct
30 Correct 111 ms 1560 KB Output is correct
31 Correct 108 ms 1572 KB Output is correct
32 Correct 111 ms 1564 KB Output is correct
33 Correct 105 ms 1556 KB Output is correct
34 Correct 105 ms 1492 KB Output is correct
35 Correct 108 ms 1492 KB Output is correct
36 Correct 111 ms 1560 KB Output is correct
37 Correct 214 ms 1572 KB Output is correct
38 Correct 225 ms 1564 KB Output is correct
39 Correct 262 ms 1560 KB Output is correct
40 Correct 286 ms 1572 KB Output is correct
41 Correct 296 ms 1564 KB Output is correct
42 Correct 263 ms 1560 KB Output is correct
43 Correct 264 ms 1692 KB Output is correct
44 Correct 265 ms 1688 KB Output is correct
45 Correct 265 ms 1692 KB Output is correct
46 Correct 300 ms 1556 KB Output is correct
47 Correct 293 ms 1576 KB Output is correct
48 Correct 263 ms 1568 KB Output is correct
49 Correct 270 ms 1560 KB Output is correct
50 Correct 276 ms 1572 KB Output is correct
51 Correct 274 ms 1568 KB Output is correct
52 Correct 285 ms 1740 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1516 KB Output is correct
2 Correct 8 ms 1492 KB Output is correct
3 Correct 2 ms 1548 KB Output is correct
4 Correct 5 ms 1492 KB Output is correct
5 Correct 14 ms 1580 KB Output is correct
6 Correct 9 ms 1492 KB Output is correct
7 Correct 8 ms 1492 KB Output is correct
8 Correct 14 ms 1552 KB Output is correct
9 Correct 13 ms 1580 KB Output is correct
10 Correct 33 ms 1576 KB Output is correct
11 Correct 37 ms 1560 KB Output is correct
12 Correct 35 ms 1572 KB Output is correct
13 Correct 33 ms 1492 KB Output is correct
14 Correct 32 ms 1492 KB Output is correct
15 Correct 35 ms 1552 KB Output is correct
16 Correct 37 ms 1492 KB Output is correct
17 Correct 21 ms 1492 KB Output is correct
18 Correct 27 ms 1548 KB Output is correct
19 Correct 30 ms 1492 KB Output is correct
20 Correct 34 ms 1556 KB Output is correct
21 Correct 69 ms 1560 KB Output is correct
22 Correct 86 ms 1572 KB Output is correct
23 Correct 60 ms 1556 KB Output is correct
24 Correct 110 ms 1572 KB Output is correct
25 Correct 100 ms 1564 KB Output is correct
26 Correct 110 ms 1564 KB Output is correct
27 Correct 122 ms 1568 KB Output is correct
28 Correct 108 ms 1492 KB Output is correct
29 Correct 108 ms 1564 KB Output is correct
30 Correct 111 ms 1560 KB Output is correct
31 Correct 108 ms 1572 KB Output is correct
32 Correct 111 ms 1564 KB Output is correct
33 Correct 105 ms 1556 KB Output is correct
34 Correct 105 ms 1492 KB Output is correct
35 Correct 108 ms 1492 KB Output is correct
36 Correct 111 ms 1560 KB Output is correct
37 Correct 214 ms 1572 KB Output is correct
38 Correct 225 ms 1564 KB Output is correct
39 Correct 262 ms 1560 KB Output is correct
40 Correct 286 ms 1572 KB Output is correct
41 Correct 296 ms 1564 KB Output is correct
42 Correct 263 ms 1560 KB Output is correct
43 Correct 264 ms 1692 KB Output is correct
44 Correct 265 ms 1688 KB Output is correct
45 Correct 265 ms 1692 KB Output is correct
46 Correct 300 ms 1556 KB Output is correct
47 Correct 293 ms 1576 KB Output is correct
48 Correct 263 ms 1568 KB Output is correct
49 Correct 270 ms 1560 KB Output is correct
50 Correct 276 ms 1572 KB Output is correct
51 Correct 274 ms 1568 KB Output is correct
52 Correct 285 ms 1740 KB Output is correct
53 Correct 312 ms 1692 KB Output is correct
54 Correct 385 ms 1688 KB Output is correct
55 Correct 362 ms 1812 KB Output is correct
56 Correct 319 ms 1688 KB Output is correct
57 Correct 392 ms 1820 KB Output is correct
58 Incorrect 374 ms 1740 KB Output isn't correct
59 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1516 KB Output is correct
2 Correct 8 ms 1492 KB Output is correct
3 Correct 2 ms 1548 KB Output is correct
4 Correct 5 ms 1492 KB Output is correct
5 Correct 14 ms 1580 KB Output is correct
6 Correct 9 ms 1492 KB Output is correct
7 Correct 8 ms 1492 KB Output is correct
8 Correct 14 ms 1552 KB Output is correct
9 Correct 13 ms 1580 KB Output is correct
10 Correct 33 ms 1576 KB Output is correct
11 Correct 37 ms 1560 KB Output is correct
12 Correct 35 ms 1572 KB Output is correct
13 Correct 33 ms 1492 KB Output is correct
14 Correct 32 ms 1492 KB Output is correct
15 Correct 35 ms 1552 KB Output is correct
16 Correct 37 ms 1492 KB Output is correct
17 Correct 21 ms 1492 KB Output is correct
18 Correct 27 ms 1548 KB Output is correct
19 Correct 30 ms 1492 KB Output is correct
20 Correct 34 ms 1556 KB Output is correct
21 Correct 69 ms 1560 KB Output is correct
22 Correct 86 ms 1572 KB Output is correct
23 Correct 60 ms 1556 KB Output is correct
24 Correct 110 ms 1572 KB Output is correct
25 Correct 100 ms 1564 KB Output is correct
26 Correct 110 ms 1564 KB Output is correct
27 Correct 122 ms 1568 KB Output is correct
28 Correct 108 ms 1492 KB Output is correct
29 Correct 108 ms 1564 KB Output is correct
30 Correct 111 ms 1560 KB Output is correct
31 Correct 108 ms 1572 KB Output is correct
32 Correct 111 ms 1564 KB Output is correct
33 Correct 105 ms 1556 KB Output is correct
34 Correct 105 ms 1492 KB Output is correct
35 Correct 108 ms 1492 KB Output is correct
36 Correct 111 ms 1560 KB Output is correct
37 Correct 214 ms 1572 KB Output is correct
38 Correct 225 ms 1564 KB Output is correct
39 Correct 262 ms 1560 KB Output is correct
40 Correct 286 ms 1572 KB Output is correct
41 Correct 296 ms 1564 KB Output is correct
42 Correct 263 ms 1560 KB Output is correct
43 Correct 264 ms 1692 KB Output is correct
44 Correct 265 ms 1688 KB Output is correct
45 Correct 265 ms 1692 KB Output is correct
46 Correct 300 ms 1556 KB Output is correct
47 Correct 293 ms 1576 KB Output is correct
48 Correct 263 ms 1568 KB Output is correct
49 Correct 270 ms 1560 KB Output is correct
50 Correct 276 ms 1572 KB Output is correct
51 Correct 274 ms 1568 KB Output is correct
52 Correct 285 ms 1740 KB Output is correct
53 Correct 312 ms 1692 KB Output is correct
54 Correct 385 ms 1688 KB Output is correct
55 Correct 362 ms 1812 KB Output is correct
56 Correct 319 ms 1688 KB Output is correct
57 Correct 392 ms 1820 KB Output is correct
58 Incorrect 374 ms 1740 KB Output isn't correct
59 Halted 0 ms 0 KB -