제출 #732043

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
732043		vjudge1	Kas (COCI17_kas)	C++11	70 / 100	2075 ms	119452 KiB

kas

#include <bits/stdc++.h>
using namespace std;

map<array<int, 4>, bool> done;
const int MxN = 220;
int n, answer;
int a[MxN];

void rec(int state, int kang, int pun, int remain){
	if(done[{state, kang, pun, remain}]){
		return ;
	}
	done[{state, kang, pun, remain}] = true;
	if(state == n + 1){
		if(kang == pun && kang != 0){
			answer = max(answer, kang);
		}
		return ;
	}
	rec(state + 1, kang + a[state], pun, remain);
	rec(state + 1, kang, pun + a[state], remain);
	rec(state + 1, kang, pun, remain + a[state]);
}

int main() {
	cin.tie(nullptr)->ios::sync_with_stdio(false);
	int q = 1;
	//cin >> q;
	while(q--){
		done.clear();
		cin >> n;
		int all = 0;
		for(int i=1; i<=n; ++i){
			cin >> a[i];
			all += a[i];
		}
		answer = 0;
		rec(1, 0, 0, 0);
		cout << answer + (all - answer * 2) << "\n";
	}
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10