Submission #875541

#	Time	Username	Problem	Language	Result	Execution time	Memory
875541		12345678	Vudu (COCI15_vudu)	C++17	0 / 140	324 ms	28088 KiB

vudu

#include <bits/stdc++.h>

using namespace std;

const int nx=1e6+5;
long long n, p, qs[nx], res;
vector<long long> v;

struct fenwick
{
    int d[nx];
    void add(int idx)
    {
        for (int i=idx; i<=n; i+=(i&-i)) d[i]++;
    }
    int query(int idx)
    {
        int res=0;
        for (int i=idx; i>0; i-=(i&-i)) res+=d[i];
        return res;
    }
} f;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>qs[i], qs[i]+=qs[i-1];
    cin>>p;
    for (int i=0; i<n; i++) v.push_back(qs[i]-i*p);
    sort(v.begin(), v.end());
    for (int i=1; i<=n; i++)
    {
        f.add(lower_bound(v.begin(), v.end(), qs[i-1]-(i-1)*p)-v.begin()+1);
        res+=f.query(lower_bound(v.begin(), v.end(), qs[i]-(i)*p)-v.begin()+1);
    }
    cout<<res;
}

• Subtask 1: 0 / 140