Submission #142822

#	Time	Username	Problem	Language	Result	Execution time	Memory
142822		cheetose	Bali Sculptures (APIO15_sculpture)	C++11	100 / 100	147 ms	508 KiB

sculpture

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define INF (1LL<<50)-1
#define PI 3.14159265358979323846264
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset(a,0,sizeof(a));
#define MEM_1(a) memset(a,-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
ll MOD = 1000000000;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,-1,1,0 }, dy[] = { 1,0,0,-1 };
int ddx[] = { 0,0,1,1,1,-1,-1,-1 }, ddy[] = { 1,-1,1,0,-1,1,0,-1 };

ll sum[2001];
int n, a, b;
const int inf = 987654321;
int main() {
	scanf("%d%d%d", &n, &a, &b);
	fup(i, 1, n, 1)
	{
		ll x;
		scanf("%lld", &x);
		sum[i] = x + sum[i - 1];
	}
	if (a != 1)
	{
		bool d[101][101];
		ll now = INF;
		fdn(k, 49, 0, 1)
		{
			MEM0(d);
			d[0][0] = 1;
			now -= (1LL << k);
			fup(k, 1, b, 1)
			{
				fup(i, 1, n, 1)
				{
					fup(j, 0, i - 1, 1)
					{
						if (d[k - 1][j] && ((sum[i] - sum[j]) | now) == now)d[k][i] = 1;
					}
				}
			}
			bool ok = 0;
			fup(i, a, b, 1)
				if (d[i][n])
				{
					ok = 1;
					break;
				}
			if (!ok)now += (1LL << k);
		}
		printf("%lld", now);
	}
	else
	{
		int d[2001];
		d[0] = 0;
		ll now = INF;
		fdn(k, 49, 0, 1)
		{
			fill(d + 1, d + n + 1, inf);
			now -= (1LL << k);
			fup(i, 1, n, 1)
			{
				fup(j, 0, i - 1, 1)
				{
					if (((sum[i] - sum[j]) | now) == now)d[i] = min(d[i], d[j] + 1);
				}
			}
			if (d[n] > b)now += (1LL << k);
		}
		printf("%lld", now);
	}
}

Compilation message (stderr)

sculpture.cpp: In function 'int main()':
sculpture.cpp:60:7: 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:64:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &x);
   ~~~~~^~~~~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 25 / 25
• Subtask 5: 29 / 29