oj.uz

답안 #349807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
349807 2021-01-18T12:41:28 Z AmineWeslati Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 72 ms 620 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); 
ll vis=0;
int memo[MX][MX],memo2[MX2];

bool check(ll x){
	return (!(x&vis));
}

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();

    ll power[LOG+1]; power[0]=1;
    FOR(i,1,LOG+1) power[i]=power[i-1]*2;
    cur_mx=power[LOG]-1;

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

    if(N<=100){
        ROF(i,0,LOG){
        	vis+=power[i];
        	memset(memo,-1,sizeof(memo));
        	if(!solve(0,0)) vis-=power[i];
        }
    }
    else{
        ROF(i,0,LOG){
            vis+=power[i];
            memset(memo2,-1,sizeof(memo2));
            if(solve2(0)>B) vis-=power[i];
            else cur_mx-=power[i];
        }
    }

    cout << power[LOG]-vis-1 << 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:91:12: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   91 |  return ind=ans;
      |         ~~~^~~~

Subtask #1
9.0 / 9.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 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 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 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 508 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 ms 512 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 1 ms 512 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 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 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 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 492 KB Output is correct
18 Correct 1 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 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 3 ms 492 KB Output is correct
30 Correct 4 ms 492 KB Output is correct
31 Correct 6 ms 492 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 6 ms 492 KB Output is correct
34 Correct 6 ms 492 KB Output is correct
35 Correct 6 ms 620 KB Output is correct
36 Correct 6 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 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 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 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 3 ms 492 KB Output is correct
17 Correct 4 ms 492 KB Output is correct
18 Correct 6 ms 492 KB Output is correct
19 Correct 6 ms 492 KB Output is correct
20 Correct 6 ms 492 KB Output is correct
21 Correct 6 ms 492 KB Output is correct
22 Correct 6 ms 492 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 6 ms 492 KB Output is correct
25 Correct 12 ms 512 KB Output is correct
26 Correct 20 ms 492 KB Output is correct
27 Correct 30 ms 492 KB Output is correct
28 Correct 38 ms 492 KB Output is correct
29 Correct 39 ms 492 KB Output is correct
30 Correct 39 ms 492 KB Output is correct
31 Correct 38 ms 492 KB Output is correct
32 Correct 38 ms 492 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 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 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 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 1 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 1 ms 492 KB Output is correct
31 Correct 1 ms 492 KB Output is correct
32 Correct 1 ms 492 KB Output is correct
33 Correct 1 ms 492 KB Output is correct
34 Correct 1 ms 492 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 1 ms 492 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 2 ms 492 KB Output is correct
39 Correct 3 ms 492 KB Output is correct
40 Correct 5 ms 492 KB Output is correct
41 Correct 6 ms 492 KB Output is correct
42 Correct 6 ms 492 KB Output is correct
43 Correct 6 ms 492 KB Output is correct
44 Correct 6 ms 492 KB Output is correct
45 Correct 6 ms 492 KB Output is correct
46 Correct 6 ms 492 KB Output is correct
47 Correct 6 ms 492 KB Output is correct
48 Correct 12 ms 492 KB Output is correct
49 Correct 19 ms 492 KB Output is correct
50 Correct 29 ms 492 KB Output is correct
51 Correct 40 ms 492 KB Output is correct
52 Correct 38 ms 620 KB Output is correct
53 Correct 42 ms 492 KB Output is correct
54 Correct 42 ms 520 KB Output is correct
55 Correct 38 ms 512 KB Output is correct
56 Correct 2 ms 492 KB Output is correct
57 Correct 7 ms 492 KB Output is correct
58 Correct 8 ms 492 KB Output is correct
59 Correct 11 ms 492 KB Output is correct
60 Correct 10 ms 492 KB Output is correct
61 Correct 11 ms 492 KB Output is correct
62 Correct 13 ms 512 KB Output is correct
63 Correct 14 ms 492 KB Output is correct
64 Correct 31 ms 492 KB Output is correct
65 Correct 2 ms 492 KB Output is correct
66 Correct 4 ms 492 KB Output is correct
67 Correct 6 ms 492 KB Output is correct
68 Correct 9 ms 492 KB Output is correct
69 Correct 14 ms 492 KB Output is correct
70 Correct 12 ms 492 KB Output is correct
71 Correct 11 ms 492 KB Output is correct
72 Correct 13 ms 620 KB Output is correct
73 Correct 13 ms 492 KB Output is correct
74 Correct 13 ms 492 KB Output is correct

Subtask #5
29.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 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 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 1 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 1 ms 492 KB Output is correct
25 Correct 1 ms 492 KB Output is correct
26 Correct 3 ms 492 KB Output is correct
27 Correct 4 ms 492 KB Output is correct
28 Correct 6 ms 492 KB Output is correct
29 Correct 6 ms 492 KB Output is correct
30 Correct 6 ms 492 KB Output is correct
31 Correct 6 ms 492 KB Output is correct
32 Correct 6 ms 492 KB Output is correct
33 Correct 6 ms 492 KB Output is correct
34 Correct 6 ms 492 KB Output is correct
35 Correct 12 ms 492 KB Output is correct
36 Correct 19 ms 492 KB Output is correct
37 Correct 29 ms 620 KB Output is correct
38 Correct 40 ms 620 KB Output is correct
39 Correct 37 ms 492 KB Output is correct
40 Correct 44 ms 520 KB Output is correct
41 Correct 38 ms 492 KB Output is correct
42 Correct 38 ms 492 KB Output is correct
43 Correct 2 ms 620 KB Output is correct
44 Correct 6 ms 492 KB Output is correct
45 Correct 8 ms 492 KB Output is correct
46 Correct 11 ms 492 KB Output is correct
47 Correct 9 ms 492 KB Output is correct
48 Correct 11 ms 492 KB Output is correct
49 Correct 13 ms 492 KB Output is correct
50 Correct 14 ms 492 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 6 ms 364 KB Output is correct
53 Correct 8 ms 364 KB Output is correct
54 Correct 18 ms 364 KB Output is correct
55 Correct 14 ms 364 KB Output is correct
56 Correct 41 ms 492 KB Output is correct
57 Correct 37 ms 492 KB Output is correct
58 Correct 30 ms 492 KB Output is correct
59 Correct 30 ms 492 KB Output is correct
60 Correct 72 ms 492 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 8 ms 364 KB Output is correct
63 Correct 18 ms 492 KB Output is correct
64 Correct 13 ms 492 KB Output is correct
65 Correct 20 ms 492 KB Output is correct
66 Correct 28 ms 492 KB Output is correct
67 Correct 55 ms 492 KB Output is correct
68 Correct 47 ms 492 KB Output is correct
69 Correct 35 ms 492 KB Output is correct