| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 88805 | jasony123123 | Kas (COCI17_kas) | C++11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const ll INF = 1e18;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void io() {
#ifdef LOCAL_PROJECT
freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else
/* online submission */
#endif
ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 R4 P3 *************************/
int N;
int A[500];
unorderd_map<int, int> dpbefore, dpnow;
void add(unorderd_map<int, int> &dp, int key, int val) {
key = abs(key);
if (dp.find(key) == dp.end()) {
dp[key] = val;
}
else {
dp[key] = min(dp[key], val);
}
}
int main() {
io();
int sum = 0;
cin >> N;
FOR(i, 0, N) {
cin >> A[i];
sum += A[i];
}
dpnow[0] = 0;
FOR(i, 0, N) {
swap(dpnow, dpbefore);
dpnow.clear();
for (pii old : dpbefore) {
add(dpnow, old.first + A[i], old.second);
add(dpnow, old.first - A[i], old.second);
add(dpnow, old.first, old.second + A[i]);
}
}
int leftover = dpnow[0];
int ans = sum - leftover;
assert(ans % 2 == 0);
ans /= 2;
ans += leftover;
cout << ans << "\n";
return 0;
}