oj.uz

Submission #349800

# Submission time Handle Problem Language Result Execution time Memory
349800 2021-01-18T12:31:09 Z AmineWeslati Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 1000 ms 748 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;
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 = 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 MX2=2000+10;
const int LOG=42;

int N,A,B;
vi a(MX2),vis(LOG,-1);
int memo[MX][MX],memo2[MX2];

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

bool 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; ll cur=0;
	FOR(j,i,N){
		cur+=a[j];
		if(check(cur)) ans|=solve(j+1,n+1);
	}
	return ind=ans;
}

ll cur_mx=0;
bool pos[MX2][MX2];
int solve2(int i){
    if(i==N) return 0;
    if(memo2[i]!=-1) return memo2[i];

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

int main() {
    boost; IO();

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

    if(N<=100){
        ROF(i,0,LOG){
        	vis[i]=0;
        	memset(memo,-1,sizeof(memo));
        	if(!solve(0,0)) vis[i]=1;
        }
    }
    else{
        ll power[LOG+1]; power[0]=1;
        FOR(i,1,LOG+1) power[i]=power[i-1]*2;
        cur_mx=power[LOG]-1;

        ROF(i,0,LOG){
            vis[i]=0;
            memset(memo2,-1,sizeof(memo2));
            if(solve2(0)>B) vis[i]=1;
            else cur_mx-=power[i];
        }
    }

    ll 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
*/

Compilation message

sculpture.cpp: In function 'bool solve(int, int)':
sculpture.cpp:92:12: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   92 |  return ind=ans;
      |         ~~~^~~~

Subtask #1
9.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 3 ms 492 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 5 ms 492 KB Output is correct
9 Correct 5 ms 492 KB Output is correct
10 Correct 5 ms 492 KB Output is correct
11 Correct 5 ms 492 KB Output is correct
12 Correct 5 ms 492 KB Output is correct
13 Correct 5 ms 512 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 512 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 3 ms 492 KB Output is correct
20 Correct 3 ms 492 KB Output is correct
21 Correct 5 ms 492 KB Output is correct
22 Correct 5 ms 492 KB Output is correct
23 Correct 5 ms 492 KB Output is correct
24 Correct 5 ms 492 KB Output is correct
25 Correct 5 ms 492 KB Output is correct
26 Correct 6 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 1 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 4 ms 492 KB Output is correct
34 Correct 3 ms 492 KB Output is correct
35 Correct 4 ms 492 KB Output is correct
36 Correct 4 ms 492 KB Output is correct

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 2 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 5 ms 492 KB Output is correct
9 Correct 5 ms 492 KB Output is correct
10 Correct 6 ms 492 KB Output is correct
11 Correct 5 ms 492 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 5 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 512 KB Output is correct
17 Correct 1 ms 632 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 3 ms 492 KB Output is correct
20 Correct 4 ms 492 KB Output is correct
21 Correct 5 ms 492 KB Output is correct
22 Correct 5 ms 492 KB Output is correct
23 Correct 5 ms 492 KB Output is correct
24 Correct 5 ms 492 KB Output is correct
25 Correct 5 ms 492 KB Output is correct
26 Correct 5 ms 492 KB Output is correct
27 Correct 6 ms 492 KB Output is correct
28 Correct 9 ms 492 KB Output is correct
29 Correct 30 ms 492 KB Output is correct
30 Correct 39 ms 492 KB Output is correct
31 Correct 63 ms 492 KB Output is correct
32 Correct 63 ms 492 KB Output is correct
33 Correct 65 ms 492 KB Output is correct
34 Correct 64 ms 620 KB Output is correct
35 Correct 64 ms 492 KB Output is correct
36 Correct 65 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 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 3 ms 492 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 5 ms 492 KB Output is correct
9 Correct 5 ms 492 KB Output is correct
10 Correct 5 ms 492 KB Output is correct
11 Correct 5 ms 492 KB Output is correct
12 Correct 5 ms 492 KB Output is correct
13 Correct 5 ms 492 KB Output is correct
14 Correct 6 ms 492 KB Output is correct
15 Correct 9 ms 504 KB Output is correct
16 Correct 29 ms 492 KB Output is correct
17 Correct 39 ms 492 KB Output is correct
18 Correct 65 ms 492 KB Output is correct
19 Correct 64 ms 492 KB Output is correct
20 Correct 66 ms 492 KB Output is correct
21 Correct 65 ms 492 KB Output is correct
22 Correct 68 ms 620 KB Output is correct
23 Correct 65 ms 492 KB Output is correct
24 Correct 66 ms 492 KB Output is correct
25 Correct 137 ms 492 KB Output is correct
26 Correct 238 ms 620 KB Output is correct
27 Correct 364 ms 620 KB Output is correct
28 Correct 484 ms 516 KB Output is correct
29 Correct 468 ms 492 KB Output is correct
30 Correct 503 ms 620 KB Output is correct
31 Correct 483 ms 620 KB Output is correct
32 Correct 479 ms 492 KB Output is correct

Subtask #4
25.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 1 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 3 ms 492 KB Output is correct
8 Correct 5 ms 492 KB Output is correct
9 Correct 5 ms 492 KB Output is correct
10 Correct 5 ms 492 KB Output is correct
11 Correct 5 ms 492 KB Output is correct
12 Correct 5 ms 492 KB Output is correct
13 Correct 5 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 512 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 3 ms 492 KB Output is correct
20 Correct 3 ms 492 KB Output is correct
21 Correct 5 ms 492 KB Output is correct
22 Correct 5 ms 492 KB Output is correct
23 Correct 5 ms 492 KB Output is correct
24 Correct 5 ms 492 KB Output is correct
25 Correct 5 ms 492 KB Output is correct
26 Correct 5 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 1 ms 492 KB Output is correct
30 Correct 2 ms 512 KB Output is correct
31 Correct 2 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 4 ms 492 KB Output is correct
34 Correct 3 ms 492 KB Output is correct
35 Correct 4 ms 492 KB Output is correct
36 Correct 4 ms 492 KB Output is correct
37 Correct 6 ms 492 KB Output is correct
38 Correct 12 ms 492 KB Output is correct
39 Correct 31 ms 492 KB Output is correct
40 Correct 39 ms 492 KB Output is correct
41 Correct 64 ms 620 KB Output is correct
42 Correct 64 ms 492 KB Output is correct
43 Correct 65 ms 620 KB Output is correct
44 Correct 65 ms 492 KB Output is correct
45 Correct 66 ms 512 KB Output is correct
46 Correct 65 ms 492 KB Output is correct
47 Correct 66 ms 492 KB Output is correct
48 Correct 143 ms 492 KB Output is correct
49 Correct 237 ms 620 KB Output is correct
50 Correct 369 ms 620 KB Output is correct
51 Correct 479 ms 620 KB Output is correct
52 Correct 473 ms 492 KB Output is correct
53 Correct 498 ms 516 KB Output is correct
54 Correct 485 ms 620 KB Output is correct
55 Correct 476 ms 748 KB Output is correct
56 Correct 21 ms 492 KB Output is correct
57 Correct 86 ms 492 KB Output is correct
58 Correct 112 ms 492 KB Output is correct
59 Correct 145 ms 620 KB Output is correct
60 Correct 142 ms 492 KB Output is correct
61 Correct 152 ms 620 KB Output is correct
62 Correct 176 ms 492 KB Output is correct
63 Correct 194 ms 620 KB Output is correct
64 Correct 386 ms 620 KB Output is correct
65 Correct 22 ms 492 KB Output is correct
66 Correct 50 ms 492 KB Output is correct
67 Correct 75 ms 492 KB Output is correct
68 Correct 119 ms 492 KB Output is correct
69 Correct 148 ms 620 KB Output is correct
70 Correct 137 ms 492 KB Output is correct
71 Correct 156 ms 492 KB Output is correct
72 Correct 181 ms 620 KB Output is correct
73 Correct 189 ms 620 KB Output is correct
74 Correct 187 ms 620 KB Output is correct

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 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 3 ms 492 KB Output is correct
7 Correct 4 ms 492 KB Output is correct
8 Correct 5 ms 492 KB Output is correct
9 Correct 5 ms 492 KB Output is correct
10 Correct 5 ms 492 KB Output is correct
11 Correct 5 ms 492 KB Output is correct
12 Correct 5 ms 492 KB Output is correct
13 Correct 5 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 2 ms 496 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 4 ms 492 KB Output is correct
21 Correct 3 ms 492 KB Output is correct
22 Correct 4 ms 492 KB Output is correct
23 Correct 4 ms 492 KB Output is correct
24 Correct 6 ms 492 KB Output is correct
25 Correct 9 ms 492 KB Output is correct
26 Correct 29 ms 492 KB Output is correct
27 Correct 39 ms 492 KB Output is correct
28 Correct 65 ms 492 KB Output is correct
29 Correct 63 ms 640 KB Output is correct
30 Correct 65 ms 492 KB Output is correct
31 Correct 66 ms 620 KB Output is correct
32 Correct 66 ms 492 KB Output is correct
33 Correct 67 ms 492 KB Output is correct
34 Correct 70 ms 492 KB Output is correct
35 Correct 143 ms 492 KB Output is correct
36 Correct 232 ms 620 KB Output is correct
37 Correct 364 ms 492 KB Output is correct
38 Correct 484 ms 516 KB Output is correct
39 Correct 467 ms 620 KB Output is correct
40 Correct 494 ms 516 KB Output is correct
41 Correct 482 ms 620 KB Output is correct
42 Correct 479 ms 492 KB Output is correct
43 Correct 21 ms 492 KB Output is correct
44 Correct 86 ms 492 KB Output is correct
45 Correct 114 ms 492 KB Output is correct
46 Correct 149 ms 492 KB Output is correct
47 Correct 141 ms 620 KB Output is correct
48 Correct 154 ms 620 KB Output is correct
49 Correct 176 ms 492 KB Output is correct
50 Correct 194 ms 620 KB Output is correct
51 Correct 5 ms 364 KB Output is correct
52 Correct 91 ms 364 KB Output is correct
53 Correct 138 ms 364 KB Output is correct
54 Correct 316 ms 492 KB Output is correct
55 Correct 252 ms 492 KB Output is correct
56 Correct 752 ms 620 KB Output is correct
57 Correct 748 ms 620 KB Output is correct
58 Correct 600 ms 620 KB Output is correct
59 Correct 597 ms 492 KB Output is correct
60 Execution timed out 1056 ms 640 KB Time limit exceeded
61 Halted 0 ms 0 KB -