Submission #2551477
Source Code Expand
#include <iostream> #include <climits> #include <bits/stdc++.h> #include <stack> #include <queue> #include <iomanip> #include <limits> #include <string> #include <cmath> #include <set> #include <map> #include <math.h> #include <algorithm> #include <vector> #include <string.h> using namespace std; typedef long long ll; typedef pair<ll,ll> P; long long int INF = 1e18; double Pi = 3.141592653589; const int mod = 1000000007; // memset(a,0,sizeof(a)); →全部0にする vector<int> G[100005]; std::vector<P> tree[100010]; int dx[8]={1,0,-1,0,1,1,-1,-1}; int dy[8]={0,1,0,-1,1,-1,-1,1}; #define p(x) cout<<x<<endl; #define el cout<<endl; #define pe(x) cout<<x<<" "; #define re(i,a,b) for(i=a;i<=b;i++) ll i,j,ii,jj; ll n,m; ll num,sum; bitset<2000005> dp; int main(){ cin>>n; dp[0]=1; for(i=0;i<n;i++){ cin>>m; sum+=m; dp |= dp<<m; } for(i=(sum+1)/2;i<=200004;i++){ if(dp[i]){ p(i); return 0; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Median Sum |
User | enjapma |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1069 Byte |
Status | WA |
Exec Time | 215 ms |
Memory | 5632 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||
Status |
|
|
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 | 4 ms | 5632 KB |
sample_02.txt | AC | 4 ms | 5632 KB |
subtask_1_01.txt | AC | 4 ms | 5632 KB |
subtask_1_02.txt | AC | 3 ms | 5632 KB |
subtask_1_03.txt | AC | 3 ms | 5632 KB |
subtask_1_04.txt | AC | 212 ms | 5632 KB |
subtask_1_05.txt | WA | 212 ms | 5632 KB |
subtask_1_06.txt | WA | 212 ms | 5632 KB |
subtask_1_07.txt | WA | 211 ms | 5632 KB |
subtask_1_08.txt | WA | 211 ms | 5632 KB |
subtask_1_09.txt | WA | 211 ms | 5632 KB |
subtask_1_10.txt | WA | 212 ms | 5632 KB |
subtask_1_11.txt | WA | 211 ms | 5632 KB |
subtask_1_12.txt | WA | 212 ms | 5632 KB |
subtask_1_13.txt | WA | 213 ms | 5632 KB |
subtask_1_14.txt | WA | 212 ms | 5632 KB |
subtask_1_15.txt | WA | 204 ms | 5632 KB |
subtask_1_16.txt | WA | 209 ms | 5632 KB |
subtask_1_17.txt | WA | 210 ms | 5632 KB |
subtask_1_18.txt | WA | 208 ms | 5632 KB |
subtask_1_19.txt | WA | 215 ms | 5632 KB |
subtask_1_20.txt | WA | 214 ms | 5632 KB |
subtask_1_21.txt | WA | 212 ms | 5632 KB |
subtask_1_22.txt | WA | 212 ms | 5632 KB |
subtask_1_23.txt | WA | 212 ms | 5632 KB |
subtask_1_24.txt | WA | 203 ms | 5632 KB |
subtask_1_25.txt | AC | 4 ms | 5632 KB |
subtask_1_26.txt | AC | 4 ms | 5632 KB |
subtask_1_27.txt | AC | 4 ms | 5632 KB |
subtask_1_28.txt | AC | 4 ms | 5632 KB |
subtask_1_29.txt | AC | 4 ms | 5632 KB |
subtask_1_30.txt | AC | 4 ms | 5632 KB |
subtask_1_31.txt | AC | 5 ms | 5632 KB |
subtask_1_32.txt | AC | 5 ms | 5632 KB |
subtask_1_33.txt | AC | 9 ms | 5632 KB |
subtask_1_34.txt | AC | 14 ms | 5632 KB |
subtask_1_35.txt | AC | 14 ms | 5632 KB |
subtask_1_36.txt | WA | 213 ms | 5632 KB |
subtask_1_37.txt | AC | 209 ms | 5632 KB |
subtask_1_38.txt | WA | 212 ms | 5632 KB |