oj.uz

Submission #332813

# Submission time Handle Problem Language Result Execution time Memory
332813 2020-12-03T13:12:29 Z AmineWeslati Bali Sculptures (APIO15_sculpture) C++14
37 / 100
 215 ms 241796 KB 
//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 = 1e9;
const int MX = 2e5 + 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
}

int N,A,B; 
vi a(MX);
int memo[101][101][3000];

int solve(int i, int n, int m){
	if(i==N){
		if(n>=A && n<=B) return m;
		return INF;
	}

	int &ind=memo[i][n][m];
	if(ind!=-1) return ind;
	int ans=INF;

	int cur=0;
	FOR(j,i,N){
		cur+=a[j];
		ckmin(ans,solve(j+1,n+1,((cur)|(m))));
	}

	return ind=ans;
}

int32_t main() {
    boost; IO();
    memset(memo,-1,sizeof(memo));

    cin>>N>>A>>B;
    FOR(i,0,N) cin>>a[i];
    if(N>20)
    	cout << solve(0,0,0) << endl;
    else{
    	int ans=INF;
    	FOR(m,0,(1)<<(N)) if((m)&((1)<<(N-1))){
    		int cur=0,cum=0,nb=0;
    		FOR(i,0,N){
    			cur+=a[i];
    			if(i==N-1 || (m)&((1)<<(i))){
    				nb++;
    				cum|=cur;
    				cur=0;
    			}
    		}
    		if(nb>=A && nb<=B) ckmin(ans,cum);
    	}
    	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 134 ms 241388 KB Output is correct
2 Correct 130 ms 241388 KB Output is correct
3 Correct 134 ms 241388 KB Output is correct
4 Correct 133 ms 241516 KB Output is correct
5 Correct 136 ms 241388 KB Output is correct
6 Correct 136 ms 241388 KB Output is correct
7 Correct 138 ms 241496 KB Output is correct
8 Correct 172 ms 241516 KB Output is correct
9 Correct 176 ms 241388 KB Output is correct
10 Correct 168 ms 241388 KB Output is correct
11 Correct 171 ms 241508 KB Output is correct
12 Correct 172 ms 241388 KB Output is correct
13 Correct 171 ms 241388 KB Output is correct
14 Correct 131 ms 241432 KB Output is correct
15 Correct 137 ms 241448 KB Output is correct
16 Correct 142 ms 241388 KB Output is correct
17 Correct 138 ms 241388 KB Output is correct
18 Correct 140 ms 241516 KB Output is correct
19 Correct 136 ms 241388 KB Output is correct
20 Correct 139 ms 241388 KB Output is correct
21 Correct 175 ms 241388 KB Output is correct
22 Correct 176 ms 241428 KB Output is correct
23 Correct 170 ms 241516 KB Output is correct
24 Correct 170 ms 241436 KB Output is correct
25 Correct 172 ms 241388 KB Output is correct
26 Correct 171 ms 241516 KB Output is correct
27 Incorrect 140 ms 241388 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 133 ms 241620 KB Output is correct
2 Correct 137 ms 241388 KB Output is correct
3 Correct 139 ms 241388 KB Output is correct
4 Correct 132 ms 241388 KB Output is correct
5 Correct 135 ms 241388 KB Output is correct
6 Correct 152 ms 241388 KB Output is correct
7 Correct 141 ms 241388 KB Output is correct
8 Correct 172 ms 241388 KB Output is correct
9 Correct 178 ms 241520 KB Output is correct
10 Correct 171 ms 241388 KB Output is correct
11 Correct 174 ms 241388 KB Output is correct
12 Correct 171 ms 241388 KB Output is correct
13 Correct 184 ms 241388 KB Output is correct
14 Correct 132 ms 241388 KB Output is correct
15 Correct 138 ms 241388 KB Output is correct
16 Correct 133 ms 241388 KB Output is correct
17 Correct 133 ms 241388 KB Output is correct
18 Correct 134 ms 241388 KB Output is correct
19 Correct 133 ms 241516 KB Output is correct
20 Correct 139 ms 241388 KB Output is correct
21 Correct 174 ms 241388 KB Output is correct
22 Correct 172 ms 241388 KB Output is correct
23 Correct 171 ms 241516 KB Output is correct
24 Correct 172 ms 241516 KB Output is correct
25 Correct 171 ms 241388 KB Output is correct
26 Correct 175 ms 241388 KB Output is correct
27 Correct 133 ms 241516 KB Output is correct
28 Correct 132 ms 241516 KB Output is correct
29 Correct 132 ms 241388 KB Output is correct
30 Correct 134 ms 241388 KB Output is correct
31 Correct 138 ms 241388 KB Output is correct
32 Correct 142 ms 241388 KB Output is correct
33 Correct 136 ms 241388 KB Output is correct
34 Correct 141 ms 241388 KB Output is correct
35 Correct 132 ms 241388 KB Output is correct
36 Correct 133 ms 241388 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 241516 KB Output is correct
2 Correct 135 ms 241388 KB Output is correct
3 Correct 137 ms 241504 KB Output is correct
4 Correct 134 ms 241488 KB Output is correct
5 Correct 137 ms 241516 KB Output is correct
6 Correct 132 ms 241448 KB Output is correct
7 Correct 146 ms 241388 KB Output is correct
8 Correct 177 ms 241388 KB Output is correct
9 Correct 182 ms 241516 KB Output is correct
10 Correct 177 ms 241516 KB Output is correct
11 Correct 181 ms 241388 KB Output is correct
12 Correct 182 ms 241516 KB Output is correct
13 Correct 174 ms 241412 KB Output is correct
14 Correct 132 ms 241388 KB Output is correct
15 Correct 135 ms 241388 KB Output is correct
16 Correct 134 ms 241516 KB Output is correct
17 Correct 134 ms 241572 KB Output is correct
18 Correct 137 ms 241388 KB Output is correct
19 Correct 134 ms 241516 KB Output is correct
20 Correct 147 ms 241388 KB Output is correct
21 Correct 136 ms 241388 KB Output is correct
22 Correct 136 ms 241388 KB Output is correct
23 Correct 137 ms 241388 KB Output is correct
24 Correct 137 ms 241516 KB Output is correct
25 Correct 142 ms 241388 KB Output is correct
26 Correct 160 ms 241388 KB Output is correct
27 Correct 176 ms 241516 KB Output is correct
28 Correct 196 ms 241516 KB Output is correct
29 Correct 174 ms 241516 KB Output is correct
30 Correct 177 ms 241516 KB Output is correct
31 Correct 211 ms 241516 KB Output is correct
32 Correct 215 ms 241516 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 241516 KB Output is correct
2 Correct 135 ms 241516 KB Output is correct
3 Correct 134 ms 241388 KB Output is correct
4 Correct 133 ms 241516 KB Output is correct
5 Correct 137 ms 241516 KB Output is correct
6 Correct 134 ms 241388 KB Output is correct
7 Correct 142 ms 241388 KB Output is correct
8 Correct 172 ms 241388 KB Output is correct
9 Correct 182 ms 241568 KB Output is correct
10 Correct 172 ms 241528 KB Output is correct
11 Correct 173 ms 241536 KB Output is correct
12 Correct 181 ms 241704 KB Output is correct
13 Correct 171 ms 241516 KB Output is correct
14 Correct 133 ms 241388 KB Output is correct
15 Correct 132 ms 241516 KB Output is correct
16 Correct 133 ms 241516 KB Output is correct
17 Correct 132 ms 241516 KB Output is correct
18 Correct 136 ms 241388 KB Output is correct
19 Correct 136 ms 241516 KB Output is correct
20 Correct 137 ms 241420 KB Output is correct
21 Correct 176 ms 241388 KB Output is correct
22 Correct 173 ms 241468 KB Output is correct
23 Correct 171 ms 241388 KB Output is correct
24 Correct 171 ms 241388 KB Output is correct
25 Correct 175 ms 241388 KB Output is correct
26 Correct 170 ms 241388 KB Output is correct
27 Incorrect 131 ms 241508 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 241388 KB Output is correct
2 Correct 135 ms 241388 KB Output is correct
3 Correct 131 ms 241468 KB Output is correct
4 Correct 131 ms 241388 KB Output is correct
5 Correct 133 ms 241388 KB Output is correct
6 Correct 133 ms 241388 KB Output is correct
7 Correct 138 ms 241388 KB Output is correct
8 Correct 172 ms 241516 KB Output is correct
9 Correct 170 ms 241796 KB Output is correct
10 Correct 171 ms 241388 KB Output is correct
11 Correct 170 ms 241396 KB Output is correct
12 Correct 175 ms 241516 KB Output is correct
13 Correct 175 ms 241516 KB Output is correct
14 Incorrect 134 ms 241516 KB Output isn't correct
15 Halted 0 ms 0 KB -