제출 #253620

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
253620		Vimmer	Vudu (COCI15_vudu)	C++14	0 / 140	1097 ms	65540 KiB

vudu

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 10005
#define M ll(998244353)
#define inf 1e9 + 1e9

using namespace std;
using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <ll, 3> a3;
typedef array <ll, 4> a4;

typedef tree <ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



ordered_set se, st;

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    int a[n];

    for (int i = 0; i < n; i++) cin >> a[i];

    ll sum = 0;

    int p;

    cin >> p;

    for (int i = 0; i < n; i++)
    {
        a[i] -= p;

        sum += ll(a[i]);

        se.insert(sum);
    }

    sum = 0;

    ll ans = 0;

    for (int i = 0; i < n; i++)
    {
        ll need = -a[i];

        sum += a[i];

        need += sum;

        ans += sz(se) - se.order_of_key(need);

        se.erase(se.find(sum));
    }

    cout << ans << endl;
}

• Subtask 1: 0 / 140