oj.uz

Submission #41588

# Submission time Handle Problem Language Result Execution time Memory
41588 2018-02-19T14:32:51 Z repeating Bali Sculptures (APIO15_sculpture) C++11
50 / 100
 216 ms 1160 KB 
#include <bits/stdc++.h>

#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define SF(x) scanf("%Id",&x)
#define SF2(x,y) scanf("%Id%Id",&x,&y)
#define SF3(x,y,z) scanf("%I64d%I64d%I64d",&x,&y,&z)
#define SF4(x,y,z,o) scanf("%I64d%I64d%I64d%I64d",&x,&y,&z,&o)
#define all(v) v.begin(),v.end()

using namespace std;
const long long INF = 1e9;
const long long MOD = 1e9+7;
const int MX=200015;
ll is=0,notis=0;
int n,l,r,bit;
int a[2222];
int dp[2002];
int DP(int x){
    if(x==n)R 0;
    int &ret=dp[x];
    if(ret!=-1)R ret;
    ret=INF;
    ll sum=0;
    for(int i=x;i<n;i++){
        sum+=a[i];
        if((sum&notis)==0){ret=min(ret,DP(i+1)+1);}
    }
    R ret;
}
int main(){
    cin>>n>>l>>r;
    for(int i=0;i<n;i++)cin>>a[i];
//    is=8;
    for(int i=50;i>=0;i--){
        notis+=(1LL<<i);
        MEM(dp,-1);
        if(DP(0)>r){
            is+=(1LL<<i);
            notis-=(1LL<<i);
        }
//        cout<<DP(0)<<" ";
//        cout<<is<<endl;

    }
    cout<<is;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 476 KB Output is correct
4 Correct 1 ms 552 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 1 ms 552 KB Output is correct
7 Correct 1 ms 552 KB Output is correct
8 Correct 2 ms 552 KB Output is correct
9 Correct 1 ms 552 KB Output is correct
10 Correct 2 ms 552 KB Output is correct
11 Correct 2 ms 552 KB Output is correct
12 Correct 2 ms 552 KB Output is correct
13 Correct 2 ms 552 KB Output is correct
14 Correct 1 ms 552 KB Output is correct
15 Incorrect 2 ms 552 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 552 KB Output is correct
2 Correct 1 ms 552 KB Output is correct
3 Correct 1 ms 552 KB Output is correct
4 Correct 2 ms 552 KB Output is correct
5 Correct 1 ms 552 KB Output is correct
6 Correct 1 ms 552 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 1 ms 620 KB Output is correct
14 Correct 1 ms 620 KB Output is correct
15 Incorrect 2 ms 620 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 744 KB Output is correct
2 Correct 1 ms 744 KB Output is correct
3 Correct 1 ms 744 KB Output is correct
4 Correct 2 ms 744 KB Output is correct
5 Correct 1 ms 744 KB Output is correct
6 Correct 1 ms 744 KB Output is correct
7 Correct 2 ms 744 KB Output is correct
8 Correct 2 ms 744 KB Output is correct
9 Correct 2 ms 744 KB Output is correct
10 Correct 1 ms 744 KB Output is correct
11 Correct 1 ms 744 KB Output is correct
12 Correct 2 ms 744 KB Output is correct
13 Correct 1 ms 744 KB Output is correct
14 Correct 1 ms 744 KB Output is correct
15 Incorrect 1 ms 744 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 744 KB Output is correct
2 Correct 1 ms 744 KB Output is correct
3 Correct 1 ms 744 KB Output is correct
4 Correct 2 ms 744 KB Output is correct
5 Correct 1 ms 744 KB Output is correct
6 Correct 2 ms 744 KB Output is correct
7 Correct 2 ms 744 KB Output is correct
8 Correct 1 ms 744 KB Output is correct
9 Correct 1 ms 744 KB Output is correct
10 Correct 2 ms 744 KB Output is correct
11 Correct 1 ms 744 KB Output is correct
12 Correct 1 ms 744 KB Output is correct
13 Correct 2 ms 744 KB Output is correct
14 Correct 2 ms 744 KB Output is correct
15 Correct 1 ms 744 KB Output is correct
16 Correct 2 ms 744 KB Output is correct
17 Correct 1 ms 744 KB Output is correct
18 Correct 2 ms 744 KB Output is correct
19 Correct 2 ms 744 KB Output is correct
20 Correct 2 ms 744 KB Output is correct
21 Correct 2 ms 744 KB Output is correct
22 Correct 2 ms 744 KB Output is correct
23 Correct 2 ms 744 KB Output is correct
24 Correct 2 ms 744 KB Output is correct
25 Correct 1 ms 744 KB Output is correct
26 Correct 2 ms 744 KB Output is correct
27 Correct 2 ms 744 KB Output is correct
28 Correct 2 ms 744 KB Output is correct
29 Correct 2 ms 744 KB Output is correct
30 Correct 2 ms 744 KB Output is correct
31 Correct 2 ms 744 KB Output is correct
32 Correct 2 ms 744 KB Output is correct
33 Correct 2 ms 744 KB Output is correct
34 Correct 2 ms 744 KB Output is correct
35 Correct 2 ms 744 KB Output is correct
36 Correct 3 ms 744 KB Output is correct
37 Correct 2 ms 744 KB Output is correct
38 Correct 3 ms 744 KB Output is correct
39 Correct 3 ms 744 KB Output is correct
40 Correct 4 ms 744 KB Output is correct
41 Correct 3 ms 744 KB Output is correct
42 Correct 3 ms 744 KB Output is correct
43 Correct 2 ms 744 KB Output is correct
44 Correct 2 ms 744 KB Output is correct
45 Correct 2 ms 744 KB Output is correct
46 Correct 2 ms 744 KB Output is correct
47 Correct 2 ms 744 KB Output is correct
48 Correct 2 ms 744 KB Output is correct
49 Correct 2 ms 744 KB Output is correct
50 Correct 2 ms 744 KB Output is correct
51 Correct 2 ms 744 KB Output is correct
52 Correct 28 ms 852 KB Output is correct
53 Correct 26 ms 852 KB Output is correct
54 Correct 70 ms 852 KB Output is correct
55 Correct 50 ms 852 KB Output is correct
56 Correct 146 ms 908 KB Output is correct
57 Correct 135 ms 928 KB Output is correct
58 Correct 168 ms 944 KB Output is correct
59 Correct 169 ms 1112 KB Output is correct
60 Correct 160 ms 1112 KB Output is correct
61 Correct 2 ms 1112 KB Output is correct
62 Correct 27 ms 1112 KB Output is correct
63 Correct 61 ms 1112 KB Output is correct
64 Correct 40 ms 1112 KB Output is correct
65 Correct 70 ms 1112 KB Output is correct
66 Correct 128 ms 1112 KB Output is correct
67 Correct 147 ms 1112 KB Output is correct
68 Correct 216 ms 1156 KB Output is correct
69 Correct 159 ms 1160 KB Output is correct