oj.uz

Submission #88807

# Submission time Handle Problem Language Result Execution time Memory
88807 2018-12-08T20:29:57 Z jasony123123 Kas (COCI17_kas) C++11
90 / 100
 2000 ms 418340 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 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[501];
unordered_map<int, int> alldp[501];

inline void add(unordered_map<int, int> &dp, int key, int val) {
	key = abs(key);
	auto it = dp.find(key);
	if (it == dp.end()) {
		dp[key] = val;
	}
	else {
		minn(it->second, val);
	}
}

int main() {
	io();
	int sum = 0;
	cin >> N;
	FORE(i, 1, N) {
		cin >> A[i];
		sum += A[i];
	}
	alldp[0][0] = 0;
	FORE(i, 1, N) {
		for (pii old : alldp[i-1]) {
			add(alldp[i], old.first + A[i], old.second);
			add(alldp[i], old.first - A[i], old.second);
			add(alldp[i], old.first, old.second + A[i]);
		}
	}
	int leftover = alldp[N][0];
	int ans = sum - leftover;
//	assert(ans % 2 == 0);
	ans /= 2;
	ans += leftover;
	cout << ans << "\n";
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 752 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 752 KB Output is correct
2 Correct 3 ms 752 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 752 KB Output is correct
2 Correct 3 ms 752 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 752 KB Output is correct
2 Correct 2 ms 752 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 812 KB Output is correct
2 Correct 3 ms 812 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1068 KB Output is correct
2 Correct 5 ms 1068 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1708 KB Output is correct
2 Correct 5 ms 1708 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 994 ms 178252 KB Output is correct
2 Correct 250 ms 178252 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1115 ms 178252 KB Output is correct
2 Correct 1255 ms 228716 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2089 ms 418340 KB Time limit exceeded
2 Halted 0 ms 0 KB -