제출 #996109

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
996109		vjudge1	Vudu (COCI15_vudu)	C++17	140 / 140	203 ms	37460 KiB

vudu

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define lwb lower_bound
#define upb upper_bound

#define TASKNAME "NAME"

void init()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ///freopen(TASKNAME".INP","r",stdin); freopen(TASKNAME".OUT","w",stdout);
}

const int SZ = 1e6+5;
const ll INF = INT_MAX / 2, MOD = 1e9+7, INFLL = 2e18;
const double epsilon = 1e-3;

int n;
ll a[SZ], p, res = 0;
pll b[SZ];

struct Fenwick
{
    int nodes[SZ];

    void update(int pos)
    {
        while(pos <= n)
        {
            nodes[pos]++;
            pos += pos & (-pos);
        }
    }

    int get(int pos)
    {
        int sum = 0;
        while(pos > 0)
        {
            sum += nodes[pos];
            pos -= pos & (-pos);
        }
        return sum;
    }
} ft;

int main()
{
    init();
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    cin >> p;
    for(int i = 1; i <= n; i++)
    {
        a[i] -= p;
    }
    ll sum = 0;
    for(int i = 1; i <= n; i++)
    {
        sum += a[i];
        b[i] = {sum, i};
    }
    sort(b + 1, b + n + 1);
    for(int i = 1; i <= n; i++)
    {
        //cout << b[i].fi << " " << b[i].se << '\n';
        if(b[i].fi >= 0) res++;
        res += 1LL*ft.get(b[i].se);
        ft.update(b[i].se);
    }
    cout << res;
}

• Subtask 1: 140 / 140