# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
88808 |
2018-12-08T20:36:14 Z |
jasony123123 |
Kas (COCI17_kas) |
C++11 |
|
331 ms |
196800 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;
const int INF = 1e6;
//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[501];
int dp[501][100001];
int main() {
io();
int sum = 0;
cin >> N;
FORE(i, 1, N) {
cin >> A[i];
sum += A[i];
}
memset(dp, INF, sizeof dp);
dp[0][0] = 0;
FORE(i, 1, N) {
FORE(j, 0, sum) if (dp[i - 1][j] != INF) {
minn(dp[i][j + A[i]], dp[i - 1][j]);
minn(dp[i][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 |
Incorrect |
151 ms |
196472 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
160 ms |
196544 KB |
Output is correct |
2 |
Incorrect |
157 ms |
196544 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
159 ms |
196592 KB |
Output is correct |
2 |
Incorrect |
152 ms |
196592 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
158 ms |
196592 KB |
Output is correct |
2 |
Correct |
163 ms |
196652 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
163 ms |
196652 KB |
Output is correct |
2 |
Correct |
153 ms |
196652 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
155 ms |
196724 KB |
Output is correct |
2 |
Correct |
162 ms |
196728 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
154 ms |
196728 KB |
Output is correct |
2 |
Correct |
168 ms |
196728 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
248 ms |
196768 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
275 ms |
196768 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
331 ms |
196800 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |