#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;
ll dp[1000010], ans;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n;
for(int i=1; i<=n; i++) {
cin >> dp[i];
}
cin >> p;
for(int i=n; i>0; i--) {
dp[i] -= p;
dp[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 |
3 ms |
856 KB |
Output is correct |
2 |
Correct |
2 ms |
860 KB |
Output is correct |
3 |
Correct |
2 ms |
860 KB |
Output is correct |
4 |
Runtime error |
450 ms |
65536 KB |
Execution killed with signal 9 |
5 |
Correct |
250 ms |
40908 KB |
Output is correct |
6 |
Correct |
396 ms |
60496 KB |
Output is correct |
7 |
Correct |
412 ms |
63312 KB |
Output is correct |
8 |
Correct |
382 ms |
54868 KB |
Output is correct |
9 |
Runtime error |
389 ms |
65536 KB |
Execution killed with signal 9 |
10 |
Correct |
403 ms |
61520 KB |
Output is correct |