oj.uz

Submission #25064

# Submission time Handle Problem Language Result Execution time Memory
25064 2017-06-20T05:44:07 Z 윤교준(#1055) Bali Sculptures (APIO15_sculpture) C++11
100 / 100
 109 ms 2080 KB 
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <string>
#define pb push_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define befv(V) ((V)[(sz(V)-2)])
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define upmin(a,b) (a)=min((a),(b))
#define upmax(a,b) (a)=max((a),(b))
#define INF (1100000099)
#define INFLL (1100000000000000099ll)
#define MAXN (3333)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;

ll S[MAXN];
int Y[MAXN];
int N, A, B;

void input() {
    scanf("%d%d%d", &N, &A, &B);
    for(int i = 1; i <= N; i++) scanf("%d", &Y[i]);
    for(int i = 1; i <= N; i++) S[i] = S[i-1] + Y[i];
}
bool bitgood(ll a, ll b) { return (a|b) == b; }
int d1[MAXN];
bool f1(ll n) {
    fill(d1, d1+N+1, INF);
    for(int i = 1; i <= N; i++) {
        int &ret = d1[i];
        if(bitgood(S[i], n)) { ret = 1; continue; }
        for(int j = 1; j < i; j++) {
            if(ret <= d1[j]+1) continue;
            if(bitgood(S[i]-S[j], n)) ret = d1[j]+1;
        }
    }
    return d1[N] <= B;
}
bool d[105][105];
bool f2(ll n) {
    for(int i = 0; i <= N; i++) fill(d[i], d[i]+N+1, false);
    for(int i = 1; i <= N; i++) {
        if(bitgood(S[i], n)) d[i][1] = true;
        for(int j = 2; j <= i; j++) {
            bool &ret = d[i][j];
            for(int k = j-1; k < i; k++) {
                if(!d[k][j-1] || !bitgood(S[i]-S[k], n)) continue;
                ret = true; break;
            }
        }
    }
    for(int X = A; X <= B; X++) if(d[N][X]) return true;
    return false;
}
bool f(ll n) { return 1 == A ? f1(n) : f2(n); }
ll getAns() {
    ll ret = 0;
    for(int i = 62; ~i; i--) {
        if(!f(ret + (1ll<<i) - 1)) ret += (1ll<<i);
    }
    return ret;
}
int main() {
    input();
    printf("%lld\n", getAns());
    return 0;
}

Compilation message

sculpture.cpp: In function 'void input()':
sculpture.cpp:39:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &N, &A, &B);
                                ^
sculpture.cpp:40:51: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= N; i++) scanf("%d", &Y[i]);
                                                   ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2080 KB Output is correct
2 Correct 0 ms 2080 KB Output is correct
3 Correct 0 ms 2080 KB Output is correct
4 Correct 0 ms 2080 KB Output is correct
5 Correct 0 ms 2080 KB Output is correct
6 Correct 0 ms 2080 KB Output is correct
7 Correct 0 ms 2080 KB Output is correct
8 Correct 0 ms 2080 KB Output is correct
9 Correct 0 ms 2080 KB Output is correct
10 Correct 0 ms 2080 KB Output is correct
11 Correct 0 ms 2080 KB Output is correct
12 Correct 0 ms 2080 KB Output is correct
13 Correct 0 ms 2080 KB Output is correct
14 Correct 0 ms 2080 KB Output is correct
15 Correct 0 ms 2080 KB Output is correct
16 Correct 0 ms 2080 KB Output is correct
17 Correct 0 ms 2080 KB Output is correct
18 Correct 0 ms 2080 KB Output is correct
19 Correct 0 ms 2080 KB Output is correct
20 Correct 0 ms 2080 KB Output is correct
21 Correct 0 ms 2080 KB Output is correct
22 Correct 0 ms 2080 KB Output is correct
23 Correct 0 ms 2080 KB Output is correct
24 Correct 0 ms 2080 KB Output is correct
25 Correct 0 ms 2080 KB Output is correct
26 Correct 0 ms 2080 KB Output is correct
27 Correct 0 ms 2080 KB Output is correct
28 Correct 0 ms 2080 KB Output is correct
29 Correct 0 ms 2080 KB Output is correct
30 Correct 0 ms 2080 KB Output is correct
31 Correct 0 ms 2080 KB Output is correct
32 Correct 0 ms 2080 KB Output is correct
33 Correct 0 ms 2080 KB Output is correct
34 Correct 0 ms 2080 KB Output is correct
35 Correct 0 ms 2080 KB Output is correct
36 Correct 0 ms 2080 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2080 KB Output is correct
2 Correct 0 ms 2080 KB Output is correct
3 Correct 0 ms 2080 KB Output is correct
4 Correct 0 ms 2080 KB Output is correct
5 Correct 0 ms 2080 KB Output is correct
6 Correct 0 ms 2080 KB Output is correct
7 Correct 0 ms 2080 KB Output is correct
8 Correct 0 ms 2080 KB Output is correct
9 Correct 0 ms 2080 KB Output is correct
10 Correct 0 ms 2080 KB Output is correct
11 Correct 0 ms 2080 KB Output is correct
12 Correct 0 ms 2080 KB Output is correct
13 Correct 0 ms 2080 KB Output is correct
14 Correct 0 ms 2080 KB Output is correct
15 Correct 0 ms 2080 KB Output is correct
16 Correct 0 ms 2080 KB Output is correct
17 Correct 0 ms 2080 KB Output is correct
18 Correct 0 ms 2080 KB Output is correct
19 Correct 0 ms 2080 KB Output is correct
20 Correct 0 ms 2080 KB Output is correct
21 Correct 0 ms 2080 KB Output is correct
22 Correct 0 ms 2080 KB Output is correct
23 Correct 0 ms 2080 KB Output is correct
24 Correct 0 ms 2080 KB Output is correct
25 Correct 0 ms 2080 KB Output is correct
26 Correct 0 ms 2080 KB Output is correct
27 Correct 0 ms 2080 KB Output is correct
28 Correct 0 ms 2080 KB Output is correct
29 Correct 0 ms 2080 KB Output is correct
30 Correct 0 ms 2080 KB Output is correct
31 Correct 0 ms 2080 KB Output is correct
32 Correct 0 ms 2080 KB Output is correct
33 Correct 0 ms 2080 KB Output is correct
34 Correct 0 ms 2080 KB Output is correct
35 Correct 0 ms 2080 KB Output is correct
36 Correct 0 ms 2080 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2080 KB Output is correct
2 Correct 0 ms 2080 KB Output is correct
3 Correct 0 ms 2080 KB Output is correct
4 Correct 0 ms 2080 KB Output is correct
5 Correct 0 ms 2080 KB Output is correct
6 Correct 0 ms 2080 KB Output is correct
7 Correct 0 ms 2080 KB Output is correct
8 Correct 0 ms 2080 KB Output is correct
9 Correct 0 ms 2080 KB Output is correct
10 Correct 0 ms 2080 KB Output is correct
11 Correct 0 ms 2080 KB Output is correct
12 Correct 0 ms 2080 KB Output is correct
13 Correct 0 ms 2080 KB Output is correct
14 Correct 0 ms 2080 KB Output is correct
15 Correct 0 ms 2080 KB Output is correct
16 Correct 0 ms 2080 KB Output is correct
17 Correct 0 ms 2080 KB Output is correct
18 Correct 0 ms 2080 KB Output is correct
19 Correct 0 ms 2080 KB Output is correct
20 Correct 0 ms 2080 KB Output is correct
21 Correct 0 ms 2080 KB Output is correct
22 Correct 0 ms 2080 KB Output is correct
23 Correct 0 ms 2080 KB Output is correct
24 Correct 0 ms 2080 KB Output is correct
25 Correct 0 ms 2080 KB Output is correct
26 Correct 0 ms 2080 KB Output is correct
27 Correct 0 ms 2080 KB Output is correct
28 Correct 0 ms 2080 KB Output is correct
29 Correct 0 ms 2080 KB Output is correct
30 Correct 0 ms 2080 KB Output is correct
31 Correct 0 ms 2080 KB Output is correct
32 Correct 0 ms 2080 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2080 KB Output is correct
2 Correct 0 ms 2080 KB Output is correct
3 Correct 0 ms 2080 KB Output is correct
4 Correct 0 ms 2080 KB Output is correct
5 Correct 0 ms 2080 KB Output is correct
6 Correct 0 ms 2080 KB Output is correct
7 Correct 0 ms 2080 KB Output is correct
8 Correct 0 ms 2080 KB Output is correct
9 Correct 0 ms 2080 KB Output is correct
10 Correct 0 ms 2080 KB Output is correct
11 Correct 0 ms 2080 KB Output is correct
12 Correct 0 ms 2080 KB Output is correct
13 Correct 0 ms 2080 KB Output is correct
14 Correct 0 ms 2080 KB Output is correct
15 Correct 0 ms 2080 KB Output is correct
16 Correct 0 ms 2080 KB Output is correct
17 Correct 0 ms 2080 KB Output is correct
18 Correct 0 ms 2080 KB Output is correct
19 Correct 0 ms 2080 KB Output is correct
20 Correct 0 ms 2080 KB Output is correct
21 Correct 0 ms 2080 KB Output is correct
22 Correct 0 ms 2080 KB Output is correct
23 Correct 0 ms 2080 KB Output is correct
24 Correct 0 ms 2080 KB Output is correct
25 Correct 0 ms 2080 KB Output is correct
26 Correct 0 ms 2080 KB Output is correct
27 Correct 0 ms 2080 KB Output is correct
28 Correct 0 ms 2080 KB Output is correct
29 Correct 0 ms 2080 KB Output is correct
30 Correct 0 ms 2080 KB Output is correct
31 Correct 0 ms 2080 KB Output is correct
32 Correct 0 ms 2080 KB Output is correct
33 Correct 0 ms 2080 KB Output is correct
34 Correct 0 ms 2080 KB Output is correct
35 Correct 0 ms 2080 KB Output is correct
36 Correct 0 ms 2080 KB Output is correct
37 Correct 0 ms 2080 KB Output is correct
38 Correct 0 ms 2080 KB Output is correct
39 Correct 0 ms 2080 KB Output is correct
40 Correct 0 ms 2080 KB Output is correct
41 Correct 0 ms 2080 KB Output is correct
42 Correct 0 ms 2080 KB Output is correct
43 Correct 0 ms 2080 KB Output is correct
44 Correct 0 ms 2080 KB Output is correct
45 Correct 0 ms 2080 KB Output is correct
46 Correct 0 ms 2080 KB Output is correct
47 Correct 0 ms 2080 KB Output is correct
48 Correct 0 ms 2080 KB Output is correct
49 Correct 0 ms 2080 KB Output is correct
50 Correct 0 ms 2080 KB Output is correct
51 Correct 0 ms 2080 KB Output is correct
52 Correct 0 ms 2080 KB Output is correct
53 Correct 0 ms 2080 KB Output is correct
54 Correct 0 ms 2080 KB Output is correct
55 Correct 0 ms 2080 KB Output is correct
56 Correct 0 ms 2080 KB Output is correct
57 Correct 0 ms 2080 KB Output is correct
58 Correct 0 ms 2080 KB Output is correct
59 Correct 0 ms 2080 KB Output is correct
60 Correct 0 ms 2080 KB Output is correct
61 Correct 0 ms 2080 KB Output is correct
62 Correct 0 ms 2080 KB Output is correct
63 Correct 0 ms 2080 KB Output is correct
64 Correct 0 ms 2080 KB Output is correct
65 Correct 0 ms 2080 KB Output is correct
66 Correct 3 ms 2080 KB Output is correct
67 Correct 3 ms 2080 KB Output is correct
68 Correct 6 ms 2080 KB Output is correct
69 Correct 9 ms 2080 KB Output is correct
70 Correct 9 ms 2080 KB Output is correct
71 Correct 6 ms 2080 KB Output is correct
72 Correct 9 ms 2080 KB Output is correct
73 Correct 13 ms 2080 KB Output is correct
74 Correct 16 ms 2080 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2080 KB Output is correct
2 Correct 0 ms 2080 KB Output is correct
3 Correct 0 ms 2080 KB Output is correct
4 Correct 0 ms 2080 KB Output is correct
5 Correct 0 ms 2080 KB Output is correct
6 Correct 0 ms 2080 KB Output is correct
7 Correct 0 ms 2080 KB Output is correct
8 Correct 0 ms 2080 KB Output is correct
9 Correct 0 ms 2080 KB Output is correct
10 Correct 0 ms 2080 KB Output is correct
11 Correct 0 ms 2080 KB Output is correct
12 Correct 0 ms 2080 KB Output is correct
13 Correct 0 ms 2080 KB Output is correct
14 Correct 0 ms 2080 KB Output is correct
15 Correct 0 ms 2080 KB Output is correct
16 Correct 0 ms 2080 KB Output is correct
17 Correct 0 ms 2080 KB Output is correct
18 Correct 0 ms 2080 KB Output is correct
19 Correct 0 ms 2080 KB Output is correct
20 Correct 0 ms 2080 KB Output is correct
21 Correct 0 ms 2080 KB Output is correct
22 Correct 0 ms 2080 KB Output is correct
23 Correct 0 ms 2080 KB Output is correct
24 Correct 0 ms 2080 KB Output is correct
25 Correct 0 ms 2080 KB Output is correct
26 Correct 0 ms 2080 KB Output is correct
27 Correct 0 ms 2080 KB Output is correct
28 Correct 0 ms 2080 KB Output is correct
29 Correct 0 ms 2080 KB Output is correct
30 Correct 0 ms 2080 KB Output is correct
31 Correct 0 ms 2080 KB Output is correct
32 Correct 0 ms 2080 KB Output is correct
33 Correct 0 ms 2080 KB Output is correct
34 Correct 0 ms 2080 KB Output is correct
35 Correct 0 ms 2080 KB Output is correct
36 Correct 0 ms 2080 KB Output is correct
37 Correct 0 ms 2080 KB Output is correct
38 Correct 0 ms 2080 KB Output is correct
39 Correct 0 ms 2080 KB Output is correct
40 Correct 0 ms 2080 KB Output is correct
41 Correct 0 ms 2080 KB Output is correct
42 Correct 0 ms 2080 KB Output is correct
43 Correct 0 ms 2080 KB Output is correct
44 Correct 0 ms 2080 KB Output is correct
45 Correct 0 ms 2080 KB Output is correct
46 Correct 0 ms 2080 KB Output is correct
47 Correct 0 ms 2080 KB Output is correct
48 Correct 0 ms 2080 KB Output is correct
49 Correct 0 ms 2080 KB Output is correct
50 Correct 0 ms 2080 KB Output is correct
51 Correct 0 ms 2080 KB Output is correct
52 Correct 6 ms 2080 KB Output is correct
53 Correct 9 ms 2080 KB Output is correct
54 Correct 26 ms 2080 KB Output is correct
55 Correct 23 ms 2080 KB Output is correct
56 Correct 73 ms 2080 KB Output is correct
57 Correct 69 ms 2080 KB Output is correct
58 Correct 93 ms 2080 KB Output is correct
59 Correct 89 ms 2080 KB Output is correct
60 Correct 69 ms 2080 KB Output is correct
61 Correct 0 ms 2080 KB Output is correct
62 Correct 9 ms 2080 KB Output is correct
63 Correct 23 ms 2080 KB Output is correct
64 Correct 16 ms 2080 KB Output is correct
65 Correct 29 ms 2080 KB Output is correct
66 Correct 53 ms 2080 KB Output is correct
67 Correct 59 ms 2080 KB Output is correct
68 Correct 109 ms 2080 KB Output is correct
69 Correct 66 ms 2080 KB Output is correct