답안 #261350

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
261350	2020-08-11T16:26:35 Z	uacoder123	Bali Sculptures (APIO15_sculpture)	C++14	21 / 100	5 ms	416 KB

sculpture

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) lli(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))

typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
lli n,a,b;
lli dp[2001],dp2[2001][2001],arr[2001];
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin>>n>>a>>b;
  for(lli i=0;i<n;++i)
  	cin>>arr[i];
  lli cur=0;
  if(a==1)
  {
  	for(lli i=32;i>=0;--i)
  	{
  		cur+=(1LL<<i);
  		for(lli j=0;j<n;++j)
  		{
  			lli s=0;
  			dp[j]=100000;
  			for(lli k=j;k>=0;--k)
  			{
  				s+=arr[k];
  				if((cur&s)==0)
  					dp[j]=min(dp[j],1+((k==0)?0:dp[k-1]));
  			}
  		}
  		if(dp[n-1]>b)
  			cur-=(1LL<<i);
  	}
  }
  else
  {
  	for(lli i=32;i>=0;--i)
  	{
  		cur+=(1<<i);
  		for(lli j=0;j<n;++j)
  		{
  			for(lli k=0;k<=b;++k)
  			{
  				lli s=0;
  				dp2[j][k]=0;
  				if(k==0)
  					continue;
  				for(lli l=j;l>=0;--l)
  				{
  					s+=arr[l];
  					if((cur&s)==0)
  					{
  						if(l==0)
  						{
  							if(k==1)
  								dp2[j][k]=1;
  						}
  						else
  							dp2[j][k]=max(dp2[j][k],dp2[l-1][k-1]);
  					}
  				}
  			}
  		}
  		lli ch=0;
  		for(lli j=a;j<=b;++j)
  			ch=max(dp2[n-1][j],ch);
  		if(!ch)
  			cur-=(1LL<<i);
  	}
  }
  cout<<(cur^8589934591)<<endl;
  return(0);
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 29.0

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

답안 #261350

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 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
0 / 29.0