답안 #48623 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
48623	2018-05-17T12:37:38 Z	okaybody10	Bali Sculptures (APIO15_sculpture)	C++11	50 / 100	158 ms	1476 KB

sculpture

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=2007;
ll partsum[N];
bool dp2[N][N];
int n,A,B,dp[N],bit[60];
bool solve()
{
    ll val=0;
    for(int i=0;i<50;i++) val+=bit[i]*(1LL<<i);
    if(A==1)
    {
        dp[0]=0;
        for(int i=1;i<=n;i++)
        {
            dp[i]=N;
            for(int j=0;j<i;j++)
            {
                if(((partsum[i]-partsum[j]) | val)== val) dp[i]=min(dp[i],dp[j]+1);
            }
        }
        if(dp[n]<=B) return true;
        return false;
    }
    dp2[0][0]=true;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=B;j++)
        {
            for(int k=0;k<i;k++)
            {
                if(dp2[k][j-1] && ((partsum[i]-partsum[k])| val) == val)  {
                    dp2[i][j]=true;
                    break;
                }
            }
        }
    }
    for(int i=A;i<=B;i++)
        if(dp2[n][i]) return true;
    return false;
}
int main()
{
    cin>>n>>A>>B;
    for(int i=1,x;i<=n;i++) cin>>x, partsum[i]=partsum[i-1]+x;
    for(int i=0;i<50;i++) bit[i]=1;
    for(int i=49;i>=0;i--)
    {
        bit[i]=0;
        bool ok=solve(); if(!ok) bit[i]=1;
    }
    ll res=0;
    for(int i=0;i<50;i++) res+=bit[i]*(1LL<<i);
    cout<<res<<endl;
}

Subtask #1
0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	252 KB	Output is correct
2	Correct	2 ms	360 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	2 ms	420 KB	Output is correct
5	Correct	2 ms	556 KB	Output is correct
6	Correct	2 ms	556 KB	Output is correct
7	Correct	2 ms	556 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	2 ms	624 KB	Output is correct
10	Correct	2 ms	628 KB	Output is correct
11	Correct	2 ms	628 KB	Output is correct
12	Correct	2 ms	636 KB	Output is correct
13	Correct	2 ms	636 KB	Output is correct
14	Incorrect	2 ms	688 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #2
0 / 16.0

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

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	840 KB	Output is correct
2	Correct	2 ms	840 KB	Output is correct
3	Correct	2 ms	840 KB	Output is correct
4	Correct	2 ms	840 KB	Output is correct
5	Correct	2 ms	840 KB	Output is correct
6	Correct	2 ms	840 KB	Output is correct
7	Correct	2 ms	840 KB	Output is correct
8	Correct	2 ms	840 KB	Output is correct
9	Correct	2 ms	840 KB	Output is correct
10	Correct	2 ms	840 KB	Output is correct
11	Correct	2 ms	840 KB	Output is correct
12	Correct	2 ms	840 KB	Output is correct
13	Correct	2 ms	840 KB	Output is correct
14	Correct	2 ms	840 KB	Output is correct
15	Correct	2 ms	840 KB	Output is correct
16	Correct	2 ms	840 KB	Output is correct
17	Correct	2 ms	840 KB	Output is correct
18	Correct	2 ms	840 KB	Output is correct
19	Correct	2 ms	840 KB	Output is correct
20	Correct	2 ms	840 KB	Output is correct
21	Correct	2 ms	840 KB	Output is correct
22	Correct	3 ms	948 KB	Output is correct
23	Correct	2 ms	948 KB	Output is correct
24	Correct	2 ms	948 KB	Output is correct
25	Correct	2 ms	948 KB	Output is correct
26	Correct	2 ms	948 KB	Output is correct
27	Correct	2 ms	948 KB	Output is correct
28	Correct	3 ms	948 KB	Output is correct
29	Correct	2 ms	976 KB	Output is correct
30	Correct	3 ms	980 KB	Output is correct
31	Correct	2 ms	980 KB	Output is correct
32	Correct	2 ms	980 KB	Output is correct

Subtask #4
0 / 25.0

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

Subtask #5
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	1052 KB	Output is correct
2	Correct	2 ms	1052 KB	Output is correct
3	Correct	2 ms	1052 KB	Output is correct
4	Correct	2 ms	1052 KB	Output is correct
5	Correct	2 ms	1052 KB	Output is correct
6	Correct	2 ms	1052 KB	Output is correct
7	Correct	2 ms	1052 KB	Output is correct
8	Correct	2 ms	1052 KB	Output is correct
9	Correct	2 ms	1052 KB	Output is correct
10	Correct	2 ms	1052 KB	Output is correct
11	Correct	2 ms	1052 KB	Output is correct
12	Correct	2 ms	1052 KB	Output is correct
13	Correct	2 ms	1052 KB	Output is correct
14	Correct	2 ms	1052 KB	Output is correct
15	Correct	2 ms	1052 KB	Output is correct
16	Correct	2 ms	1116 KB	Output is correct
17	Correct	2 ms	1116 KB	Output is correct
18	Correct	2 ms	1116 KB	Output is correct
19	Correct	2 ms	1116 KB	Output is correct
20	Correct	2 ms	1116 KB	Output is correct
21	Correct	2 ms	1116 KB	Output is correct
22	Correct	2 ms	1116 KB	Output is correct
23	Correct	2 ms	1116 KB	Output is correct
24	Correct	2 ms	1116 KB	Output is correct
25	Correct	2 ms	1116 KB	Output is correct
26	Correct	2 ms	1116 KB	Output is correct
27	Correct	2 ms	1156 KB	Output is correct
28	Correct	2 ms	1156 KB	Output is correct
29	Correct	2 ms	1156 KB	Output is correct
30	Correct	2 ms	1156 KB	Output is correct
31	Correct	2 ms	1156 KB	Output is correct
32	Correct	2 ms	1156 KB	Output is correct
33	Correct	2 ms	1156 KB	Output is correct
34	Correct	2 ms	1156 KB	Output is correct
35	Correct	2 ms	1156 KB	Output is correct
36	Correct	2 ms	1156 KB	Output is correct
37	Correct	3 ms	1156 KB	Output is correct
38	Correct	2 ms	1156 KB	Output is correct
39	Correct	2 ms	1208 KB	Output is correct
40	Correct	2 ms	1208 KB	Output is correct
41	Correct	3 ms	1208 KB	Output is correct
42	Correct	2 ms	1208 KB	Output is correct
43	Correct	2 ms	1208 KB	Output is correct
44	Correct	2 ms	1208 KB	Output is correct
45	Correct	2 ms	1208 KB	Output is correct
46	Correct	2 ms	1208 KB	Output is correct
47	Correct	2 ms	1208 KB	Output is correct
48	Correct	3 ms	1208 KB	Output is correct
49	Correct	2 ms	1208 KB	Output is correct
50	Correct	2 ms	1208 KB	Output is correct
51	Correct	2 ms	1208 KB	Output is correct
52	Correct	16 ms	1208 KB	Output is correct
53	Correct	24 ms	1208 KB	Output is correct
54	Correct	43 ms	1208 KB	Output is correct
55	Correct	40 ms	1208 KB	Output is correct
56	Correct	158 ms	1208 KB	Output is correct
57	Correct	145 ms	1316 KB	Output is correct
58	Correct	142 ms	1344 KB	Output is correct
59	Correct	145 ms	1356 KB	Output is correct
60	Correct	152 ms	1356 KB	Output is correct
61	Correct	2 ms	1356 KB	Output is correct
62	Correct	24 ms	1356 KB	Output is correct
63	Correct	43 ms	1356 KB	Output is correct
64	Correct	40 ms	1356 KB	Output is correct
65	Correct	75 ms	1444 KB	Output is correct
66	Correct	110 ms	1444 KB	Output is correct
67	Correct	144 ms	1476 KB	Output is correct
68	Correct	148 ms	1476 KB	Output is correct
69	Correct	143 ms	1476 KB	Output is correct

답안 #48623

Compilation message

Subtask #1 0 / 9.0

Subtask #2 0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 0 / 25.0

Subtask #5 29.0 / 29.0

Subtask #1
0 / 9.0

Subtask #2
0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
0 / 25.0

Subtask #5
29.0 / 29.0