oj.uz

답안 #1050778

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050778 2024-08-09T14:18:45 Z manhlinh1501 Bali Sculptures (APIO15_sculpture) C++17
9 / 100
 140 ms 37468 KB 
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 oo64 = LLONG_MAX;
const int MAXN = 2050;

int N, L, R;
int a[MAXN];
i64 ans = oo64;

namespace subtask1 {
    bool is_subtask() {
        return N <= 20;
    }
    void solution() {
        if(is_subtask() == false) return;
        for(int mask = 0; mask < (1 << N); mask++) {
            vector<i64> b;
            b.emplace_back(0);
            int cb = (mask >> 0 & 1);
            for(int i = 0; i < N; i++) {
                if((mask >> i & 1) == cb)
                    b.back() += a[i + 1];
                else {
                    b.emplace_back(a[i + 1]);
                    cb ^= 1;
                }
            }
            i64 res = 0;
            for(i64 x : b) res |= x;
            if(L <= b.size() and b.size() <= R)
                ans = min(ans, res);
        }
        cout << ans;
        exit(0);
    }
}

namespace subtask23 {
    int dpL[MAXN][MAXN];
    int dpR[MAXN][MAXN];

    bool is_subtask() {
        for(int i = 1; i <= N; i++) {
            if(a[i] > 20) return false;
        }
        return N <= 100;
    }
    void solution() {
        if(is_subtask() == false) return;
        memset(dpL, 0x3f, sizeof dpL);
        memset(dpR, -0x3f, sizeof dpR);
        dpL[0][0] = dpR[0][0] = 0;
        for(int i = 1; i <= N; i++) {
            int cur = 0;
            for(int j = i; j >= 1; j--) {
                cur += a[j];
                for(int mask = 0; mask < (1 << 11); mask++) {
                    dpL[i][mask | cur] = min(dpL[i][mask | cur], dpL[j - 1][mask] + 1);
                    dpR[i][mask | cur] = max(dpR[i][mask | cur], dpR[j - 1][mask] + 1);
                }
            }
        }
        for(int mask = 0; mask < (1 << 11); mask++) {
            if(dpL[N][mask] > dpR[N][mask]) continue;
            if((L <= dpL[N][mask] and dpR[N][mask] <= R) or
                    (L <= dpL[N][mask] and dpL[N][mask] <= R) or
                    (L <= dpR[N][mask] and dpR[N][mask] <= R))
                return cout << mask, void(0);
        }
        cout << "-1";
        exit(0);
    }
}

namespace subtask4 {
    bool is_subtask() {
        return N <= 100;
    }
    bool dp[MAXN][MAXN];

    bool check(int mask) {
        memset(dp, 0, sizeof dp);
        dp[0][0] = true;
        for(int i = 1; i <= N; i++) {
            i64 cur = 0;
            for(int j = i; j >= 1; j--) {
                cur += a[j];
                if((mask | a[j]) == mask) {
                    for(int z = 1; z <= R; z++)
                        dp[i][z] |= dp[j - 1][z - 1];
                }
            }
        }
        for(int i = L; i <= R; i++) {
            if(dp[N][i]) return true;
        }
        return false;
    }

    void solution() {
        if(is_subtask() == false) return;
        const int B = 50;
        i64 ans = (1LL << B) - 1;
        for(int i = B - 1; i >= 0; i--) {
            if(check(ans ^ (1LL << i)))
                ans = ans ^ (1LL << i);
        }
        cout << ans;
        exit(0);
    }
}

signed main() {
#define TASK "code"

    if (fopen(TASK ".inp", "r")) {
        freopen(TASK ".inp", "r", stdin);
        freopen(TASK ".out", "w", stdout);
    }

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> N >> L >> R;
    for(int i = 1; i <= N; i++) cin >> a[i];
    subtask1::solution();
    subtask23::solution();
    subtask4::solution();
    return (0 ^ 0);
}

Compilation message

sculpture.cpp: In function 'void subtask1::solution()':
sculpture.cpp:31:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |             if(L <= b.size() and b.size() <= R)
      |                ~~^~~~~~~~~~~
sculpture.cpp:31:43: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |             if(L <= b.size() and b.size() <= R)
      |                                  ~~~~~~~~~^~~~
sculpture.cpp: In function 'int main()':
sculpture.cpp:118:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |         freopen(TASK ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:119:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  119 |         freopen(TASK ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 15 ms 464 KB Output is correct
8 Correct 126 ms 348 KB Output is correct
9 Correct 127 ms 348 KB Output is correct
10 Correct 126 ms 344 KB Output is correct
11 Correct 136 ms 344 KB Output is correct
12 Correct 128 ms 344 KB Output is correct
13 Correct 126 ms 440 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 4 ms 348 KB Output is correct
20 Correct 15 ms 348 KB Output is correct
21 Correct 128 ms 348 KB Output is correct
22 Correct 125 ms 348 KB Output is correct
23 Correct 130 ms 348 KB Output is correct
24 Correct 132 ms 348 KB Output is correct
25 Correct 132 ms 344 KB Output is correct
26 Correct 126 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 63 ms 436 KB Output is correct
31 Correct 131 ms 348 KB Output is correct
32 Correct 126 ms 344 KB Output is correct
33 Correct 129 ms 348 KB Output is correct
34 Correct 130 ms 348 KB Output is correct
35 Correct 127 ms 348 KB Output is correct
36 Correct 129 ms 344 KB Output is correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 18 ms 464 KB Output is correct
8 Correct 133 ms 348 KB Output is correct
9 Correct 132 ms 348 KB Output is correct
10 Correct 132 ms 348 KB Output is correct
11 Correct 128 ms 436 KB Output is correct
12 Correct 126 ms 344 KB Output is correct
13 Correct 128 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 4 ms 464 KB Output is correct
20 Correct 15 ms 348 KB Output is correct
21 Correct 127 ms 348 KB Output is correct
22 Correct 126 ms 348 KB Output is correct
23 Correct 131 ms 592 KB Output is correct
24 Correct 128 ms 348 KB Output is correct
25 Correct 127 ms 348 KB Output is correct
26 Correct 126 ms 348 KB Output is correct
27 Incorrect 8 ms 37464 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 15 ms 468 KB Output is correct
8 Correct 127 ms 348 KB Output is correct
9 Correct 140 ms 348 KB Output is correct
10 Correct 127 ms 344 KB Output is correct
11 Correct 127 ms 348 KB Output is correct
12 Correct 127 ms 348 KB Output is correct
13 Correct 126 ms 344 KB Output is correct
14 Incorrect 9 ms 37212 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 15 ms 460 KB Output is correct
8 Correct 126 ms 348 KB Output is correct
9 Correct 126 ms 348 KB Output is correct
10 Correct 126 ms 344 KB Output is correct
11 Correct 130 ms 600 KB Output is correct
12 Correct 126 ms 348 KB Output is correct
13 Correct 126 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 5 ms 348 KB Output is correct
20 Correct 18 ms 600 KB Output is correct
21 Correct 138 ms 348 KB Output is correct
22 Correct 130 ms 348 KB Output is correct
23 Correct 133 ms 348 KB Output is correct
24 Correct 127 ms 348 KB Output is correct
25 Correct 126 ms 344 KB Output is correct
26 Correct 126 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 74 ms 444 KB Output is correct
31 Correct 132 ms 344 KB Output is correct
32 Correct 125 ms 348 KB Output is correct
33 Correct 127 ms 344 KB Output is correct
34 Correct 128 ms 348 KB Output is correct
35 Correct 134 ms 348 KB Output is correct
36 Correct 126 ms 444 KB Output is correct
37 Incorrect 8 ms 37468 KB Output isn't correct
38 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 16 ms 348 KB Output is correct
8 Correct 127 ms 348 KB Output is correct
9 Correct 130 ms 460 KB Output is correct
10 Correct 132 ms 348 KB Output is correct
11 Correct 127 ms 444 KB Output is correct
12 Correct 133 ms 344 KB Output is correct
13 Correct 133 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 62 ms 440 KB Output is correct
18 Correct 127 ms 344 KB Output is correct
19 Correct 135 ms 440 KB Output is correct
20 Correct 131 ms 348 KB Output is correct
21 Correct 127 ms 344 KB Output is correct
22 Correct 140 ms 348 KB Output is correct
23 Correct 126 ms 348 KB Output is correct
24 Incorrect 8 ms 37208 KB Output isn't correct
25 Halted 0 ms 0 KB -