답안 #967920

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967920 2024-04-23T05:17:09 Z vjudge1 Vudu (COCI15_vudu) C++17
84 / 140
408 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<ll, null_type, less_equal<ll>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
    
ordered_multiset s;

int n, p;
int arr[1000010];
ll 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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2908 KB Output is correct
2 Correct 2 ms 2908 KB Output is correct
3 Correct 3 ms 2908 KB Output is correct
4 Runtime error 408 ms 65536 KB Execution killed with signal 9
5 Correct 250 ms 43372 KB Output is correct
6 Correct 406 ms 65076 KB Output is correct
7 Runtime error 390 ms 65536 KB Execution killed with signal 9
8 Correct 359 ms 59216 KB Output is correct
9 Runtime error 384 ms 65536 KB Execution killed with signal 9
10 Runtime error 364 ms 65536 KB Execution killed with signal 9