This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3phCa4T ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
int dp[511][511];
signed main(){
_3phCa4T;
int n;
cin>>n;
vi a(n);
rep(i,n){
cin>>a[i];
}
int sun=0;
rep(i,n){
sun+=a[i];
}
assert((sun*sun*n)/4<=1e8);
dp[0][0]=1;
rep(i,n){
per(j,sun/2+1){
per(k,sun/2+1){
if(dp[j][k]){
if(j+a[i]<=sun/2){
dp[j+a[i]][k]=1;
}
if(k+a[i]<=sun/2){
dp[j][k+a[i]]=1;
}
}
}
}
}
// print(sun/2);
per(j,sun/2+1){
if(dp[j][j]){
// print(j);
cout<<sun-j<<"\n";
break;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |