oj.uz

답안 #199397

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
199397 2020-02-01T08:08:56 Z detaomega Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 6 ms 376 KB 
//#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
#define X first
#define Y second
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define de(x,y) cout<<#x<<" :"<<x<<y;
#define int long long
typedef pair<int,int> pii;

const int maxn = 1e2+5;

int arr[maxn], ans = 0, n, A, B;
int pre[maxn];
int two[60];
void solve() {
	int dp[maxn][maxn];
	int digit = __lg(pre[n]);
	for(int x=digit; x>=0; x--) {
		memset(dp, 0, sizeof(dp));
		dp[0][0] = 1;
		for(int i=1; i<=n; i++) {
			for(int j=1; j<=n; j++) {
				for(int k=0; k<i; k++) {
					if(dp[k][j-1]) {
						int tmp = pre[i] - pre[k];
						if((tmp & (two[x])) == 0 && ((ans & two[x+1]) ^ (tmp & two[x+1]) == 0) ) {
							dp[i][j] = 1;
						}
					}
				} 
			} 
		}	
		ans += two[x];
		for(int i=A; i<=B; i++) {
			if(dp[n][i]) {
				ans -= two[x];
				break;
			}
		}
	}
}
main() {
//	int n, A, B;
	cin >> n >> A >> B;
	two[0] = 1;
	for(int i=1; i<=50; i++) {
		two[i] = two[i-1] * 2;
	}
	pre[0] = 0;
	for(int i=1; i<=n; i++) {
		cin >> arr[i];
		pre[i] = pre[i-1] + arr[i];
	}
	solve();
	cout << ans << "\n"; 



}

Compilation message

sculpture.cpp: In function 'void solve()':
sculpture.cpp:28:72: warning: suggest parentheses around comparison in operand of '^' [-Wparentheses]
       if((tmp & (two[x])) == 0 && ((ans & two[x+1]) ^ (tmp & two[x+1]) == 0) ) {
                                                       ~~~~~~~~~~~~~~~~~^~~~
sculpture.cpp: At global scope:
sculpture.cpp:44:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 5 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 5 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 5 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 6 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Incorrect 5 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -