oj.uz

Submission #104805

# Submission time Handle Problem Language Result Execution time Memory
104805 2019-04-09T09:39:05 Z ekrem Bali Sculptures (APIO15_sculpture) C++
0 / 100
 3 ms 540 KB 
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define inf 1000000007
#define N 1000005
using namespace std;

typedef long long ll;

ll n, X, y, ans, a[N], dp[N], dpp[105][105], pre[N];

bool bak(ll x){
	for(int i = 1; i <= n; i++)
		dp[i] = inf;

	for(int i = 0; i < 105; i++)
		for(int j = 0; j < 105; j++)
			dpp[i][j] = 0;
	dpp[0][0] = 1;

	for(int i = 1; i <= n; i++)
		for(int j = 0; j < n; j++){
			ll su = pre[i] - pre[j];
			if(su - (x&su) == 0 ){


				if(n <= 100){
					for(int k = 1; k < i; k++)
						dpp[i][k] |= dpp[j][k - 1];
				}
				dp[i] = min(dp[i], dp[j] + 1);
			}
		}
	if(n <= 100){
		for(int i = X; i <= y; i++)
			if(dpp[n][i])
				return 1;
		return 0;
	}
	// cout << x << " " << dpp[n] << endl;
	return dp[n] <= y;
}

int main() {
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	scanf("%lld %lld %lld",&n ,&X ,&y);
	for(int i = 1; i <= n; i++){
		scanf("%lld",a + i);
		pre[i] = pre[i - 1] + a[i];
	}
	ans = (1ll<<45) - 1;
	for(int i = 44; i >= 0; i--){
		if(bak(ans - (1ll<<i))){
			// cout << ans << " " << i << endl;
			ans -= (1ll<<i);
		}
	}
	printf("%lld\n", ans);
	return 0;
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:49:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld %lld",&n ,&X ,&y);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",a + i);
   ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Incorrect 3 ms 512 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 412 KB Output is correct
3 Incorrect 2 ms 512 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 3 ms 512 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 512 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Incorrect 3 ms 512 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 540 KB Output is correct
3 Incorrect 2 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -