oj.uz

답안 #728566

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
728566 2023-04-22T15:58:08 Z penguin133 Kas (COCI17_kas) C++17
10 / 100
 268 ms 524288 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, pi> 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, {50000, 50000}};
	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]];
				else{
					dp[i][j].se.fi = min(dp[i][j].se.fi, dp[i-1][j-A[i]].se.fi);
					dp[i][j].se.se = max(dp[i][j].se.se, dp[i-1][j-A[i]].se.se);
				}
			}
			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]];
				else{
					dp[i][j].se.fi = min(dp[i][j].se.fi, dp[i-1][j+A[i]].se.fi);
					dp[i][j].se.se = max(dp[i][j].se.se, dp[i-1][j+A[i]].se.se);
				}
			}
			if(dp[i][j].fi){
				dp[i][j].se.fi = min(dp[i][j].se.fi, j);
				dp[i][j].se.se = max(dp[i][j].se.se, j);
			}
		}
	}
	int mx = max(5e4 - dp[n][50000].se.fi, dp[n][50000].se.se - 5e4);
	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:50:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   50 | main(){
      | ^~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 23764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23712 KB Output is correct
2 Correct 14 ms 23764 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23764 KB Output is correct
2 Incorrect 14 ms 26068 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 17 ms 28500 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 30796 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 45 ms 82520 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 105912 KB Output is correct
2 Incorrect 74 ms 117736 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 233 ms 470060 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 255 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 268 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -