oj.uz

Submission #957874

# Submission time Handle Problem Language Result Execution time Memory
957874 2024-04-04T12:41:11 Z hocln Bali Sculptures (APIO15_sculpture) C++17
71 / 100
 1000 ms 700 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(v) v.begin(), v.end()
#define logg(x) (31 - __builtin_clz(x))
#define llogg(x) (63 - __builtin_clzll(x))
#define mini(v) min_element(v.begin(), v.end())
#define maxi(v) max_element(v.begin(), v.end())
#define TIME cerr << double(clock() - st) / (double)CLOCKS_PER_SEC
#define sq(a) ((a)*(a))
#ifdef hocln
#include "deb.h"
#else
#define imie(...) ""
#define debug() cerr
#endif
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef long double ld;
typedef tuple<ll, ll, ll> triple;
typedef tuple<ll, ll, ll, ll, ll> five;
typedef unsigned long long ull;
const long long INF = 4e18;
const int inf = 2e9;
const int MN = 3e5 + 15;
const int MX = 2e6 + 15;
//const long long MOD = 1e9 + 7;
//const long long MOD = 998244353;
const long double PI = 3.141592653589793238462643383279502884197;
template<typename T, typename T2> bool chmax(T& a, const T2& b) { return a < b ? a = b, 1 : 0; }
template<typename T, typename T2> bool chmin(T& a, const T2& b) { return a > b ? a = b, 1 : 0; }
template<typename T> using vector2 = vector<vector<T>>;
const int dx[] = { 0, 0, 1, -1, 1, 1, -1, -1 };
const int dy[] = { 1, -1, 0, 0 , 1, -1, 1, -1};
std::random_device rd;
std::mt19937 gen(rd());
ll random(ll low, ll high) { uniform_int_distribution<> dist(low, high); return dist(gen); }
template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p) {
    is >> p.first;
    return is >> p.second;
}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (auto &i: v) os << i << ' ';
    return os;
}
int tc = 0;
// I hate cp
inline void solve_test() {
	ll n, a, b;
	cin >> n >> a >> b;
	vector<ll>v(n+1);
	for(int i = 1;i <= n;i++) cin >> v[i];
	auto valid = [&](ll msk) {
		bool dp[n+1][n+1];
		memset(dp, 0, sizeof dp);
		dp[0][0] = 1;
		for(int i = 1;i <= n;i++) {
			for(int k = 0;k < n;k++) {
				ll sum = 0;
				for(int j = i;j > 0;j--) {
					sum += v[j];
					if((sum& msk) != sum) continue;
					dp[i][k+1] |= dp[j-1][k];
				}
			}
		}
		bool ok = false;
		for(int i = a;i <= b;i++) ok |= dp[n][i];
		return ok;
	};
	ll msk = 0;
	for(int i = 60;i >= 0;i--) {
		if(valid(msk ^ ((1LL << i) - 1))) continue;
		msk ^= 1LL << i;
	}
	cout << msk;
}

int main()
{
    //srand(chrono::steady_clock::now().time_since_epoch().count());
    //freopen("convention2.in", "r", stdin);
    //freopen("convention2.out", "w", stdout);
	//cout << "Case #" << tc << ": " << ans << '\n';
	//cout << fixed << setprecision(4);
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
		++tc;
        solve_test();
    }
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 428 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 6 ms 348 KB Output is correct
20 Correct 6 ms 348 KB Output is correct
21 Correct 7 ms 460 KB Output is correct
22 Correct 6 ms 468 KB Output is correct
23 Correct 6 ms 600 KB Output is correct
24 Correct 6 ms 348 KB Output is correct
25 Correct 14 ms 464 KB Output is correct
26 Correct 26 ms 348 KB Output is correct
27 Correct 39 ms 344 KB Output is correct
28 Correct 53 ms 348 KB Output is correct
29 Correct 52 ms 448 KB Output is correct
30 Correct 52 ms 344 KB Output is correct
31 Correct 53 ms 356 KB Output is correct
32 Correct 52 ms 348 KB Output is correct

Subtask #4
25.0 / 25.0

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

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 436 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 3 ms 348 KB Output is correct
27 Correct 4 ms 348 KB Output is correct
28 Correct 6 ms 348 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 6 ms 348 KB Output is correct
31 Correct 6 ms 348 KB Output is correct
32 Correct 7 ms 472 KB Output is correct
33 Correct 6 ms 348 KB Output is correct
34 Correct 7 ms 468 KB Output is correct
35 Correct 14 ms 348 KB Output is correct
36 Correct 24 ms 348 KB Output is correct
37 Correct 39 ms 348 KB Output is correct
38 Correct 52 ms 452 KB Output is correct
39 Correct 52 ms 344 KB Output is correct
40 Correct 58 ms 348 KB Output is correct
41 Correct 53 ms 344 KB Output is correct
42 Correct 52 ms 448 KB Output is correct
43 Correct 7 ms 348 KB Output is correct
44 Correct 22 ms 348 KB Output is correct
45 Correct 30 ms 344 KB Output is correct
46 Correct 39 ms 348 KB Output is correct
47 Correct 39 ms 700 KB Output is correct
48 Correct 39 ms 348 KB Output is correct
49 Correct 41 ms 348 KB Output is correct
50 Correct 40 ms 348 KB Output is correct
51 Correct 40 ms 348 KB Output is correct
52 Execution timed out 1010 ms 600 KB Time limit exceeded
53 Halted 0 ms 0 KB -