oj.uz

답안 #948686

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948686 2024-03-18T11:04:34 Z steveonalex Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 136 ms 5980 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 2007; 
int n, L, R; 
ll a[N];
bool valid[N][N];

bool isSubMask(ll x, ll y){
    return ((x & y) == x) && ((x | y) == y);
}

namespace Sub4{
    bool dp[N][N];
    void solve(){
        ll ans = 0;
        for(int bit = 40; bit >= 0; --bit){
            ans = ans * 2;
            for(int i = 1; i<=n; ++i){
                ll sum = 0;
                for(int j = i; j<=n; ++j){
                    sum += a[j];
                    valid[i][j] = isSubMask(sum >> bit, ans);
                }
            }
            memset(dp, 0, sizeof dp);
            dp[0][0] = 1;
            bool check = false;
            for(int layer = 1; layer <= R; ++layer){
                for(int i = 1; i<=n; ++i)
                for(int j = i; j>=1; --j) if (dp[layer-1][j-1] && valid[j][i]) {
                    dp[layer][i] = true;
                }
                if (layer >= L && dp[layer][n]){
                    check = true; 
                    break;
                }
            }
            if (!check) ans++;
        }
        cout << ans << "\n";
        exit(0);
    }
}

namespace Sub5{
    int dp[N];
    void solve(){
        ll ans = 0;
        for(int bit = 40; bit >= 0; --bit){
            ans = ans * 2;
            for(int i = 1; i<=n; ++i){
                ll sum = 0;
                for(int j = i; j<=n; ++j){
                    sum += a[j];
                    valid[i][j] = isSubMask(sum >> bit, ans);
                }
            }
            memset(dp, 63, sizeof dp);
            dp[0] = 0;
            for(int i = 0; i<n; ++i) if (dp[i] < 1e9)
            for(int j = i + 1; j<=n; ++j) if (valid[i+1][j]) minimize(dp[j], dp[i] + 1);
            if (dp[n] > R) ans++;
        }
        cout << ans << "\n";
        exit(0);
    }
}
 
int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> L >> R;
    for(int i= 1; i<=n; ++i) cin >> a[i];

    if (L > 1) Sub4::solve();
    else Sub5::solve();
 
    return 0;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 4 ms 4572 KB Output is correct
15 Correct 3 ms 4696 KB Output is correct
16 Correct 3 ms 4700 KB Output is correct
17 Correct 4 ms 4700 KB Output is correct
18 Correct 3 ms 4700 KB Output is correct
19 Correct 3 ms 4700 KB Output is correct
20 Correct 6 ms 4700 KB Output is correct
21 Correct 3 ms 4744 KB Output is correct
22 Correct 4 ms 4696 KB Output is correct
23 Correct 4 ms 4696 KB Output is correct
24 Correct 4 ms 4700 KB Output is correct
25 Correct 3 ms 4744 KB Output is correct
26 Correct 4 ms 4952 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2392 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2648 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2592 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 3 ms 4696 KB Output is correct
15 Correct 3 ms 4700 KB Output is correct
16 Correct 4 ms 4696 KB Output is correct
17 Correct 4 ms 4696 KB Output is correct
18 Correct 3 ms 4700 KB Output is correct
19 Correct 4 ms 4700 KB Output is correct
20 Correct 4 ms 4700 KB Output is correct
21 Correct 3 ms 4700 KB Output is correct
22 Correct 3 ms 4700 KB Output is correct
23 Correct 3 ms 4700 KB Output is correct
24 Correct 3 ms 4700 KB Output is correct
25 Correct 4 ms 4700 KB Output is correct
26 Correct 4 ms 4696 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2392 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2392 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2408 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 3 ms 4700 KB Output is correct
15 Correct 3 ms 4700 KB Output is correct
16 Correct 4 ms 4744 KB Output is correct
17 Correct 4 ms 4700 KB Output is correct
18 Correct 4 ms 4756 KB Output is correct
19 Correct 4 ms 4704 KB Output is correct
20 Correct 4 ms 4700 KB Output is correct
21 Correct 4 ms 4700 KB Output is correct
22 Correct 4 ms 4700 KB Output is correct
23 Correct 4 ms 4700 KB Output is correct
24 Correct 3 ms 4700 KB Output is correct
25 Correct 4 ms 4700 KB Output is correct
26 Correct 4 ms 4696 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 0 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 1 ms 2392 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 1 ms 2396 KB Output is correct
42 Correct 1 ms 2392 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 1 ms 2396 KB Output is correct
45 Correct 0 ms 2396 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 1 ms 2396 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 1 ms 2396 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 1 ms 2396 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 1 ms 2396 KB Output is correct
56 Correct 1 ms 2396 KB Output is correct
57 Correct 1 ms 2516 KB Output is correct
58 Correct 1 ms 2396 KB Output is correct
59 Correct 1 ms 2396 KB Output is correct
60 Correct 1 ms 2396 KB Output is correct
61 Correct 1 ms 2392 KB Output is correct
62 Correct 1 ms 2392 KB Output is correct
63 Correct 1 ms 2396 KB Output is correct
64 Correct 11 ms 4700 KB Output is correct
65 Correct 5 ms 4748 KB Output is correct
66 Correct 5 ms 4700 KB Output is correct
67 Correct 6 ms 4700 KB Output is correct
68 Correct 11 ms 4696 KB Output is correct
69 Correct 19 ms 4700 KB Output is correct
70 Correct 19 ms 4744 KB Output is correct
71 Correct 5 ms 4700 KB Output is correct
72 Correct 16 ms 4700 KB Output is correct
73 Correct 16 ms 4700 KB Output is correct
74 Correct 14 ms 4700 KB Output is correct

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2404 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2392 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2400 KB Output is correct
24 Correct 1 ms 2584 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2524 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2648 KB Output is correct
41 Correct 1 ms 2396 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 1 ms 2396 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 1 ms 2396 KB Output is correct
47 Correct 1 ms 2516 KB Output is correct
48 Correct 1 ms 2396 KB Output is correct
49 Correct 1 ms 2392 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 1 ms 2396 KB Output is correct
52 Correct 11 ms 4444 KB Output is correct
53 Correct 12 ms 4596 KB Output is correct
54 Correct 32 ms 4444 KB Output is correct
55 Correct 28 ms 4444 KB Output is correct
56 Correct 84 ms 5980 KB Output is correct
57 Correct 81 ms 5980 KB Output is correct
58 Correct 111 ms 5976 KB Output is correct
59 Correct 116 ms 5980 KB Output is correct
60 Correct 89 ms 5976 KB Output is correct
61 Correct 1 ms 2392 KB Output is correct
62 Correct 13 ms 4592 KB Output is correct
63 Correct 32 ms 4444 KB Output is correct
64 Correct 21 ms 4444 KB Output is correct
65 Correct 41 ms 4956 KB Output is correct
66 Correct 62 ms 5464 KB Output is correct
67 Correct 81 ms 5980 KB Output is correct
68 Correct 136 ms 5980 KB Output is correct
69 Correct 81 ms 5980 KB Output is correct