oj.uz

답안 #380248

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
380248 2021-03-20T17:08:53 Z vishesh312 Vudu (COCI15_vudu) C++17
126 / 140
 756 ms 65540 KB 
#include "bits/stdc++.h"
using namespace std;

using ll = long long;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>;

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

const int mod = 1e9+7;

void solve(int tc) {
    int n;
    cin >> n;
    vector<pair<ll, int>> v(n+1);
    for (int i = 1; i <= n; ++i) {
        cin >> v[i].first;
        v[i].second = i;
    }
    vector<int> a(n+1);
    ll p;
    cin >> p;
    for (int i = 1; i <= n; ++i) {
        v[i].first += v[i-1].first - p;
    }
    sort(all(v));
    ll cur = 0;
    for (int i = 0; i <= n; ++i) {
        if (i) if (v[i].first == v[i-1].first) --cur;
        a[v[i].second] = cur;
        ++cur;
    }
    ll ans = 0;
    ordered_set s;
    s.insert(a[0]-1);
    for (int i = 1; i <= n; ++i) {
        ans += s.order_of_key(a[i]);
        s.insert(a[i]-1);
    }
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

Subtask #1
126.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 876 KB Output is correct
2 Correct 3 ms 748 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 756 ms 64748 KB Output is correct
5 Correct 370 ms 36716 KB Output is correct
6 Correct 619 ms 57452 KB Output is correct
7 Correct 631 ms 59576 KB Output is correct
8 Correct 540 ms 51692 KB Output is correct
9 Runtime error 642 ms 65540 KB Execution killed with signal 9
10 Correct 611 ms 58092 KB Output is correct