oj.uz

Submission #554657

# Submission time Handle Problem Language Result Execution time Memory
554657 2022-04-29T04:26:05 Z kwongweng Bali Sculptures (APIO15_sculpture) C++17
37 / 100
 761 ms 80200 KB 
/*
Solution for APIO 2015 - Bali Sculpture
Tags : 
*/

#include <bits/stdc++.h>
using namespace std;
 
#pragma GCC target ("avx2")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long double ld;
typedef pair<ll, ll> pll;
#define FOR(i, a, b) for(int i = a; i < b; i++)
#define ROF(i, a, b) for(int i = a; i >= b; i--)
#define ms memset
#define pb push_back
#define fi first
#define se second
 
ll MOD = 1000000007;
 
ll power(ll base, ll n){
	if (n == 0) return 1;
	if (n == 1) return base;
	ll halfn = power(base, n/2);
	if (n % 2 == 0) return (halfn * halfn) % MOD;
	return (((halfn * halfn) % MOD) * base) % MOD;
}
 
ll inverse(ll n){
	return power(n, MOD-2);
}
 
ll add(ll a, ll b){
	return (a+b) % MOD;
}
 
ll mul(ll a, ll b){
	a %= MOD;
	return (a*b) % MOD;
}
 
ll gcd(ll a, ll b){
    if (a == 1) return 1;
    if (a == 0) return b;
    return gcd(b%a, a);
}
 
void solve(){
    int n, a, b; cin >> n >> a >> b;
    vi y(n+1); FOR(i,1,n+1) cin >> y[i];
    vi p(n+1); FOR(i,1,n+1) p[i] = p[i-1] + y[i];
    // O(n^3 * b * 40)
    int ans = MOD;
    int max_a = n * 20 + 1;
    int dp[n+1][b+1][max_a];
    ms(dp,-1,sizeof(dp));
    FOR(i,1,n+1){
        dp[i][1][p[i]-p[0]] = 1;
    }
    FOR(j,2,b+1){
        FOR(i,2,n+1){
            FOR(k,1,i){
                int val = p[i]-p[k];
                FOR(l,0,max_a){
                    if (dp[k][j-1][l] != -1){
                        int new_val = l|val;
                        dp[i][j][new_val] = 1;
                    }
                }
            }
        }
    }
    FOR(l,0,max_a){
        bool sol = false;
        FOR(j,a,b+1){
            if (dp[n][j][l] == 1){
                cout<<l; sol = true;
                break;
            }
        }
        if (sol) break;
    }
}
 
int main() {
    ios::sync_with_stdio(false);
    int TC = 1;
    //cin >> TC;
    FOR(i, 1, TC+1){
        //cout << "Case #" << i << ": ";
        solve();
    }
}

Compilation message

sculpture.cpp:10: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   10 | #pragma GCC optimization ("Ofast")
      | 
sculpture.cpp:11: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   11 | #pragma GCC optimization ("unroll-loops")
      | 
sculpture.cpp: In function 'void solve()':
sculpture.cpp:60:9: warning: unused variable 'ans' [-Wunused-variable]
   60 |     int ans = MOD;
      |         ^~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 216 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 216 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 856 KB Output is correct
14 Correct 0 ms 216 KB Output is correct
15 Correct 0 ms 216 KB Output is correct
16 Correct 1 ms 216 KB Output is correct
17 Correct 0 ms 216 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 472 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 320 KB Output is correct
25 Correct 1 ms 472 KB Output is correct
26 Correct 2 ms 728 KB Output is correct
27 Runtime error 1 ms 472 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 852 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
27 Correct 3 ms 980 KB Output is correct
28 Correct 2 ms 852 KB Output is correct
29 Correct 2 ms 980 KB Output is correct
30 Correct 11 ms 2900 KB Output is correct
31 Correct 21 ms 4436 KB Output is correct
32 Correct 20 ms 4512 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 20 ms 4516 KB Output is correct
35 Correct 17 ms 3796 KB Output is correct
36 Correct 11 ms 2392 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 216 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 216 KB Output is correct
4 Correct 0 ms 216 KB Output is correct
5 Correct 1 ms 216 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 2 ms 856 KB Output is correct
14 Correct 2 ms 984 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 3 ms 968 KB Output is correct
17 Correct 12 ms 2904 KB Output is correct
18 Correct 20 ms 4516 KB Output is correct
19 Correct 21 ms 4440 KB Output is correct
20 Correct 1 ms 660 KB Output is correct
21 Correct 20 ms 4448 KB Output is correct
22 Correct 19 ms 3808 KB Output is correct
23 Correct 10 ms 2400 KB Output is correct
24 Correct 23 ms 4704 KB Output is correct
25 Correct 22 ms 3936 KB Output is correct
26 Correct 93 ms 11888 KB Output is correct
27 Correct 316 ms 37028 KB Output is correct
28 Correct 757 ms 80196 KB Output is correct
29 Correct 761 ms 80200 KB Output is correct
30 Correct 1 ms 1876 KB Output is correct
31 Correct 382 ms 38268 KB Output is correct
32 Correct 591 ms 59616 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 4 ms 852 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 3 ms 700 KB Output is correct
27 Runtime error 1 ms 452 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 448 KB Output is correct
13 Correct 2 ms 852 KB Output is correct
14 Runtime error 1 ms 468 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -