Submission #446252

# Submission time Handle Problem Language Result Execution time Memory
446252 2021-07-21T10:59:24 Z kym Bali Sculptures (APIO15_sculpture) C++14
50 / 100
595 ms 452 KB
#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#define reach 
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = -1;
int n,a,b;
int dp[2005], A[2005];
int sum[2005];
int rsq(int x, int y) { return sum[y] - sum[x-1]; }
//dp[index][groups] but we ABUSE it to store the minimum groups to get to index
int32_t main() 
{
	IAMSPEED
	cin >> n >> a >> b;
	FOR(i,1,n) cin>> A[i];
	FOR(i,1,n) sum[i] = sum[i-1] + A[i];
	vector<int> disabled;
	int ans = 0;
	DEC(bit,42,0) {
		//db(bit);
		disabled.pb(bit);
		FOR(i,0,n)dp[i]=inf;
		dp[0] = 0;
		FOR(i,1,n) {
			FOR(j,0,i-1) {
				int s=rsq(j+1,i);
				//db(s);
				for(auto b:disabled) {
					//db(b);
					if(s&(1ll<<b))goto riedusg;
				}
				//db(s);
				chmin(dp[i], dp[j]+1);
				riedusg:;
			}
			
			
		//dba(dp,0,n);
		}
		if(dp[n] > b) {
			ans|=(1ll<<bit);
			disabled.pop_back();
		}
	}
	cout << ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Incorrect 1 ms 204 KB Output isn't correct
16 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 316 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 316 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Incorrect 1 ms 332 KB Output isn't correct
16 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 324 KB Output is correct
17 Correct 2 ms 204 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 2 ms 324 KB Output is correct
22 Correct 2 ms 332 KB Output is correct
23 Correct 2 ms 332 KB Output is correct
24 Correct 2 ms 204 KB Output is correct
25 Correct 3 ms 204 KB Output is correct
26 Correct 4 ms 204 KB Output is correct
27 Correct 5 ms 204 KB Output is correct
28 Correct 6 ms 328 KB Output is correct
29 Correct 6 ms 204 KB Output is correct
30 Correct 6 ms 320 KB Output is correct
31 Correct 7 ms 328 KB Output is correct
32 Correct 6 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Incorrect 1 ms 204 KB Output isn't correct
16 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 316 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 2 ms 204 KB Output is correct
28 Correct 3 ms 332 KB Output is correct
29 Correct 2 ms 332 KB Output is correct
30 Correct 2 ms 324 KB Output is correct
31 Correct 2 ms 204 KB Output is correct
32 Correct 2 ms 204 KB Output is correct
33 Correct 2 ms 204 KB Output is correct
34 Correct 2 ms 204 KB Output is correct
35 Correct 3 ms 204 KB Output is correct
36 Correct 4 ms 292 KB Output is correct
37 Correct 5 ms 332 KB Output is correct
38 Correct 6 ms 324 KB Output is correct
39 Correct 6 ms 204 KB Output is correct
40 Correct 6 ms 332 KB Output is correct
41 Correct 6 ms 328 KB Output is correct
42 Correct 6 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 2 ms 204 KB Output is correct
45 Correct 3 ms 204 KB Output is correct
46 Correct 3 ms 332 KB Output is correct
47 Correct 4 ms 204 KB Output is correct
48 Correct 4 ms 204 KB Output is correct
49 Correct 3 ms 204 KB Output is correct
50 Correct 3 ms 204 KB Output is correct
51 Correct 3 ms 204 KB Output is correct
52 Correct 62 ms 328 KB Output is correct
53 Correct 102 ms 332 KB Output is correct
54 Correct 173 ms 344 KB Output is correct
55 Correct 173 ms 332 KB Output is correct
56 Correct 595 ms 360 KB Output is correct
57 Correct 592 ms 452 KB Output is correct
58 Correct 514 ms 360 KB Output is correct
59 Correct 563 ms 452 KB Output is correct
60 Correct 467 ms 384 KB Output is correct
61 Correct 3 ms 204 KB Output is correct
62 Correct 103 ms 332 KB Output is correct
63 Correct 169 ms 332 KB Output is correct
64 Correct 163 ms 332 KB Output is correct
65 Correct 299 ms 356 KB Output is correct
66 Correct 443 ms 368 KB Output is correct
67 Correct 488 ms 372 KB Output is correct
68 Correct 557 ms 452 KB Output is correct
69 Correct 568 ms 452 KB Output is correct