| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 88809 |
2018-12-08T20:39:22 Z |
jasony123123 |
Kas (COCI17_kas) |
C++11 |
|
300 ms |
196708 KB |
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#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;
//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 *************************/
const int INF = 1 << 30;
int N;
int A[501];
int dp[501][100001];
int main() {
io();
int sum = 0;
cin >> N;
FORE(i, 1, N) {
cin >> A[i];
sum += A[i];
}
FORE(i, 0, N) FORE(j, 0, sum) dp[i][j] = INF;
dp[0][0] = 0;
FORE(i, 1, N) {
FORE(j, 0, sum) if (dp[i - 1][j] != INF) {
minn(dp[i][abs(j + A[i])], dp[i - 1][j]);
minn(dp[i][abs(j - A[i])], dp[i - 1][j]);
minn(dp[i][j], dp[i - 1][j] + A[i]);
}
}
int leftover = dp[N][0];
int ans = sum - leftover;
// assert(ans % 2 == 0);
ans /= 2;
ans += leftover;
cout << ans << "\n";
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
Output is correct |
| 2 |
Correct |
2 ms |
504 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
Output is correct |
| 2 |
Correct |
2 ms |
548 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
608 KB |
Output is correct |
| 2 |
Correct |
2 ms |
648 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
648 KB |
Output is correct |
| 2 |
Correct |
2 ms |
648 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
664 KB |
Output is correct |
| 2 |
Correct |
2 ms |
664 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
792 KB |
Output is correct |
| 2 |
Correct |
3 ms |
852 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
980 KB |
Output is correct |
| 2 |
Correct |
2 ms |
980 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
108 ms |
79272 KB |
Output is correct |
| 2 |
Correct |
111 ms |
98808 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
144 ms |
118400 KB |
Output is correct |
| 2 |
Correct |
189 ms |
157572 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
234 ms |
177136 KB |
Output is correct |
| 2 |
Correct |
300 ms |
196708 KB |
Output is correct |
