Submission #1156426
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()
#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))
// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD
// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;
int n;
ll a[125252];
ll sum[125252];
int main(){
scanf("%d",&n);
REP(i,n)scanf("%lld",a+i);
sort(a,a+n);
sum[0] = 0;
REP(i,n)sum[i+1] = sum[i]+a[i];
int ans = 0;
REP(x,n){
ll size = sum[x+1];
int it = x;
while(it < n-1){
int yo = upper_bound(a,a+n,2*size)-a-1;
if(yo==it)break;
it = yo;
size = sum[yo+1];
}
if(it==n-1)ans++;
}
printf("%d\n",ans);
return 0;
}
Submission Info
Submission Time
2017-03-12 21:08:26+0900
Task
B - Colorful Creatures
User
rickytheta
Language
C++14 (GCC 5.4.1)
Score
400
Code Size
1318 Byte
Status
AC
Exec Time
22 ms
Memory
1792 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:39:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:40:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
REP(i,n)scanf("%lld",a+i);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
400 / 400
Status
Set Name
Test Cases
Sample
sample1.txt, sample2.txt, sample3.txt
All
sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt
Case Name
Status
Exec Time
Memory
in1.txt
AC
22 ms
1792 KB
in10.txt
AC
10 ms
896 KB
in11.txt
AC
22 ms
1792 KB
in12.txt
AC
18 ms
1792 KB
in13.txt
AC
18 ms
1792 KB
in2.txt
AC
22 ms
1792 KB
in3.txt
AC
22 ms
1792 KB
in4.txt
AC
22 ms
1792 KB
in5.txt
AC
9 ms
896 KB
in6.txt
AC
22 ms
1792 KB
in7.txt
AC
22 ms
1792 KB
in8.txt
AC
21 ms
1792 KB
in9.txt
AC
4 ms
384 KB
sample1.txt
AC
1 ms
256 KB
sample2.txt
AC
1 ms
256 KB
sample3.txt
AC
1 ms
256 KB