답안 #349520

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
349520	2021-01-17T17:42:16 Z	AmineWeslati	Bali Sculptures (APIO15_sculpture)	C++14	71 / 100	714 ms	876 KB

sculpture

//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 150 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}

#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

const int LOG=50;
int N,A,B;
vi a(MX),vis(LOG,-1);
int memo[MX][MX];

bool check(int x){
	bitset<LOG>b(x);
	FOR(i,0,LOG) if(vis[i]==0 && b[i]) return 0;
	return 1;
}

int solve(int i, int n){
	if(i==N){
		if(!(n>=A && n<=B)) return 0;
		return 1;
	}

	int &ind=memo[i][n];
	if(ind!=-1) return ind;
	int ans=0,cur=0;
	FOR(j,i,N){
		cur+=a[j];
		if(check(cur)) ans|=solve(j+1,n+1);
	}
	return ind=ans;
}

int32_t main() {
    boost; IO();

    cin>>N>>A>>B;
    FOR(i,0,N) cin>>a[i];

    ROF(i,0,LOG){
    	vis[i]=0;
    	memset(memo,-1,sizeof(memo));
    	if(!solve(0,0)) vis[i]=1;
    }

    int ans=0;
    ROF(i,0,LOG){
    	ans*=2;
    	ans+=vis[i];
    }
    cout << ans << endl;
    

    return 0;
}

/* Careful!!!
    .Array bounds
    .Infinite loops
    .Uninitialized variables / empty containers
    .Multisets are shit

   Some insights:
    .Binary search
    .Graph representation
    .Write brute force code
    .Change your approach
*/

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	640 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	4 ms	492 KB	Output is correct
7	Correct	5 ms	492 KB	Output is correct
8	Correct	7 ms	492 KB	Output is correct
9	Correct	7 ms	492 KB	Output is correct
10	Correct	7 ms	492 KB	Output is correct
11	Correct	7 ms	492 KB	Output is correct
12	Correct	8 ms	620 KB	Output is correct
13	Correct	7 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	2 ms	492 KB	Output is correct
19	Correct	4 ms	492 KB	Output is correct
20	Correct	5 ms	492 KB	Output is correct
21	Correct	7 ms	492 KB	Output is correct
22	Correct	7 ms	492 KB	Output is correct
23	Correct	10 ms	492 KB	Output is correct
24	Correct	8 ms	492 KB	Output is correct
25	Correct	7 ms	492 KB	Output is correct
26	Correct	7 ms	492 KB	Output is correct
27	Correct	1 ms	492 KB	Output is correct
28	Correct	1 ms	492 KB	Output is correct
29	Correct	2 ms	492 KB	Output is correct
30	Correct	4 ms	492 KB	Output is correct
31	Correct	4 ms	492 KB	Output is correct
32	Correct	3 ms	512 KB	Output is correct
33	Correct	6 ms	492 KB	Output is correct
34	Correct	5 ms	492 KB	Output is correct
35	Correct	7 ms	492 KB	Output is correct
36	Correct	6 ms	492 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	4 ms	492 KB	Output is correct
7	Correct	5 ms	492 KB	Output is correct
8	Correct	7 ms	492 KB	Output is correct
9	Correct	7 ms	492 KB	Output is correct
10	Correct	7 ms	492 KB	Output is correct
11	Correct	7 ms	492 KB	Output is correct
12	Correct	7 ms	492 KB	Output is correct
13	Correct	7 ms	492 KB	Output is correct
14	Correct	2 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	2 ms	492 KB	Output is correct
19	Correct	4 ms	492 KB	Output is correct
20	Correct	5 ms	512 KB	Output is correct
21	Correct	7 ms	492 KB	Output is correct
22	Correct	7 ms	492 KB	Output is correct
23	Correct	7 ms	492 KB	Output is correct
24	Correct	7 ms	492 KB	Output is correct
25	Correct	7 ms	492 KB	Output is correct
26	Correct	7 ms	492 KB	Output is correct
27	Correct	8 ms	492 KB	Output is correct
28	Correct	20 ms	492 KB	Output is correct
29	Correct	50 ms	492 KB	Output is correct
30	Correct	57 ms	604 KB	Output is correct
31	Correct	95 ms	492 KB	Output is correct
32	Correct	92 ms	492 KB	Output is correct
33	Correct	93 ms	600 KB	Output is correct
34	Correct	93 ms	620 KB	Output is correct
35	Correct	92 ms	600 KB	Output is correct
36	Correct	126 ms	492 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	4 ms	492 KB	Output is correct
7	Correct	5 ms	492 KB	Output is correct
8	Correct	7 ms	492 KB	Output is correct
9	Correct	7 ms	492 KB	Output is correct
10	Correct	7 ms	492 KB	Output is correct
11	Correct	7 ms	492 KB	Output is correct
12	Correct	7 ms	492 KB	Output is correct
13	Correct	7 ms	492 KB	Output is correct
14	Correct	8 ms	492 KB	Output is correct
15	Correct	13 ms	492 KB	Output is correct
16	Correct	41 ms	492 KB	Output is correct
17	Correct	55 ms	492 KB	Output is correct
18	Correct	130 ms	492 KB	Output is correct
19	Correct	90 ms	620 KB	Output is correct
20	Correct	138 ms	492 KB	Output is correct
21	Correct	91 ms	492 KB	Output is correct
22	Correct	91 ms	492 KB	Output is correct
23	Correct	92 ms	620 KB	Output is correct
24	Correct	94 ms	492 KB	Output is correct
25	Correct	193 ms	492 KB	Output is correct
26	Correct	336 ms	620 KB	Output is correct
27	Correct	521 ms	492 KB	Output is correct
28	Correct	692 ms	620 KB	Output is correct
29	Correct	680 ms	620 KB	Output is correct
30	Correct	714 ms	620 KB	Output is correct
31	Correct	705 ms	620 KB	Output is correct
32	Correct	686 ms	732 KB	Output is correct

