oj.uz

Submission #743359

# Submission time Handle Problem Language Result Execution time Memory
743359 2023-05-17T10:30:25 Z Magikarp4000 Bali Sculptures (APIO15_sculpture) C++17
16 / 100
 11 ms 8532 KB 
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long

const int MAXN = 1e2+1, MAXX = 5e2+1;
int n,A,B;
int a[MAXN], p[MAXN];
int dp[MAXN][MAXN][MAXX];

signed main() {
    cin >> n >> A >> B;
    FOR(i,0,n) cin >> a[i];
    FOR(i,1,n+1) p[i] = p[i-1]+a[i-1];
    FOR(i,0,n) dp[i][0][p[i+1]] = 1;
    FOR(j,0,n-1) {
        FOR(i,0,n) {
            FOR(k,0,MAXX) {
                if (dp[i][j][k]) {
                    FOR(l,i+1,n) {
                        dp[l][j+1][k|(p[l+1]-p[i+1])] = 1;
                    }
                }

            }
        }
    }
    int res = LLINF;
    FOR(x,A-1,B) {
        FOR(k,0,MAXX) {
            if (dp[n-1][x][k]) res = min(res,k);
        }
    }
    cout << res;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 696 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1108 KB Output is correct
13 Correct 2 ms 1108 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 440 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1072 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 1 ms 1076 KB Output is correct
25 Correct 1 ms 1076 KB Output is correct
26 Correct 1 ms 1080 KB Output is correct
27 Runtime error 2 ms 340 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 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1076 KB Output is correct
12 Correct 2 ms 1108 KB Output is correct
13 Correct 1 ms 1072 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 304 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 2 ms 824 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 1108 KB Output is correct
23 Correct 1 ms 1108 KB Output is correct
24 Correct 2 ms 1108 KB Output is correct
25 Correct 1 ms 1076 KB Output is correct
26 Correct 1 ms 1108 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 2 ms 1492 KB Output is correct
29 Correct 4 ms 3156 KB Output is correct
30 Correct 4 ms 3800 KB Output is correct
31 Correct 6 ms 5172 KB Output is correct
32 Correct 5 ms 5168 KB Output is correct
33 Correct 5 ms 5176 KB Output is correct
34 Correct 6 ms 5296 KB Output is correct
35 Correct 5 ms 5204 KB Output is correct
36 Correct 5 ms 5204 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 820 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 1 ms 1076 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 1108 KB Output is correct
15 Correct 2 ms 1492 KB Output is correct
16 Correct 3 ms 3120 KB Output is correct
17 Correct 4 ms 3760 KB Output is correct
18 Correct 6 ms 5204 KB Output is correct
19 Correct 5 ms 5140 KB Output is correct
20 Correct 5 ms 5204 KB Output is correct
21 Correct 5 ms 5300 KB Output is correct
22 Correct 6 ms 5204 KB Output is correct
23 Correct 6 ms 5204 KB Output is correct
24 Correct 6 ms 5332 KB Output is correct
25 Incorrect 11 ms 8532 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 368 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 688 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 2 ms 1076 KB Output is correct
13 Correct 1 ms 1108 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 2 ms 1076 KB Output is correct
23 Correct 2 ms 1072 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 1076 KB Output is correct
26 Correct 1 ms 1076 KB Output is correct
27 Runtime error 2 ms 304 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 308 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 436 KB Output is correct
6 Correct 1 ms 692 KB Output is correct
7 Correct 1 ms 816 KB Output is correct
8 Correct 1 ms 1108 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 2 ms 1108 KB Output is correct
13 Correct 2 ms 1108 KB Output is correct
14 Runtime error 1 ms 340 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -