답안 #349790

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
349790	2021-01-18T12:10:20 Z	AmineWeslati	Bali Sculptures (APIO15_sculpture)	C++14	21 / 100	141 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=50;
int N,A,B;
vi a(MX),vis(LOG,-1);
int memo[MX][MX],memo2[MX];

bool check(int x){
	bitset<LOG>b(x);
	FOR(i,0,LOG) if(!vis[i] && 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;
}

int solve2(int i){
    if(i==N) return 0;
    if(memo2[i]!=-1) return memo2[i];
    int ans=INF,cur=0;
    FOR(j,i,N){
        cur+=a[j];
        if(check(cur)) ckmin(ans,solve2(j+1)+1);
    }
    return memo2[i]=ans;
}

int32_t main() {
    boost; IO();

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

    if(0){
        ROF(i,0,LOG){
        	vis[i]=0;
        	memset(memo,-1,sizeof(memo));
        	if(!solve(0,0)) vis[i]=1;
        }
    }
    else{
        ROF(i,0,LOG){
            vis[i]=0;
            memset(memo2,-1,sizeof(memo2));
            if(solve2(0)>B) 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

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Incorrect	1 ms	364 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Incorrect	1 ms	364 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3

21.0 / 21.0

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

Subtask #4

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	512 KB	Output is correct
3	Correct	1 ms	416 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	2 ms	416 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	2 ms	412 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	2 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Incorrect	1 ms	364 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5

0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	492 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	2 ms	364 KB	Output is correct
11	Correct	2 ms	364 KB	Output is correct
12	Correct	2 ms	364 KB	Output is correct
13	Correct	2 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	2 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	2 ms	364 KB	Output is correct
23	Correct	1 ms	236 KB	Output is correct
24	Correct	2 ms	364 KB	Output is correct
25	Correct	2 ms	364 KB	Output is correct
26	Correct	4 ms	364 KB	Output is correct
27	Correct	8 ms	364 KB	Output is correct
28	Correct	6 ms	364 KB	Output is correct
29	Correct	6 ms	364 KB	Output is correct
30	Correct	6 ms	364 KB	Output is correct
31	Correct	6 ms	364 KB	Output is correct
32	Correct	6 ms	364 KB	Output is correct
33	Correct	6 ms	384 KB	Output is correct
34	Correct	6 ms	364 KB	Output is correct
35	Correct	10 ms	364 KB	Output is correct
36	Correct	13 ms	364 KB	Output is correct
37	Correct	18 ms	492 KB	Output is correct
38	Correct	21 ms	364 KB	Output is correct
39	Correct	21 ms	364 KB	Output is correct
40	Correct	22 ms	364 KB	Output is correct
41	Correct	21 ms	364 KB	Output is correct
42	Correct	21 ms	364 KB	Output is correct
43	Correct	4 ms	364 KB	Output is correct
44	Correct	9 ms	364 KB	Output is correct
45	Correct	9 ms	364 KB	Output is correct
46	Correct	10 ms	364 KB	Output is correct
47	Correct	13 ms	364 KB	Output is correct
48	Correct	10 ms	364 KB	Output is correct
49	Correct	12 ms	364 KB	Output is correct
50	Correct	13 ms	364 KB	Output is correct
51	Correct	12 ms	364 KB	Output is correct
52	Runtime error	141 ms	552 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
53	Halted	0 ms	0 KB	-