oj.uz

답안 #349792

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
349792 2021-01-18T12:11:34 Z AmineWeslati Bali Sculptures (APIO15_sculpture) C++14
71 / 100
 720 ms 736 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 = 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 MX2=2000+15;
const int LOG=50;
int N,A,B;
vi a(MX),vis(LOG,-1);
int memo[MX][MX],memo2[MX2];

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(N<=100){
        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
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 2 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 5 ms 492 KB Output is correct
8 Correct 7 ms 492 KB Output is correct
9 Correct 7 ms 492 KB Output is correct
10 Correct 7 ms 492 KB Output is correct
11 Correct 7 ms 492 KB Output is correct
12 Correct 7 ms 492 KB Output is correct
13 Correct 7 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 2 ms 492 KB Output is correct
19 Correct 4 ms 492 KB Output is correct
20 Correct 5 ms 492 KB Output is correct
21 Correct 7 ms 492 KB Output is correct
22 Correct 7 ms 492 KB Output is correct
23 Correct 7 ms 492 KB Output is correct
24 Correct 7 ms 492 KB Output is correct
25 Correct 7 ms 492 KB Output is correct
26 Correct 7 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 2 ms 492 KB Output is correct
30 Correct 4 ms 492 KB Output is correct
31 Correct 4 ms 492 KB Output is correct
32 Correct 4 ms 492 KB Output is correct
33 Correct 5 ms 492 KB Output is correct
34 Correct 5 ms 492 KB Output is correct
35 Correct 6 ms 492 KB Output is correct
36 Correct 6 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 2 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 5 ms 492 KB Output is correct
8 Correct 7 ms 492 KB Output is correct
9 Correct 7 ms 492 KB Output is correct
10 Correct 7 ms 492 KB Output is correct
11 Correct 7 ms 492 KB Output is correct
12 Correct 7 ms 492 KB Output is correct
13 Correct 7 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 2 ms 492 KB Output is correct
19 Correct 4 ms 492 KB Output is correct
20 Correct 5 ms 492 KB Output is correct
21 Correct 7 ms 492 KB Output is correct
22 Correct 7 ms 492 KB Output is correct
23 Correct 7 ms 620 KB Output is correct
24 Correct 8 ms 492 KB Output is correct
25 Correct 7 ms 492 KB Output is correct
26 Correct 7 ms 492 KB Output is correct
27 Correct 8 ms 492 KB Output is correct
28 Correct 13 ms 608 KB Output is correct
29 Correct 54 ms 492 KB Output is correct
30 Correct 55 ms 492 KB Output is correct
31 Correct 94 ms 620 KB Output is correct
32 Correct 92 ms 492 KB Output is correct
33 Correct 92 ms 492 KB Output is correct
34 Correct 92 ms 620 KB Output is correct
35 Correct 95 ms 620 KB Output is correct
36 Correct 92 ms 492 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 4 ms 492 KB Output is correct
7 Correct 5 ms 492 KB Output is correct
8 Correct 7 ms 492 KB Output is correct
9 Correct 7 ms 492 KB Output is correct
10 Correct 8 ms 492 KB Output is correct
11 Correct 7 ms 492 KB Output is correct
12 Correct 7 ms 492 KB Output is correct
13 Correct 7 ms 492 KB Output is correct
14 Correct 8 ms 492 KB Output is correct
15 Correct 13 ms 492 KB Output is correct
16 Correct 42 ms 492 KB Output is correct
17 Correct 56 ms 492 KB Output is correct
18 Correct 94 ms 620 KB Output is correct
19 Correct 90 ms 492 KB Output is correct
20 Correct 95 ms 492 KB Output is correct
21 Correct 92 ms 492 KB Output is correct
22 Correct 92 ms 492 KB Output is correct
23 Correct 92 ms 492 KB Output is correct
24 Correct 97 ms 492 KB Output is correct
25 Correct 197 ms 492 KB Output is correct
26 Correct 331 ms 492 KB Output is correct
27 Correct 527 ms 620 KB Output is correct
28 Correct 697 ms 620 KB Output is correct
29 Correct 685 ms 492 KB Output is correct
30 Correct 717 ms 620 KB Output is correct
31 Correct 694 ms 608 KB Output is correct
32 Correct 693 ms 608 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 4 ms 492 KB Output is correct
7 Correct 5 ms 492 KB Output is correct
8 Correct 7 ms 492 KB Output is correct
9 Correct 7 ms 492 KB Output is correct
10 Correct 7 ms 492 KB Output is correct
11 Correct 7 ms 492 KB Output is correct
12 Correct 7 ms 492 KB Output is correct
13 Correct 7 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 5 ms 492 KB Output is correct
20 Correct 5 ms 492 KB Output is correct
21 Correct 7 ms 492 KB Output is correct
22 Correct 7 ms 492 KB Output is correct
23 Correct 7 ms 492 KB Output is correct
24 Correct 7 ms 492 KB Output is correct
25 Correct 7 ms 492 KB Output is correct
26 Correct 7 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 2 ms 492 KB Output is correct
30 Correct 4 ms 492 KB Output is correct
31 Correct 4 ms 492 KB Output is correct
32 Correct 5 ms 492 KB Output is correct
33 Correct 7 ms 492 KB Output is correct
34 Correct 5 ms 492 KB Output is correct
35 Correct 6 ms 492 KB Output is correct
36 Correct 6 ms 492 KB Output is correct
37 Correct 8 ms 492 KB Output is correct
38 Correct 13 ms 492 KB Output is correct
39 Correct 41 ms 492 KB Output is correct
40 Correct 56 ms 492 KB Output is correct
41 Correct 92 ms 492 KB Output is correct
42 Correct 95 ms 492 KB Output is correct
43 Correct 96 ms 620 KB Output is correct
44 Correct 92 ms 492 KB Output is correct
45 Correct 93 ms 608 KB Output is correct
46 Correct 95 ms 608 KB Output is correct
47 Correct 101 ms 608 KB Output is correct
48 Correct 197 ms 620 KB Output is correct
49 Correct 341 ms 608 KB Output is correct
50 Correct 531 ms 492 KB Output is correct
51 Correct 708 ms 612 KB Output is correct
52 Correct 693 ms 612 KB Output is correct
53 Correct 716 ms 612 KB Output is correct
54 Correct 720 ms 612 KB Output is correct
55 Correct 719 ms 612 KB Output is correct
56 Correct 42 ms 492 KB Output is correct
57 Correct 165 ms 620 KB Output is correct
58 Correct 231 ms 612 KB Output is correct
59 Correct 296 ms 536 KB Output is correct
60 Correct 286 ms 492 KB Output is correct
61 Correct 328 ms 492 KB Output is correct
62 Correct 344 ms 492 KB Output is correct
63 Correct 358 ms 616 KB Output is correct
64 Correct 559 ms 608 KB Output is correct
65 Correct 44 ms 492 KB Output is correct
66 Correct 97 ms 492 KB Output is correct
67 Correct 145 ms 612 KB Output is correct
68 Correct 234 ms 612 KB Output is correct
69 Correct 295 ms 616 KB Output is correct
70 Correct 302 ms 492 KB Output is correct
71 Correct 302 ms 492 KB Output is correct
72 Correct 345 ms 620 KB Output is correct
73 Correct 380 ms 548 KB Output is correct
74 Correct 345 ms 616 KB Output is correct

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 4 ms 492 KB Output is correct
7 Correct 5 ms 492 KB Output is correct
8 Correct 11 ms 492 KB Output is correct
9 Correct 7 ms 492 KB Output is correct
10 Correct 7 ms 636 KB Output is correct
11 Correct 7 ms 492 KB Output is correct
12 Correct 7 ms 492 KB Output is correct
13 Correct 8 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 640 KB Output is correct
17 Correct 6 ms 492 KB Output is correct
18 Correct 4 ms 492 KB Output is correct
19 Correct 3 ms 492 KB Output is correct
20 Correct 5 ms 492 KB Output is correct
21 Correct 5 ms 492 KB Output is correct
22 Correct 6 ms 492 KB Output is correct
23 Correct 6 ms 492 KB Output is correct
24 Correct 8 ms 492 KB Output is correct
25 Correct 13 ms 492 KB Output is correct
26 Correct 42 ms 492 KB Output is correct
27 Correct 56 ms 492 KB Output is correct
28 Correct 102 ms 492 KB Output is correct
29 Correct 92 ms 492 KB Output is correct
30 Correct 98 ms 620 KB Output is correct
31 Correct 98 ms 620 KB Output is correct
32 Correct 91 ms 620 KB Output is correct
33 Correct 93 ms 492 KB Output is correct
34 Correct 96 ms 620 KB Output is correct
35 Correct 198 ms 604 KB Output is correct
36 Correct 337 ms 620 KB Output is correct
37 Correct 532 ms 492 KB Output is correct
38 Correct 695 ms 620 KB Output is correct
39 Correct 712 ms 608 KB Output is correct
40 Correct 711 ms 620 KB Output is correct
41 Correct 693 ms 736 KB Output is correct
42 Correct 700 ms 492 KB Output is correct
43 Correct 42 ms 492 KB Output is correct
44 Correct 156 ms 492 KB Output is correct
45 Correct 224 ms 620 KB Output is correct
46 Correct 294 ms 620 KB Output is correct
47 Correct 309 ms 620 KB Output is correct
48 Correct 302 ms 620 KB Output is correct
49 Correct 329 ms 492 KB Output is correct
50 Correct 348 ms 492 KB Output is correct
51 Correct 12 ms 364 KB Output is correct
52 Runtime error 446 ms 700 KB Execution killed with signal 11 (could be triggered by violating memory limits)
53 Halted 0 ms 0 KB -