oj.uz

답안 #252759

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
252759 2020-07-26T08:29:03 Z kartel Vudu (COCI15_vudu) C++14
140 / 140
 496 ms 31700 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,nso-stack-protector,unroll-loops,fast-math,-O3")
//#define F first
//#define S second
#define pb push_back
#define N +1000500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define Max_A int(1e9)
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define Max_S int(3e6)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

ll pr[N], i, n, j, ans, a[N], p,t[N];
vector <ll> vec;

void upd(ll v)
{
    v = lower_bound(all(vec), v) - vec.begin();

    for (; v < n; v = (v | (v + 1))) t[v]++;
}

ll sum(ll v)
{
    ll res = 0;
    v = upper_bound(all(vec), v) - vec.begin() - 1;
    for (; v >= 0; v = (v & (v + 1)) - 1) res += t[v];

    return res;
}

int main()
{
    cout.precision(2);
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("input.txt");
//    out("output.txt");

    cin >> n;
    for (i = 1; i <= n; i++) cin >> a[i], pr[i] = pr[i - 1] + a[i];
    cin >> p;

    for (i = 1; i <= n; i++)
        vec.pb(pr[i - 1] - i * p + p);

    sort(all(vec));
    vec.resize(unique(all(vec)) - vec.begin());

    for (i = 1; i <= n; i++)
    {
        upd(pr[i - 1] - i * p + p);

        ans += sum(pr[i] - i * p);
    }
    cout << ans;
}
//
//00000
//00110
//00111
//00011
//00000

Subtask #1
140.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 496 ms 30736 KB Output is correct
5 Correct 269 ms 17620 KB Output is correct
6 Correct 426 ms 27348 KB Output is correct
7 Correct 419 ms 28376 KB Output is correct
8 Correct 379 ms 24764 KB Output is correct
9 Correct 486 ms 31700 KB Output is correct
10 Correct 418 ms 27608 KB Output is correct