Submission #3246441
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a) cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,n) cout<<#a<<"=["; printarray(a,n); cout<<"]\n"
#define DAR(a,n,s) cout<<#a<<"["<<s<<"-"<<n-1<<"]=["; printarray(a,n,s); cout<<"]\n"
#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) { bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){ bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 sz, T2 beg = 0){ for (T2 i = beg; i<sz; i++) cout << a[i] << " "; cout << endl; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)
#define INF 987654321
#define endl '\n'
ll N,K,TN;
ll p[500500];
ll ans = 0;
void solve(int l, int r){
if( r < l ) return;
if( l == r ) {
if( p[l] >= K ) ans++;
return;
}
int m = (l+r)/2;
solve(l,m); solve(m+1,r);
vector<Pll> v;
ll sum = 0, cnt = 0;
for(int i=m+1;i<=r;i++){
cnt++; sum += p[i];
v.push_back({sum,cnt});
}
sum = 0, cnt = 0;
sort(all(v), [](Pll a, Pll b){
return K*a.Se-a.Fi < K*b.Se-b.Fi;
});
for(int i=m;i>=l;i--){
cnt++; sum += p[i];
int low = 0, high = sz(v)-1, res = -1;
while( low <= high ){
int mid = (low+high)/2;
if( sum - K*cnt >= K*v[mid].Se - v[mid].Fi ){
res = mid; low = mid+1;
}
else high = mid-1;
}
//Debug(sum,cnt,)
ans += res+1;
}
}
int main() {
scanf("%lld%lld",&N,&K);
repp(i,N) scanf("%lld",&p[i]);
solve(1,N);
printf("%lld\n",ans);
}
Submission Info
Submission Time
2018-09-23 04:39:43+0900
Task
E - Meaningful Mean
User
kjp4155
Language
C++14 (GCC 5.4.1)
Score
600
Code Size
4584 Byte
Status
AC
Exec Time
187 ms
Memory
4848 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:100:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld",&N,&K);
^
./Main.cpp:101:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
repp(i,N) scanf("%lld",&p[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
600 / 600
Status
Set Name
Test Cases
Sample
a01, a02, a03
All
a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15, b16, b17, b18, b19, b20, b21, b22, b23
Case Name
Status
Exec Time
Memory
a01
AC
1 ms
256 KB
a02
AC
1 ms
256 KB
a03
AC
1 ms
256 KB
b04
AC
1 ms
256 KB
b05
AC
115 ms
4848 KB
b06
AC
108 ms
4848 KB
b07
AC
112 ms
4848 KB
b08
AC
112 ms
4848 KB
b09
AC
120 ms
4848 KB
b10
AC
108 ms
4848 KB
b11
AC
1 ms
256 KB
b12
AC
1 ms
256 KB
b13
AC
58 ms
2324 KB
b14
AC
183 ms
4848 KB
b15
AC
103 ms
4848 KB
b16
AC
124 ms
4848 KB
b17
AC
187 ms
4848 KB
b18
AC
186 ms
4848 KB
b19
AC
112 ms
4848 KB
b20
AC
153 ms
4848 KB
b21
AC
113 ms
4848 KB
b22
AC
113 ms
4848 KB
b23
AC
113 ms
4848 KB