oj.uz

Submission #107880

# Submission time Handle Problem Language Result Execution time Memory
107880 2019-04-26T06:08:17 Z qkxwsm Bootfall (IZhO17_bootfall) C++14
100 / 100
 687 ms 3804 KB 
//clever
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

random_device(rd);
mt19937 rng(rd());
const long long FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();

struct custom_hash
{
	template<class T>
	unsigned long long operator()(T v) const
	{
		unsigned long long x = v;
		x += FIXED_RANDOM;
		// x += 11400714819323198485ull;
		// x = (x ^ (x >> 30)) * 13787848793156543929ull;
		x = (x ^ (x >> 27)) * 10723151780598845931ull;
		return x ^ (x >> 31);
	}
};

template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T, class U> using hash_table = gp_hash_table<T, U, custom_hash>;

template<class T>
T randomize(T mod)
{
	return (uniform_int_distribution<T>(0, mod - 1))(rng);
}
template<class T>
void readi(T &x)
{
	x = 0;
	bool negative = false;
	char c = ' ';
	while (c < '-')
	{
		c = getchar();
	}
	if (c == '-')
	{
		negative = true;
		c = getchar();
	}
	while (c >= '0')
	{
		x = x * 10 + (c - '0');
		c = getchar();
	}
	if (negative)
	{
		x = -x;
	}
}
template<class T>
void printi(T output)
{
	if (output == 0)
	{
		putchar('0');
		return;
	}
	if (output < 0)
	{
		putchar('-');
		output = -output;
	}
	int buf[20], n = 0;
	while(output)
	{
		buf[n] = ((output % 10));
		output /= 10;
		n++;
	}
	for (n--; n >= 0; n--)
	{
		putchar(buf[n] + '0');
	}
	return;
}
template<class T>
void ckmin(T &a, T b)
{
	a = min(a, b);
}
template<class T>
void ckmax(T &a, T b)
{
	a = max(a, b);
}
long long expo(long long a, long long e, long long mod)
{
	return ((e == 0) ? 1 : ((expo(a * a % mod, e >> 1, mod)) * ((e & 1) ? a : 1) % mod));
}
template<class T, class U>
void nmod(T &x, U mod)
{
	if (x >= mod) x -= mod;
}
template<class T>
T gcd(T a, T b)
{
	return (b ? gcd(b, a % b) : a);
}

#define y0 ___y0
#define y1 ___y1
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define DBG(x) cerr << #x << " = " << (x) << endl
#define SZ(x) ((int) ((x).size()))
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()

const long double PI = 4.0 * atan(1.0);
const long double EPS = 1e-9;

#define MAGIC 347
#define SINF 10007
#define CO 1000007
#define INF 1000000007
#define BIG 1000000931
#define LARGE 1696969696967ll
#define GIANT 2564008813937411ll
#define LLINF 2696969696969696969ll
#define MAXN 513

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<pii> vpi;
typedef vector<pll> vpl;
typedef vector<pdd> vpd;

int N;
int arr[MAXN];
ll ways[MAXN * MAXN];
int S;
bitset<MAXN * MAXN> ok;
vi ans;

void ins(ll x)
{
	FORD(i, N * MAXN - x + 2, 0)
	{
		ways[i + x] += ways[i];
		nmod(ways[i + x], LLINF);
	}
}
void del(ll x)
{
	FOR(i, 0, N * MAXN - x + 2)
	{
		ways[i + x] -= ways[i];
		ways[i + x] += LLINF;
		nmod(ways[i + x], LLINF);
	}
}

int32_t main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	// cout << fixed << setprecision(10);
	// cerr << fixed << setprecision(10);
	// if (fopen("file.in", "r"))
	// {
	// 	freopen ("file.in", "r", stdin);
	// 	freopen ("file.out", "w", stdout);
	// }
	cin >> N;
	FOR(i, 0, N) cin >> arr[i];
	sort(arr, arr + N);
	FOR(i, 0, N)
	{
		if ((arr[i] + arr[0]) & 1)
		{
			cout << "0\n\n";
			return 0;
		}
		S += arr[i];
	}
	ways[0] = 1;
	FOR(i, 0, N)
	{
		ins(arr[i]);
	}
	if (S & 1 || ways[S / 2] == 0)
	{
		cout << "0\n\n";
		return 0;
	}
	for (int j = ((arr[0] - 1) & 1) + 1; j <= N * MAXN + 1; j += 2)
	{
		ok[j] = 1;
	}
	FOR(i, 0, N)
	{
		del(arr[i]);
		for (int j = ((arr[0] - 1) & 1) + 1; j <= N * MAXN + 1; j += 2)
		{
			if (!ok[j]) continue;
			if (ways[(S - arr[i] + j) / 2] == 0) ok[j] = false;
		}
		ins(arr[i]);
	}
	for (int j = ((arr[0] - 1) & 1) + 1; j <= N * MAXN + 1; j += 2)
	{
		if (ok[j]) ans.PB(j);
	}
	cout << SZ(ans) << '\n';
	FOR(i, 0, SZ(ans))
	{
		if (i) cout << ' ';
		cout << ans[i];
	}
	cout << '\n';
	// cerr << "time elapsed = " << (clock() / (CLOCKS_PER_SEC / 1000)) << " ms" << endl;
	return 0;
}
/* READ READ READ
* int overflow, maxn too small, special cases (n=1?, two distinct?), cin.tie() interactive
* reread the problem, try small cases
* note down possible sources of error as you go
* do smth instead of nothing
*/

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 14 ms 640 KB Output is correct
22 Correct 24 ms 768 KB Output is correct
23 Correct 9 ms 512 KB Output is correct
24 Correct 26 ms 896 KB Output is correct
25 Correct 24 ms 768 KB Output is correct
26 Correct 24 ms 816 KB Output is correct
27 Correct 24 ms 768 KB Output is correct
28 Correct 27 ms 768 KB Output is correct
29 Correct 26 ms 768 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 28 ms 888 KB Output is correct
32 Correct 30 ms 768 KB Output is correct
33 Correct 36 ms 768 KB Output is correct
34 Correct 25 ms 816 KB Output is correct
35 Correct 27 ms 768 KB Output is correct
36 Correct 27 ms 888 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 14 ms 640 KB Output is correct
22 Correct 24 ms 768 KB Output is correct
23 Correct 9 ms 512 KB Output is correct
24 Correct 26 ms 896 KB Output is correct
25 Correct 24 ms 768 KB Output is correct
26 Correct 24 ms 816 KB Output is correct
27 Correct 24 ms 768 KB Output is correct
28 Correct 27 ms 768 KB Output is correct
29 Correct 26 ms 768 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 28 ms 888 KB Output is correct
32 Correct 30 ms 768 KB Output is correct
33 Correct 36 ms 768 KB Output is correct
34 Correct 25 ms 816 KB Output is correct
35 Correct 27 ms 768 KB Output is correct
36 Correct 27 ms 888 KB Output is correct
37 Correct 93 ms 1344 KB Output is correct
38 Correct 100 ms 1272 KB Output is correct
39 Correct 144 ms 1416 KB Output is correct
40 Correct 170 ms 1656 KB Output is correct
41 Correct 190 ms 1528 KB Output is correct
42 Correct 198 ms 1672 KB Output is correct
43 Correct 190 ms 1884 KB Output is correct
44 Correct 158 ms 1884 KB Output is correct
45 Correct 158 ms 1700 KB Output is correct
46 Correct 188 ms 1528 KB Output is correct
47 Correct 163 ms 1672 KB Output is correct
48 Correct 162 ms 1756 KB Output is correct
49 Correct 174 ms 1424 KB Output is correct
50 Correct 153 ms 1760 KB Output is correct
51 Correct 3 ms 384 KB Output is correct
52 Correct 190 ms 1912 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 14 ms 640 KB Output is correct
22 Correct 24 ms 768 KB Output is correct
23 Correct 9 ms 512 KB Output is correct
24 Correct 26 ms 896 KB Output is correct
25 Correct 24 ms 768 KB Output is correct
26 Correct 24 ms 816 KB Output is correct
27 Correct 24 ms 768 KB Output is correct
28 Correct 27 ms 768 KB Output is correct
29 Correct 26 ms 768 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 28 ms 888 KB Output is correct
32 Correct 30 ms 768 KB Output is correct
33 Correct 36 ms 768 KB Output is correct
34 Correct 25 ms 816 KB Output is correct
35 Correct 27 ms 768 KB Output is correct
36 Correct 27 ms 888 KB Output is correct
37 Correct 93 ms 1344 KB Output is correct
38 Correct 100 ms 1272 KB Output is correct
39 Correct 144 ms 1416 KB Output is correct
40 Correct 170 ms 1656 KB Output is correct
41 Correct 190 ms 1528 KB Output is correct
42 Correct 198 ms 1672 KB Output is correct
43 Correct 190 ms 1884 KB Output is correct
44 Correct 158 ms 1884 KB Output is correct
45 Correct 158 ms 1700 KB Output is correct
46 Correct 188 ms 1528 KB Output is correct
47 Correct 163 ms 1672 KB Output is correct
48 Correct 162 ms 1756 KB Output is correct
49 Correct 174 ms 1424 KB Output is correct
50 Correct 153 ms 1760 KB Output is correct
51 Correct 3 ms 384 KB Output is correct
52 Correct 190 ms 1912 KB Output is correct
53 Correct 206 ms 1864 KB Output is correct
54 Correct 309 ms 2324 KB Output is correct
55 Correct 381 ms 2552 KB Output is correct
56 Correct 248 ms 2060 KB Output is correct
57 Correct 330 ms 2424 KB Output is correct
58 Correct 331 ms 2296 KB Output is correct
59 Correct 309 ms 2524 KB Output is correct
60 Correct 2 ms 384 KB Output is correct
61 Correct 288 ms 2552 KB Output is correct
62 Correct 289 ms 2296 KB Output is correct
63 Correct 284 ms 2316 KB Output is correct
64 Correct 254 ms 2320 KB Output is correct
65 Correct 234 ms 1664 KB Output is correct
66 Correct 250 ms 1784 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 5 ms 640 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 5 ms 512 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 4 ms 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 6 ms 512 KB Output is correct
21 Correct 14 ms 640 KB Output is correct
22 Correct 24 ms 768 KB Output is correct
23 Correct 9 ms 512 KB Output is correct
24 Correct 26 ms 896 KB Output is correct
25 Correct 24 ms 768 KB Output is correct
26 Correct 24 ms 816 KB Output is correct
27 Correct 24 ms 768 KB Output is correct
28 Correct 27 ms 768 KB Output is correct
29 Correct 26 ms 768 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 28 ms 888 KB Output is correct
32 Correct 30 ms 768 KB Output is correct
33 Correct 36 ms 768 KB Output is correct
34 Correct 25 ms 816 KB Output is correct
35 Correct 27 ms 768 KB Output is correct
36 Correct 27 ms 888 KB Output is correct
37 Correct 93 ms 1344 KB Output is correct
38 Correct 100 ms 1272 KB Output is correct
39 Correct 144 ms 1416 KB Output is correct
40 Correct 170 ms 1656 KB Output is correct
41 Correct 190 ms 1528 KB Output is correct
42 Correct 198 ms 1672 KB Output is correct
43 Correct 190 ms 1884 KB Output is correct
44 Correct 158 ms 1884 KB Output is correct
45 Correct 158 ms 1700 KB Output is correct
46 Correct 188 ms 1528 KB Output is correct
47 Correct 163 ms 1672 KB Output is correct
48 Correct 162 ms 1756 KB Output is correct
49 Correct 174 ms 1424 KB Output is correct
50 Correct 153 ms 1760 KB Output is correct
51 Correct 3 ms 384 KB Output is correct
52 Correct 190 ms 1912 KB Output is correct
53 Correct 206 ms 1864 KB Output is correct
54 Correct 309 ms 2324 KB Output is correct
55 Correct 381 ms 2552 KB Output is correct
56 Correct 248 ms 2060 KB Output is correct
57 Correct 330 ms 2424 KB Output is correct
58 Correct 331 ms 2296 KB Output is correct
59 Correct 309 ms 2524 KB Output is correct
60 Correct 2 ms 384 KB Output is correct
61 Correct 288 ms 2552 KB Output is correct
62 Correct 289 ms 2296 KB Output is correct
63 Correct 284 ms 2316 KB Output is correct
64 Correct 254 ms 2320 KB Output is correct
65 Correct 234 ms 1664 KB Output is correct
66 Correct 250 ms 1784 KB Output is correct
67 Correct 440 ms 2556 KB Output is correct
68 Correct 217 ms 2432 KB Output is correct
69 Correct 670 ms 3728 KB Output is correct
70 Correct 582 ms 3448 KB Output is correct
71 Correct 606 ms 3088 KB Output is correct
72 Correct 2 ms 384 KB Output is correct
73 Correct 2 ms 384 KB Output is correct
74 Correct 636 ms 3804 KB Output is correct
75 Correct 687 ms 3544 KB Output is correct
76 Correct 651 ms 3724 KB Output is correct
77 Correct 683 ms 3700 KB Output is correct