Subtask #4
25.0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	2 ms	492 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	4 ms	492 KB	Output is correct
7	Correct	5 ms	492 KB	Output is correct
8	Correct	7 ms	492 KB	Output is correct
9	Correct	7 ms	492 KB	Output is correct
10	Correct	8 ms	620 KB	Output is correct
11	Correct	7 ms	492 KB	Output is correct
12	Correct	7 ms	492 KB	Output is correct
13	Correct	7 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	1 ms	492 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	2 ms	492 KB	Output is correct
19	Correct	4 ms	492 KB	Output is correct
20	Correct	5 ms	492 KB	Output is correct
21	Correct	7 ms	492 KB	Output is correct
22	Correct	7 ms	640 KB	Output is correct
23	Correct	7 ms	492 KB	Output is correct
24	Correct	7 ms	492 KB	Output is correct
25	Correct	7 ms	492 KB	Output is correct
26	Correct	7 ms	492 KB	Output is correct
27	Correct	1 ms	492 KB	Output is correct
28	Correct	1 ms	492 KB	Output is correct
29	Correct	2 ms	492 KB	Output is correct
30	Correct	4 ms	492 KB	Output is correct
31	Correct	4 ms	492 KB	Output is correct
32	Correct	4 ms	492 KB	Output is correct
33	Correct	6 ms	496 KB	Output is correct
34	Correct	5 ms	492 KB	Output is correct
35	Correct	6 ms	492 KB	Output is correct
36	Correct	6 ms	492 KB	Output is correct
37	Correct	8 ms	492 KB	Output is correct
38	Correct	13 ms	492 KB	Output is correct
39	Correct	41 ms	492 KB	Output is correct
40	Correct	55 ms	620 KB	Output is correct
41	Correct	90 ms	620 KB	Output is correct
42	Correct	90 ms	492 KB	Output is correct
43	Correct	92 ms	620 KB	Output is correct
44	Correct	91 ms	492 KB	Output is correct
45	Correct	93 ms	620 KB	Output is correct
46	Correct	92 ms	492 KB	Output is correct
47	Correct	95 ms	492 KB	Output is correct
48	Correct	194 ms	492 KB	Output is correct
49	Correct	339 ms	620 KB	Output is correct
50	Correct	523 ms	620 KB	Output is correct
51	Correct	690 ms	620 KB	Output is correct
52	Correct	680 ms	636 KB	Output is correct
53	Correct	707 ms	620 KB	Output is correct
54	Correct	696 ms	620 KB	Output is correct
55	Correct	688 ms	620 KB	Output is correct
56	Correct	41 ms	492 KB	Output is correct
57	Correct	155 ms	492 KB	Output is correct
58	Correct	223 ms	620 KB	Output is correct
59	Correct	291 ms	620 KB	Output is correct
60	Correct	280 ms	492 KB	Output is correct
61	Correct	304 ms	620 KB	Output is correct
62	Correct	330 ms	492 KB	Output is correct
63	Correct	350 ms	612 KB	Output is correct
64	Correct	543 ms	492 KB	Output is correct
65	Correct	43 ms	492 KB	Output is correct
66	Correct	92 ms	492 KB	Output is correct
67	Correct	145 ms	492 KB	Output is correct
68	Correct	231 ms	492 KB	Output is correct
69	Correct	298 ms	492 KB	Output is correct
70	Correct	281 ms	492 KB	Output is correct
71	Correct	306 ms	492 KB	Output is correct
72	Correct	333 ms	492 KB	Output is correct
73	Correct	338 ms	620 KB	Output is correct
74	Correct	338 ms	492 KB	Output is correct

