Submission #2551931


Source Code Expand

#include <bits/stdc++.h> 
using namespace std;

#define pf printf
#define sc scanf
#define rep0(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define repU(i,bottom,ceiling) for(int (i)=(bottom);(i)<=(ceiling);(i)++)
#define repD(i,ceiling,bottom) for(int (i)=(ceiling);(i)>=(bottom);(i)--)
#define V vector
#define vi V<int>
#define pub(v,el) v.push_back(el)
#define pob(v) v.pop_back
#define ci(a) cin>>a
#define lco(a) cout<<a<<endl
#define co(a) cout<<a
#define vco(v) rep0(i,v.size()){ co(v[i]<<' '); } co('\n')
#define P pair
#define pii P<int,int>
#define mp(a,b) make_P(a,b)
#define fir first
#define sec second

typedef long long ll;
typedef double db;

const int dir[8][2]={{0,1},{1,0},{0,-1},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}};
const int Inf=2e9+1e8;

template <typename T,typename U>                                                   
pair<T,U> operator+(const pair<T,U> & l,const pair<T,U> & r) {   
    return {l.fir+r.fir,l.sec+r.sec};                                    
} 

template <typename T,typename U> 
pair<T,U> operator-(const pair<T,U> & l,const pair<T,U> & r) {   
    return {l.fir-r.fir,l.sec-r.sec};                                    
} 
             
/*The main code follows*/

int main(){
	int s=0,n; 
	ci(n);
	vi a(2000);
	bitset<4000000> b;
	b[0]=1;
	rep0(i,n){ ci(a[i]); s+=a[i];  b|=b<<a[i]; }
	int cnt=(s+1)/2;
	while(!b[cnt]) cnt++;
	lco(cnt);
    return 0;
}





Submission Info

Submission Time
Task C - Median Sum
User amt
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1481 Byte
Status AC
Exec Time 421 ms
Memory 1792 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 42
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt, subtask_1_31.txt, subtask_1_32.txt, subtask_1_33.txt, subtask_1_34.txt, subtask_1_35.txt, subtask_1_36.txt, subtask_1_37.txt, subtask_1_38.txt
Case Name Status Exec Time Memory
sample_01.txt AC 2 ms 1664 KB
sample_02.txt AC 2 ms 1664 KB
subtask_1_01.txt AC 2 ms 1664 KB
subtask_1_02.txt AC 2 ms 1664 KB
subtask_1_03.txt AC 2 ms 1664 KB
subtask_1_04.txt AC 421 ms 1664 KB
subtask_1_05.txt AC 421 ms 1664 KB
subtask_1_06.txt AC 421 ms 1664 KB
subtask_1_07.txt AC 419 ms 1664 KB
subtask_1_08.txt AC 420 ms 1664 KB
subtask_1_09.txt AC 420 ms 1664 KB
subtask_1_10.txt AC 420 ms 1664 KB
subtask_1_11.txt AC 421 ms 1664 KB
subtask_1_12.txt AC 421 ms 1664 KB
subtask_1_13.txt AC 421 ms 1664 KB
subtask_1_14.txt AC 421 ms 1664 KB
subtask_1_15.txt AC 405 ms 1664 KB
subtask_1_16.txt AC 413 ms 1664 KB
subtask_1_17.txt AC 417 ms 1664 KB
subtask_1_18.txt AC 412 ms 1792 KB
subtask_1_19.txt AC 415 ms 1664 KB
subtask_1_20.txt AC 418 ms 1664 KB
subtask_1_21.txt AC 421 ms 1664 KB
subtask_1_22.txt AC 421 ms 1664 KB
subtask_1_23.txt AC 421 ms 1664 KB
subtask_1_24.txt AC 404 ms 1664 KB
subtask_1_25.txt AC 2 ms 1664 KB
subtask_1_26.txt AC 2 ms 1664 KB
subtask_1_27.txt AC 3 ms 1664 KB
subtask_1_28.txt AC 3 ms 1664 KB
subtask_1_29.txt AC 3 ms 1664 KB
subtask_1_30.txt AC 4 ms 1664 KB
subtask_1_31.txt AC 4 ms 1664 KB
subtask_1_32.txt AC 6 ms 1664 KB
subtask_1_33.txt AC 12 ms 1664 KB
subtask_1_34.txt AC 23 ms 1664 KB
subtask_1_35.txt AC 23 ms 1664 KB
subtask_1_36.txt AC 421 ms 1664 KB
subtask_1_37.txt AC 412 ms 1664 KB
subtask_1_38.txt AC 421 ms 1664 KB