# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
98827 | someone_aa | Vudu (COCI15_vudu) | C++17 | 1092 ms | 66560 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 ll long long
#define pb push_back
#define mp make_pair
#define P pair<ll, ll>
using namespace std;
const int maxn = 1000100;
const int maxm = 2 * maxn;
int tree[maxm], m;
void update(int x,int val) {
while(x<=m) {
tree[x]+=val; x+=(x&-x);
}
}
int query(int x) {
int res=0;
while(x>0) {
res+=tree[x]; x-=(x&-x);
}
return res;
}
ll n, d, arr[maxn];
map<ll, int> ind;
set<ll>values;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++) {
cin>>arr[i];
}
cin>>d;
ll sum = 0LL;
for(ll i=1LL;i<=n;i++) {
ind[sum-d*i] = 1;
sum += arr[i];
ind[sum-d*i - d] = 1;
}
int br = 1;
for(auto i:ind) {
i.second = br++;
}
m = br;
sum = 0LL;
ll result = 0LL;
for(int i=1;i<=n;i++) {
update(ind[sum - d*i], 1);
//cout<<i<<": "<<sum-d*i<<", "<<ind[sum-d*i]<<" -> ";
sum += arr[i];
result += 1LL * query(ind[sum - d*i - d]);
//cout<<sum - d*i - d<<", "<<ind[sum-d*i-d]<<"\n";
}
cout<<result<<"\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |