oj.uz

답안 #728574

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
728574 2023-04-22T16:08:27 Z penguin133 Kas (COCI17_kas) C++17
100 / 100
 240 ms 391716 KB 
#include <bits/stdc++.h>
using namespace std;
 
//#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
pair <bool, int> dp[501][100001];
int n, A[505];
 
void solve(){
	cin >> n;
	int sm = 0;
	for(int i=1;i<=n;i++)cin >> A[i], sm += A[i];
	sort(A+1, A+n+1);
	dp[0][50000] = {1, 0};
	for(int i=1;i<=n;i++){
		for(int j=0;j<=100000;j++){
			dp[i][j] = dp[i-1][j];
			if(j - A[i] >= 0 && dp[i-1][j-A[i]].fi){
				if(!dp[i][j].fi)dp[i][j] = dp[i-1][j-A[i]], dp[i][j].se += A[i];
				else{
					dp[i][j].se = max(dp[i][j].se, dp[i-1][j-A[i]].se + A[i]);
				}
			}
			if(j + A[i] <= 100000 && dp[i-1][j+A[i]].fi){
				if(!dp[i][j].fi)dp[i][j] = dp[i-1][j+A[i]], dp[i][j].se += A[i];
				else{
					dp[i][j].se = max(dp[i][j].se, dp[i-1][j+A[i]].se + A[i]);
				}
			}
		}
	}
	int mx = dp[n][50000].se/2;
	cout << sm - mx;
}
 
main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

kas.cpp:44:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   44 | main(){
      | ^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8148 KB Output is correct
2 Correct 6 ms 8148 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8148 KB Output is correct
2 Correct 6 ms 8148 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 8148 KB Output is correct
2 Correct 8 ms 8912 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 8 ms 10508 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 10452 KB Output is correct
2 Correct 7 ms 10480 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 27732 KB Output is correct
2 Correct 21 ms 31560 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 35540 KB Output is correct
2 Correct 26 ms 39368 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 156836 KB Output is correct
2 Correct 116 ms 195956 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 235140 KB Output is correct
2 Correct 190 ms 313344 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 218 ms 352524 KB Output is correct
2 Correct 240 ms 391716 KB Output is correct