Submission #875538

#	Time	Username	Problem	Language	Result	Execution time	Memory
875538		12345678	Vudu (COCI15_vudu)	C++17	0 / 140	1102 ms	65536 KiB

vudu

#include <bits/stdc++.h>

using namespace std;

const int nx=1e6+5;
long long n, p, qs[nx], t, res;
map<long long, int> mp;

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;
    mp[0]=0;
    for (int i=1; i<=n; i++) cin>>qs[i], qs[i]+=qs[i-1];
    cin>>p;
    for (int i=0; i<n; i++) mp[qs[i]-i*p]=0;
    for (auto &[x, y]:mp) mp[x]=++t;
    f.add(mp[0]);
    for (int i=1; i<=n; i++)
    {
        res+=f.query(mp[qs[i]-i*p]);
        //cout<<i<<' '<<res<<'\n';
        f.add(mp[qs[i]-i*p]);
    }
    cout<<res;
}

• Subtask 1: 0 / 140