Submission #349518

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
349518	2021-01-17T17:39:27 Z	AmineWeslati	Bali Sculptures (APIO15_sculpture)	C++14	37 / 100	203 ms	640 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=31;
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
0 / 9.0

#	Verdict	Execution time	Memory	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	1 ms	492 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	3 ms	492 KB	Output is correct
9	Correct	3 ms	492 KB	Output is correct
10	Correct	3 ms	492 KB	Output is correct
11	Correct	3 ms	492 KB	Output is correct
12	Correct	3 ms	492 KB	Output is correct
13	Correct	3 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	1 ms	492 KB	Output is correct
19	Correct	2 ms	492 KB	Output is correct
20	Correct	2 ms	492 KB	Output is correct
21	Correct	3 ms	512 KB	Output is correct
22	Correct	3 ms	512 KB	Output is correct
23	Correct	3 ms	492 KB	Output is correct
24	Correct	3 ms	512 KB	Output is correct
25	Correct	3 ms	492 KB	Output is correct
26	Correct	3 ms	492 KB	Output is correct
27	Incorrect	1 ms	492 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	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	1 ms	492 KB	Output is correct
6	Correct	2 ms	512 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	3 ms	492 KB	Output is correct
9	Correct	3 ms	492 KB	Output is correct
10	Correct	3 ms	492 KB	Output is correct
11	Correct	3 ms	512 KB	Output is correct
12	Correct	3 ms	492 KB	Output is correct
13	Correct	3 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	1 ms	492 KB	Output is correct
19	Correct	2 ms	492 KB	Output is correct
20	Correct	2 ms	492 KB	Output is correct
21	Correct	3 ms	512 KB	Output is correct
22	Correct	3 ms	492 KB	Output is correct
23	Correct	3 ms	504 KB	Output is correct
24	Correct	4 ms	492 KB	Output is correct
25	Correct	3 ms	492 KB	Output is correct
26	Correct	3 ms	492 KB	Output is correct
27	Correct	3 ms	492 KB	Output is correct
28	Correct	4 ms	492 KB	Output is correct
29	Correct	12 ms	512 KB	Output is correct
30	Correct	16 ms	492 KB	Output is correct
31	Correct	26 ms	492 KB	Output is correct
32	Correct	29 ms	620 KB	Output is correct
33	Correct	27 ms	492 KB	Output is correct
34	Correct	27 ms	620 KB	Output is correct
35	Correct	26 ms	512 KB	Output is correct
36	Correct	27 ms	492 KB	Output is correct

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	0 ms	492 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	3 ms	492 KB	Output is correct
9	Correct	3 ms	492 KB	Output is correct
10	Correct	3 ms	492 KB	Output is correct
11	Correct	3 ms	492 KB	Output is correct
12	Correct	3 ms	492 KB	Output is correct
13	Correct	3 ms	492 KB	Output is correct
14	Correct	3 ms	492 KB	Output is correct
15	Correct	4 ms	492 KB	Output is correct
16	Correct	12 ms	492 KB	Output is correct
17	Correct	18 ms	492 KB	Output is correct
18	Correct	31 ms	492 KB	Output is correct
19	Correct	26 ms	640 KB	Output is correct
20	Correct	27 ms	492 KB	Output is correct
21	Correct	26 ms	492 KB	Output is correct
22	Correct	28 ms	492 KB	Output is correct
23	Correct	30 ms	492 KB	Output is correct
24	Correct	27 ms	492 KB	Output is correct
25	Correct	54 ms	492 KB	Output is correct
26	Correct	91 ms	492 KB	Output is correct
27	Correct	141 ms	492 KB	Output is correct
28	Correct	191 ms	620 KB	Output is correct
29	Correct	203 ms	492 KB	Output is correct
30	Correct	194 ms	492 KB	Output is correct
31	Correct	189 ms	620 KB	Output is correct
32	Correct	183 ms	492 KB	Output is correct

Subtask #4
0 / 25.0

#	Verdict	Execution time	Memory	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	2 ms	492 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	3 ms	492 KB	Output is correct
9	Correct	3 ms	492 KB	Output is correct
10	Correct	3 ms	492 KB	Output is correct
11	Correct	3 ms	492 KB	Output is correct
12	Correct	3 ms	492 KB	Output is correct
13	Correct	3 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	1 ms	492 KB	Output is correct
19	Correct	2 ms	492 KB	Output is correct
20	Correct	2 ms	492 KB	Output is correct
21	Correct	3 ms	492 KB	Output is correct
22	Correct	3 ms	492 KB	Output is correct
23	Correct	3 ms	492 KB	Output is correct
24	Correct	3 ms	492 KB	Output is correct
25	Correct	3 ms	492 KB	Output is correct
26	Correct	3 ms	492 KB	Output is correct
27	Incorrect	1 ms	492 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #5
0 / 29.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Correct	1 ms	536 KB	Output is correct
4	Correct	1 ms	492 KB	Output is correct
5	Correct	1 ms	492 KB	Output is correct
6	Correct	2 ms	492 KB	Output is correct
7	Correct	2 ms	492 KB	Output is correct
8	Correct	3 ms	492 KB	Output is correct
9	Correct	3 ms	492 KB	Output is correct
10	Correct	3 ms	492 KB	Output is correct
11	Correct	3 ms	492 KB	Output is correct
12	Correct	3 ms	492 KB	Output is correct
13	Correct	3 ms	492 KB	Output is correct
14	Incorrect	1 ms	492 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Submission #349518

Compilation message

Subtask #1 0 / 9.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 0 / 29.0

Subtask #1
0 / 9.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
0 / 29.0