oj.uz

Submission #839101

# Submission time Handle Problem Language Result Execution time Memory
839101 2023-08-28T16:11:17 Z carot15 Kas (COCI17_kas) C++14
100 / 100
 310 ms 198004 KB 
// carot15
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) begin(x), end(x)
#define mp make_pair
#define cyd {cout<<"Yes";return;}
#define cyn {cout<<"No";return;}
const ll nmax=1e5+5;
const ll mod=1e9+7;
const int X[]={0,0,1,-1};
const int Y[]={-1,1,0,0};
int n,a[505],t=0,b[505][nmax];
int solve2(int i,int d)	{
	if (i==n+1) 
        return d == nmax ? 0 : 1e9;
	int &k=b[i][d];
	if (~k) {
		return k;
	}
	return 
		k=min({solve2(i+1,d-a[i]),solve2(i+1,d+a[i]),solve2(i+1,d)+a[i]});
}
void solve(){
	cin>>n;	
	for (int i=1;i<=n;i++){
		cin>>a[i];
		t+=a[i];
	}
    memset(b,-1,sizeof b);
	int ans=solve2(1,nmax);
	cout<<(t-ans)/2+ans;
}
/*
10
14
36
63
560
150
28
35
70
10
34

780
*/
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
//	freopen(".INP", "r", stdin);
//	freopen(".OUT", "w", stdout);
	int T=1;
//	cin>>T;
	while(T--){
		solve();
		cout<<'\n';
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 197964 KB Output is correct
2 Correct 59 ms 197932 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 197904 KB Output is correct
2 Correct 58 ms 197900 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 197964 KB Output is correct
2 Correct 64 ms 197872 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 197968 KB Output is correct
2 Correct 63 ms 197928 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 197964 KB Output is correct
2 Correct 69 ms 197868 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 197908 KB Output is correct
2 Correct 62 ms 197944 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 197964 KB Output is correct
2 Correct 71 ms 197964 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 197964 KB Output is correct
2 Correct 73 ms 197904 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 197904 KB Output is correct
2 Correct 133 ms 197880 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 198004 KB Output is correct
2 Correct 310 ms 198004 KB Output is correct