# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165429 | Atill83 | Vudu (COCI15_vudu) | C++14 | 1040 ms | 12400 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e6+5;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, P, a[MAXN];
vector<ll> diger;
ll do_it(int l, int r){
if(l == r){
return a[l] >= P;
}else{
int m = (l + r)/2;
diger.clear();
ll curSm = 0;
for(int j = m; j >= l; j--){
curSm += a[j];
diger.push_back(curSm - P*(m - j + 1));
}
sort(diger.begin(), diger.end());
curSm = 0;
ll ans = 0;
for(int j = m + 1; j <= r; j++){
curSm += a[j];
ll cnt = diger.end() - lower_bound(diger.begin(), diger.end(), -(curSm - (j - m)*P));
ans += cnt;
}
return ans + do_it(l, m) + do_it(m + 1, r);
}
}
int main(){
#ifdef Local
freopen("../IO/int.txt","r",stdin);
freopen("../IO/out.txt","w",stdout);
#endif
scanf("%lld", &n);
for(int i = 1; i <= n; i++){
scanf("%lld", a + i);
}
scanf("%lld", &P);
printf("%lld\n", do_it(1, n));
#ifdef Local
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
#endif
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |