oj.uz

답안 #104563

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
104563 2019-04-08T05:30:09 Z YottaByte Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 1000 ms 384 KB 
#include <iostream>
using namespace std;

#define int long long
#define pc __builtin_popcount

const int N = 21, inf = 1073741824;

int n, a, b, ans = inf, ar[N];

void calc(int mask) {
	if(pc(mask) + 1 > b) {
		return;
	}
	
	if(a <= pc(mask) + 1 && pc(mask) + 1 <= b) {
		int sum = 0, temp = 0;
		for(int i = 0; i < n; i++) {
			sum += ar[i];
			if(mask & (1 << i)) {
				temp |= sum;
				sum = 0;
			}
		}
		
		temp |= sum;
		ans = min(ans, temp);
	}
	
	if(pc(mask) + 1 == b) {
		return;
	}
	
	for(int i = 0; i < n; i++) {
		if(mask >> i & 1); else {
			calc(1 << i | mask);
		}
	}
}

main() {
	cin >> n >> a >> b;
	
	for(int i = 0; i < n; i++) {
		cin >> ar[i];
	}
	
	calc(0);
	
	cout << ans << endl;
}

Compilation message

sculpture.cpp:41:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Execution timed out 1061 ms 384 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Execution timed out 1046 ms 384 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Execution timed out 1055 ms 256 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 128 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Execution timed out 1034 ms 256 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Execution timed out 1053 ms 256 KB Time limit exceeded
7 Halted 0 ms 0 KB -