Subtask #5
0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	1 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	2 ms	492 KB	Output is correct
6	Correct	4 ms	492 KB	Output is correct
7	Correct	5 ms	492 KB	Output is correct
8	Correct	7 ms	492 KB	Output is correct
9	Correct	7 ms	492 KB	Output is correct
10	Correct	7 ms	492 KB	Output is correct
11	Correct	7 ms	492 KB	Output is correct
12	Correct	7 ms	492 KB	Output is correct
13	Correct	7 ms	492 KB	Output is correct
14	Correct	1 ms	492 KB	Output is correct
15	Correct	1 ms	492 KB	Output is correct
16	Correct	2 ms	492 KB	Output is correct
17	Correct	4 ms	492 KB	Output is correct
18	Correct	4 ms	512 KB	Output is correct
19	Correct	3 ms	492 KB	Output is correct
20	Correct	5 ms	492 KB	Output is correct
21	Correct	7 ms	492 KB	Output is correct
22	Correct	6 ms	492 KB	Output is correct
23	Correct	8 ms	492 KB	Output is correct
24	Correct	9 ms	492 KB	Output is correct
25	Correct	15 ms	492 KB	Output is correct
26	Correct	44 ms	492 KB	Output is correct
27	Correct	57 ms	620 KB	Output is correct
28	Correct	91 ms	732 KB	Output is correct
29	Correct	102 ms	492 KB	Output is correct
30	Correct	93 ms	492 KB	Output is correct
31	Correct	95 ms	492 KB	Output is correct
32	Correct	92 ms	620 KB	Output is correct
33	Correct	92 ms	492 KB	Output is correct
34	Correct	95 ms	492 KB	Output is correct
35	Correct	196 ms	620 KB	Output is correct
36	Correct	338 ms	492 KB	Output is correct
37	Correct	527 ms	620 KB	Output is correct
38	Correct	693 ms	608 KB	Output is correct
39	Correct	682 ms	640 KB	Output is correct
40	Correct	706 ms	492 KB	Output is correct
41	Correct	697 ms	492 KB	Output is correct
42	Correct	687 ms	608 KB	Output is correct
43	Correct	41 ms	492 KB	Output is correct
44	Correct	158 ms	620 KB	Output is correct
45	Correct	222 ms	492 KB	Output is correct
46	Correct	291 ms	492 KB	Output is correct
47	Correct	291 ms	492 KB	Output is correct
48	Correct	306 ms	492 KB	Output is correct
49	Correct	334 ms	492 KB	Output is correct
50	Correct	350 ms	492 KB	Output is correct
51	Correct	320 ms	492 KB	Output is correct
52	Runtime error	2 ms	876 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
53	Halted	0 ms	0 KB	-

답안 #349520

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 25.0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
9.0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
25.0 / 25.0

Subtask #5
0 / 29.0