# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
967903 |
2024-04-23T04:56:12 Z |
njoop |
Vudu (COCI15_vudu) |
C++14 |
|
919 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<int>, 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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
2904 KB |
Output is correct |
2 |
Correct |
2 ms |
2652 KB |
Output is correct |
3 |
Correct |
3 ms |
2652 KB |
Output is correct |
4 |
Incorrect |
851 ms |
65536 KB |
Output isn't correct |
5 |
Incorrect |
402 ms |
41672 KB |
Output isn't correct |
6 |
Incorrect |
754 ms |
63544 KB |
Output isn't correct |
7 |
Incorrect |
840 ms |
65472 KB |
Output isn't correct |
8 |
Incorrect |
649 ms |
58148 KB |
Output isn't correct |
9 |
Incorrect |
919 ms |
65536 KB |
Output isn't correct |
10 |
Incorrect |
734 ms |
63996 KB |
Output isn't correct |