oj.uz

답안 #967913

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967913 2024-04-23T05:10:52 Z njoop Vudu (COCI15_vudu) C++14
42 / 140
 909 ms 65536 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
#include <bits/stdc++.h>
#define ll long long
using namespace __gnu_pbds;
using namespace std;

typedef tree<int, null_type, less_equal<ll>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
    
ordered_multiset s;

int n, p;
ll arr[1000010], dp[1000010], ans;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i=1; i<=n; i++) {
        cin >> arr[i];
    }
    cin >> p;
    for(int i=n; i>0; i--) {
        arr[i] -= p;
        dp[i] = arr[i] + dp[i+1];
    }
    for(int i=1; i<=n; i++) {
        s.insert(dp[i]);
        ans += s.size() - s.order_of_key(dp[i+1]);
    }
    cout << ans;
}

Subtask #1
42.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2904 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Incorrect 884 ms 65536 KB Output isn't correct
5 Incorrect 403 ms 36776 KB Output isn't correct
6 Incorrect 715 ms 55124 KB Output isn't correct
7 Incorrect 803 ms 56916 KB Output isn't correct
8 Incorrect 626 ms 50884 KB Output isn't correct
9 Incorrect 909 ms 65536 KB Output isn't correct
10 Incorrect 740 ms 55904 KB Output isn't correct