oj.uz

Submission #554671

# Submission time Handle Problem Language Result Execution time Memory
554671 2022-04-29T06:01:17 Z kwongweng Bali Sculptures (APIO15_sculpture) C++17
100 / 100
 257 ms 16032 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;
    vector<ll> y(n+1); FOR(i,1,n+1) cin >> y[i];
    vector<ll> p(n+1); FOR(i,1,n+1) p[i] = p[i-1] + y[i];
    int max_bit = 0;
    vector<ll> p2(51);
    p2[0]=1;
    FOR(i,1,51){
        p2[i] = p2[i-1] + p2[i-1];
    }
    while (p2[max_bit] <= p[n]){
        max_bit++;
    }
    max_bit--;
    if (a==1){
        int mat[n+1][n+2];
        ms(mat, 0, sizeof(mat));
        FOR(i,1,n+1){
            FOR(j,i+1,n+2){
                mat[i][j]=1;
            }
        }
        ll cur = 0;
        ROF(bit,max_bit,0){
            cur += p2[bit];
            FOR(i,1,n+1){
                FOR(j,i+1,n+2){
                    ll val = p[j-1]-p[i-1];
                    if (val&cur){
                        mat[i][j]=0;
                    }
                }
            }
            vi dp(n+2, MOD);
            dp[1]=0;
            FOR(i,1,n+1){
                FOR(j,i+1,n+2){
                    if (mat[i][j] == 1 && dp[i] != MOD){
                        dp[j]=min(dp[j],dp[i]+1);
                    }
                }
            }
            if (dp[n+1] > b){
                cur -= p2[bit];
            }
            FOR(i,1,n+1){
                FOR(j,i+1,n+2){
                    mat[i][j]=1;
                }
            }
        }
        cout << p2[max_bit+1] - 1 - cur;
        return;
    }
    int mat[n+1][n+2];
    FOR(i,1,n+1){
        FOR(j,i+1,n+2){
            mat[i][j] = 1;
        }
    }
    ll cur = 0;
    ROF(bit,max_bit,0){
        cur += p2[bit];
        FOR(i,1,n+1){
            FOR(j,i+1,n+2){
                ll val = p[j-1]-p[i-1];
                if (val&cur){
                    mat[i][j]=0;
                }
            }
        }
        int dist[n+2][n+1];
        ms(dist,-1,sizeof(dist));
        dist[1][0]=1;
        FOR(i,1,n+1){
            FOR(j,i+1,n+2){
                if (mat[i][j] == 1){
                    FOR(k,0,n){
                        if (dist[i][k] != -1){
                            if (dist[j][k+1] == -1){
                                dist[j][k+1] = 1;
                            }
                        }
                    }
                }
            }
        }
        bool sol = false;
        FOR(i,a,b+1){
            if (dist[n+1][i] == 1){
                sol = true; break;
            }
        }
        if (!sol){
            cur -= p2[bit];
        }
        FOR(i,1,n+1){
            FOR(j,i+1,n+2){
                mat[i][j] = 1;
            }
        }
    }
    cout << p2[max_bit+1] - cur - 1;
}
 
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")
      |

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 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 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 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 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct

Subtask #2
16.0 / 16.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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 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 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 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 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 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 220 KB Output is correct
17 Correct 1 ms 220 KB Output is correct
18 Correct 1 ms 220 KB Output is correct
19 Correct 1 ms 220 KB Output is correct
20 Correct 1 ms 224 KB Output is correct
21 Correct 1 ms 224 KB Output is correct
22 Correct 0 ms 224 KB Output is correct
23 Correct 1 ms 224 KB Output is correct
24 Correct 1 ms 224 KB Output is correct
25 Correct 0 ms 224 KB Output is correct
26 Correct 1 ms 224 KB Output is correct
27 Correct 1 ms 352 KB Output is correct
28 Correct 1 ms 352 KB Output is correct
29 Correct 1 ms 352 KB Output is correct
30 Correct 1 ms 352 KB Output is correct
31 Correct 1 ms 352 KB Output is correct
32 Correct 1 ms 352 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 224 KB Output is correct
2 Correct 0 ms 224 KB Output is correct
3 Correct 1 ms 224 KB Output is correct
4 Correct 0 ms 224 KB Output is correct
5 Correct 0 ms 224 KB Output is correct
6 Correct 0 ms 224 KB Output is correct
7 Correct 1 ms 224 KB Output is correct
8 Correct 1 ms 224 KB Output is correct
9 Correct 0 ms 224 KB Output is correct
10 Correct 0 ms 224 KB Output is correct
11 Correct 0 ms 224 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 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 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 324 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 352 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 324 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 1 ms 316 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 2 ms 340 KB Output is correct
68 Correct 3 ms 340 KB Output is correct
69 Correct 3 ms 340 KB Output is correct
70 Correct 3 ms 316 KB Output is correct
71 Correct 3 ms 340 KB Output is correct
72 Correct 4 ms 340 KB Output is correct
73 Correct 5 ms 340 KB Output is correct
74 Correct 4 ms 340 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 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 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 224 KB Output is correct
27 Correct 1 ms 224 KB Output is correct
28 Correct 1 ms 224 KB Output is correct
29 Correct 0 ms 224 KB Output is correct
30 Correct 0 ms 224 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 1 ms 340 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 340 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 14 ms 1620 KB Output is correct
53 Correct 26 ms 2516 KB Output is correct
54 Correct 48 ms 4180 KB Output is correct
55 Correct 38 ms 4180 KB Output is correct
56 Correct 179 ms 15956 KB Output is correct
57 Correct 182 ms 16020 KB Output is correct
58 Correct 257 ms 16016 KB Output is correct
59 Correct 182 ms 16008 KB Output is correct
60 Correct 218 ms 16012 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 22 ms 2516 KB Output is correct
63 Correct 41 ms 4180 KB Output is correct
64 Correct 34 ms 4180 KB Output is correct
65 Correct 79 ms 8020 KB Output is correct
66 Correct 142 ms 12296 KB Output is correct
67 Correct 204 ms 16032 KB Output is correct
68 Correct 195 ms 16028 KB Output is correct
69 Correct 237 ms 16012 KB Output is correct