oj.uz

답안 #168337

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
168337 2019-12-12T14:32:04 Z mat_v Bali Sculptures (APIO15_sculpture) C++14
21 / 100
 1000 ms 1528 KB 
#include <bits/stdc++.h>
#define maxn 2005
#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
using namespace std;
typedef long long ll;
const ll inf = 0x3f3f3f3f;
ll niz[maxn];
int n;
ll pref[maxn];
ll a,b;
ll mini;
bool bio[maxn][maxn];
bool dp[maxn][maxn];
int dp2[maxn];
bool check(ll broj){
    if(a == 1){
        dp[0][0] = 1;
        ff(i,1,n){
            dp[0][i] = dp[i][0] = 0;
        }
        ff(i,1,n){
            ff(j,1,n)dp[i][j] = 0;
        }
        ff(i,1,n){
            ff(j,1,b){
                ff(k,0,i - 1){
                    ll sta = pref[i] - pref[k];
                    if((sta | broj) == broj)dp[i][j] |= dp[k][j - 1];
                }
            }
        }
        ff(i,a,b){
            if(dp[n][i])return 1;
        }
        return 0;
    }else{
        dp2[0] = 0;
        ff(i,1,n){
            dp2[i] = 1e9;
            ff(j,0,i - 1){
                ll sta = pref[i] - pref[j];
                if((sta | broj) == broj)dp2[i] = min(dp2[i], dp2[j] + 1);
            }
        }
        return dp2[n] <= b;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin >> n >> a >> b;
    for(int i=1; i<=n; i++)cin >> niz[i];
    pref[0] = 0;
    for(int i=1; i<=n; i++)pref[i] = pref[i - 1] + niz[i];
    ll st = (1LL<<62) - 1;
    for(int i=61; i>=0; i--){
        if(check(st - (1LL<<i)))st -= (1LL<<i);
    }
    cout << st << endl;
    return 0;
}
/*
8 1 4
1 2 1 1 1 0 4 6
*/

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 380 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 2 ms 376 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 388 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 4 ms 476 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 504 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 5 ms 504 KB Output is correct
22 Correct 5 ms 504 KB Output is correct
23 Correct 4 ms 376 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 5 ms 504 KB Output is correct
26 Correct 11 ms 504 KB Output is correct
27 Correct 33 ms 504 KB Output is correct
28 Correct 70 ms 504 KB Output is correct
29 Correct 69 ms 592 KB Output is correct
30 Correct 3 ms 504 KB Output is correct
31 Correct 34 ms 504 KB Output is correct
32 Correct 52 ms 632 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 392 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 2 ms 376 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 388 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 380 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 496 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 4 ms 504 KB Output is correct
28 Correct 5 ms 376 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 5 ms 376 KB Output is correct
32 Correct 5 ms 376 KB Output is correct
33 Correct 4 ms 508 KB Output is correct
34 Correct 6 ms 504 KB Output is correct
35 Correct 5 ms 504 KB Output is correct
36 Correct 11 ms 504 KB Output is correct
37 Correct 33 ms 504 KB Output is correct
38 Correct 70 ms 592 KB Output is correct
39 Correct 69 ms 588 KB Output is correct
40 Correct 3 ms 504 KB Output is correct
41 Correct 34 ms 504 KB Output is correct
42 Correct 52 ms 504 KB Output is correct
43 Correct 5 ms 376 KB Output is correct
44 Correct 10 ms 504 KB Output is correct
45 Correct 26 ms 504 KB Output is correct
46 Correct 54 ms 504 KB Output is correct
47 Correct 53 ms 632 KB Output is correct
48 Correct 3 ms 504 KB Output is correct
49 Correct 56 ms 504 KB Output is correct
50 Correct 55 ms 504 KB Output is correct
51 Correct 14 ms 624 KB Output is correct
52 Execution timed out 1081 ms 1528 KB Time limit exceeded
53 Halted 0 ms 0 KB -