# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
104774 | 2019-04-09T08:37:00 Z | ekrem | Bali Sculptures (APIO15_sculpture) | C++ | 26 ms | 2200 KB |
#include <bits/stdc++.h> #define st first #define nd second #define mp make_pair #define pb push_back #define inf 1000000007 #define N 105 using namespace std; typedef long long ll; ll n, x, y, ans, a[N], pre[N], dp[N][20*N]; int main() { // freopen("in.txt", "r", stdin); // freopen("out.txt", "w", stdout); scanf("%lld %lld %lld",&n ,&x ,&y); for(int i = 1; i <= n; i++){ scanf("%lld",a + i); pre[i] = pre[i - 1] + a[i]; } for(int i = 0; i < N; i++) for(int j = 0; j < 20*N; j++) dp[i][j] = inf; dp[0][0] = 0; for(int i = 1; i <= n; i++) for(int j = 0; j < i; j++) for(int k = 0; k < 20*N; k++) if((k|(pre[i] - pre[j]) )< 20*N) dp[i][k|(pre[i] - pre[j])] = min(dp[i][k|(pre[i] - pre[j])], dp[j][k] + 1); for(int i = 0; i < 20*N; i++) if(dp[n][i] <= y){ printf("%d\n", i); return 0; } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2048 KB | Output is correct |
2 | Correct | 4 ms | 2048 KB | Output is correct |
3 | Correct | 0 ms | 2048 KB | Output is correct |
4 | Correct | 4 ms | 2048 KB | Output is correct |
5 | Correct | 5 ms | 2048 KB | Output is correct |
6 | Correct | 4 ms | 2048 KB | Output is correct |
7 | Correct | 4 ms | 2048 KB | Output is correct |
8 | Correct | 4 ms | 2048 KB | Output is correct |
9 | Correct | 6 ms | 2020 KB | Output is correct |
10 | Correct | 5 ms | 2048 KB | Output is correct |
11 | Correct | 5 ms | 2048 KB | Output is correct |
12 | Correct | 4 ms | 2048 KB | Output is correct |
13 | Correct | 5 ms | 2048 KB | Output is correct |
14 | Correct | 3 ms | 2048 KB | Output is correct |
15 | Incorrect | 4 ms | 2048 KB | Output isn't correct |
16 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2048 KB | Output is correct |
2 | Correct | 2 ms | 2048 KB | Output is correct |
3 | Correct | 3 ms | 2048 KB | Output is correct |
4 | Correct | 4 ms | 2048 KB | Output is correct |
5 | Correct | 4 ms | 2048 KB | Output is correct |
6 | Correct | 5 ms | 2048 KB | Output is correct |
7 | Correct | 5 ms | 2048 KB | Output is correct |
8 | Correct | 5 ms | 2048 KB | Output is correct |
9 | Correct | 4 ms | 2048 KB | Output is correct |
10 | Correct | 4 ms | 2048 KB | Output is correct |
11 | Correct | 5 ms | 2048 KB | Output is correct |
12 | Correct | 4 ms | 2048 KB | Output is correct |
13 | Correct | 5 ms | 2048 KB | Output is correct |
14 | Correct | 4 ms | 2048 KB | Output is correct |
15 | Incorrect | 4 ms | 2048 KB | Output isn't correct |
16 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 2048 KB | Output is correct |
2 | Correct | 4 ms | 2048 KB | Output is correct |
3 | Correct | 4 ms | 2048 KB | Output is correct |
4 | Correct | 4 ms | 2048 KB | Output is correct |
5 | Correct | 4 ms | 2048 KB | Output is correct |
6 | Correct | 5 ms | 2048 KB | Output is correct |
7 | Correct | 4 ms | 2048 KB | Output is correct |
8 | Correct | 5 ms | 2048 KB | Output is correct |
9 | Correct | 4 ms | 2048 KB | Output is correct |
10 | Correct | 4 ms | 2044 KB | Output is correct |
11 | Correct | 5 ms | 2048 KB | Output is correct |
12 | Correct | 5 ms | 2048 KB | Output is correct |
13 | Correct | 5 ms | 2048 KB | Output is correct |
14 | Correct | 4 ms | 2048 KB | Output is correct |
15 | Correct | 5 ms | 2048 KB | Output is correct |
16 | Correct | 6 ms | 2048 KB | Output is correct |
17 | Correct | 7 ms | 2096 KB | Output is correct |
18 | Correct | 8 ms | 2048 KB | Output is correct |
19 | Correct | 8 ms | 2048 KB | Output is correct |
20 | Correct | 8 ms | 2048 KB | Output is correct |
21 | Correct | 10 ms | 2048 KB | Output is correct |
22 | Correct | 10 ms | 2048 KB | Output is correct |
23 | Correct | 9 ms | 2048 KB | Output is correct |
24 | Correct | 9 ms | 2036 KB | Output is correct |
25 | Correct | 12 ms | 2048 KB | Output is correct |
26 | Correct | 14 ms | 2048 KB | Output is correct |
27 | Correct | 18 ms | 2200 KB | Output is correct |
28 | Correct | 26 ms | 2048 KB | Output is correct |
29 | Correct | 19 ms | 2048 KB | Output is correct |
30 | Correct | 17 ms | 2048 KB | Output is correct |
31 | Correct | 21 ms | 2048 KB | Output is correct |
32 | Correct | 18 ms | 2048 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 2048 KB | Output is correct |
2 | Correct | 3 ms | 2048 KB | Output is correct |
3 | Correct | 4 ms | 2048 KB | Output is correct |
4 | Correct | 4 ms | 2048 KB | Output is correct |
5 | Correct | 4 ms | 2048 KB | Output is correct |
6 | Correct | 5 ms | 2048 KB | Output is correct |
7 | Correct | 4 ms | 2048 KB | Output is correct |
8 | Correct | 5 ms | 2048 KB | Output is correct |
9 | Correct | 5 ms | 2048 KB | Output is correct |
10 | Correct | 5 ms | 2048 KB | Output is correct |
11 | Correct | 4 ms | 2048 KB | Output is correct |
12 | Correct | 4 ms | 2048 KB | Output is correct |
13 | Correct | 5 ms | 2048 KB | Output is correct |
14 | Correct | 4 ms | 2048 KB | Output is correct |
15 | Incorrect | 3 ms | 2048 KB | Output isn't correct |
16 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 2048 KB | Output is correct |
2 | Correct | 5 ms | 2048 KB | Output is correct |
3 | Correct | 4 ms | 2048 KB | Output is correct |
4 | Correct | 4 ms | 2048 KB | Output is correct |
5 | Correct | 5 ms | 2048 KB | Output is correct |
6 | Correct | 5 ms | 2048 KB | Output is correct |
7 | Correct | 5 ms | 2032 KB | Output is correct |
8 | Correct | 5 ms | 2048 KB | Output is correct |
9 | Correct | 5 ms | 2048 KB | Output is correct |
10 | Correct | 6 ms | 2048 KB | Output is correct |
11 | Correct | 2 ms | 2048 KB | Output is correct |
12 | Correct | 5 ms | 2048 KB | Output is correct |
13 | Correct | 4 ms | 2048 KB | Output is correct |
14 | Incorrect | 4 ms | 2048 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |