oj.uz

Submission #631193

# Submission time Handle Problem Language Result Execution time Memory
631193 2022-08-17T19:18:03 Z inksamurai Kas (COCI17_kas) C++17
70 / 100
 18 ms 1236 KB 
#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;
		}
	}
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 852 KB Output is correct
2 Correct 6 ms 1236 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 764 KB Output is correct
2 Correct 11 ms 776 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 852 KB Output is correct
2 Correct 18 ms 1004 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 456 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -