oj.uz

Submission #636206

# Submission time Handle Problem Language Result Execution time Memory
636206 2022-08-28T13:57:16 Z ghostwriter Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 87 ms 448 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
    Tran The Bao
    CTL - Da Lat
    Cay ngay cay dem nhung deo duoc cong nhan
*/
const int NMAX = 2001;
int n, a, b, y[NMAX];
namespace subtask1234 {
	const int N = 101;
	int d[N][N]; 
	void solve() {
		ll ans = (1LL << 37) - 1;
		FOS(x, 36, 0) {
			ans ^= 1LL << x;
			FOR(i, 1, n) d[0][i] = 0;
			d[0][0] = 1;
			FOR(i, 1, n)
			FOR(j, 0, n) {
				d[i][j] = 0;
				ll sum = 0;
				FOS(z, i, 1) {
					sum += y[z];
					if ((sum | ans) == ans && j) d[i][j] = d[i][j] || d[z - 1][j - 1];
				}
			}
			bool ok = 0;
			FOR(i, a, b) ok = ok || d[n][i];
			if (!ok) ans ^= 1LL << x;
		}
		cout << ans;
	}
}
namespace subtask5 {
	const int N = 2001;
	int d[N];
	void solve() {
		ll ans = (1LL << 41) - 1;
		FOS(x, 40, 0) {
			ans ^= 1LL << x;
			d[0] = 0;
			FOR(i, 1, n) {
				d[i] = n + 1;
				ll sum = 0;
				FOS(j, i, 1) {
					sum += y[j];
					if ((sum | ans) == ans) d[i] = min(d[i], d[j - 1] + 1);
				}
			}
			if (d[n] > b) ans ^= 1LL << x;
		}
		cout << ans;
	}
}
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
	cin >> n >> a >> b;
	FOR(i, 1, n) cin >> y[i];
	if (n <= 100) {
		subtask1234::solve();
		return 0;
	}
	subtask5::solve();
    return 0;
}
/*
6 1 3
8 1 2 1 5 4
*/

Compilation message

sculpture.cpp: In function 'void subtask1234::solve()':
sculpture.cpp:25:31: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   25 | #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
      |                               ^
sculpture.cpp:43:3: note: in expansion of macro 'FOS'
   43 |   FOS(x, 36, 0) {
      |   ^~~
sculpture.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sculpture.cpp:45:4: note: in expansion of macro 'FOR'
   45 |    FOR(i, 1, n) d[0][i] = 0;
      |    ^~~
sculpture.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sculpture.cpp:47:4: note: in expansion of macro 'FOR'
   47 |    FOR(i, 1, n)
      |    ^~~
sculpture.cpp:24:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sculpture.cpp:48:4: note: in expansion of macro 'FOR'
   48 |    FOR(j, 0, n) {
      |    ^~~
sculpture.cpp:25:31: warning: unnecessary parentheses in declaration of 'z' [-Wparentheses]
   25 | #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
      |                               ^
sculpture.cpp:51:5: note: in expansion of macro 'FOS'
   51 |     FOS(z, i, 1) {
      |     ^~~
sculpture.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sculpture.cpp:57:4: note: in expansion of macro 'FOR'
   57 |    FOR(i, a, b) ok = ok || d[n][i];
      |    ^~~
sculpture.cpp: In function 'void subtask5::solve()':
sculpture.cpp:25:31: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   25 | #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
      |                               ^
sculpture.cpp:68:3: note: in expansion of macro 'FOS'
   68 |   FOS(x, 40, 0) {
      |   ^~~
sculpture.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sculpture.cpp:71:4: note: in expansion of macro 'FOR'
   71 |    FOR(i, 1, n) {
      |    ^~~
sculpture.cpp:25:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   25 | #define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
      |                               ^
sculpture.cpp:74:5: note: in expansion of macro 'FOS'
   74 |     FOS(j, i, 1) {
      |     ^~~
sculpture.cpp: In function 'int main()':
sculpture.cpp:24:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   24 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
sculpture.cpp:89:2: note: in expansion of macro 'FOR'
   89 |  FOR(i, 1, n) cin >> y[i];
      |  ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 272 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 328 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 1 ms 328 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 3 ms 340 KB Output is correct
30 Correct 3 ms 340 KB Output is correct
31 Correct 5 ms 324 KB Output is correct
32 Correct 5 ms 340 KB Output is correct
33 Correct 4 ms 324 KB Output is correct
34 Correct 4 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 4 ms 340 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 3 ms 328 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 5 ms 340 KB Output is correct
21 Correct 4 ms 340 KB Output is correct
22 Correct 4 ms 340 KB Output is correct
23 Correct 4 ms 340 KB Output is correct
24 Correct 4 ms 324 KB Output is correct
25 Correct 8 ms 340 KB Output is correct
26 Correct 14 ms 340 KB Output is correct
27 Correct 20 ms 340 KB Output is correct
28 Correct 27 ms 340 KB Output is correct
29 Correct 25 ms 340 KB Output is correct
30 Correct 27 ms 340 KB Output is correct
31 Correct 27 ms 352 KB Output is correct
32 Correct 32 ms 448 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 328 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 324 KB Output is correct
35 Correct 1 ms 356 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 324 KB Output is correct
39 Correct 2 ms 340 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 7 ms 340 KB Output is correct
42 Correct 4 ms 340 KB Output is correct
43 Correct 6 ms 360 KB Output is correct
44 Correct 4 ms 340 KB Output is correct
45 Correct 5 ms 328 KB Output is correct
46 Correct 4 ms 340 KB Output is correct
47 Correct 5 ms 356 KB Output is correct
48 Correct 8 ms 360 KB Output is correct
49 Correct 13 ms 340 KB Output is correct
50 Correct 22 ms 364 KB Output is correct
51 Correct 27 ms 324 KB Output is correct
52 Correct 36 ms 364 KB Output is correct
53 Correct 28 ms 340 KB Output is correct
54 Correct 28 ms 368 KB Output is correct
55 Correct 35 ms 340 KB Output is correct
56 Correct 3 ms 340 KB Output is correct
57 Correct 10 ms 352 KB Output is correct
58 Correct 14 ms 340 KB Output is correct
59 Correct 19 ms 372 KB Output is correct
60 Correct 20 ms 372 KB Output is correct
61 Correct 19 ms 368 KB Output is correct
62 Correct 21 ms 376 KB Output is correct
63 Correct 27 ms 360 KB Output is correct
64 Correct 28 ms 340 KB Output is correct
65 Correct 4 ms 328 KB Output is correct
66 Correct 6 ms 340 KB Output is correct
67 Correct 10 ms 340 KB Output is correct
68 Correct 15 ms 340 KB Output is correct
69 Correct 19 ms 276 KB Output is correct
70 Correct 19 ms 376 KB Output is correct
71 Correct 20 ms 372 KB Output is correct
72 Correct 20 ms 368 KB Output is correct
73 Correct 20 ms 340 KB Output is correct
74 Correct 21 ms 368 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 216 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 328 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 248 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 324 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 324 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 4 ms 256 KB Output is correct
29 Correct 4 ms 328 KB Output is correct
30 Correct 4 ms 328 KB Output is correct
31 Correct 4 ms 340 KB Output is correct
32 Correct 5 ms 332 KB Output is correct
33 Correct 5 ms 352 KB Output is correct
34 Correct 5 ms 340 KB Output is correct
35 Correct 8 ms 356 KB Output is correct
36 Correct 14 ms 368 KB Output is correct
37 Correct 20 ms 340 KB Output is correct
38 Correct 27 ms 328 KB Output is correct
39 Correct 27 ms 356 KB Output is correct
40 Correct 38 ms 352 KB Output is correct
41 Correct 28 ms 340 KB Output is correct
42 Correct 27 ms 340 KB Output is correct
43 Correct 3 ms 328 KB Output is correct
44 Correct 11 ms 328 KB Output is correct
45 Correct 22 ms 340 KB Output is correct
46 Correct 25 ms 352 KB Output is correct
47 Correct 26 ms 332 KB Output is correct
48 Correct 19 ms 340 KB Output is correct
49 Correct 27 ms 340 KB Output is correct
50 Correct 25 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 11 ms 340 KB Output is correct
53 Correct 12 ms 348 KB Output is correct
54 Correct 23 ms 340 KB Output is correct
55 Correct 22 ms 340 KB Output is correct
56 Correct 75 ms 348 KB Output is correct
57 Correct 84 ms 340 KB Output is correct
58 Correct 66 ms 340 KB Output is correct
59 Correct 65 ms 340 KB Output is correct
60 Correct 78 ms 340 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 18 ms 340 KB Output is correct
63 Correct 24 ms 336 KB Output is correct
64 Correct 20 ms 340 KB Output is correct
65 Correct 36 ms 340 KB Output is correct
66 Correct 54 ms 356 KB Output is correct
67 Correct 72 ms 360 KB Output is correct
68 Correct 86 ms 344 KB Output is correct
69 Correct 87 ms 360 KB Output is correct