#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 998244353;
const ll LOGN = 20;
const ll MAXN = 1e6 + 10;
vector<ll> A;
tree<pair<ll,int>, null_type, less<pair<ll,int>>, rb_tree_tag, tree_order_statistics_node_update> s;
int main() {
fast
int N, P;
cin >> N;
A = vector<ll>(N+1);
for (int i = 1; i <= N; i++) {
cin >> A[i];
A[i] += A[i-1];
}
cin >> P;
ll ans = 0;
for (ll i = 1; i <= N; i++) {
s.insert(make_pair(P * i - A[i-1], i));
ans += s.size() - s.order_of_key(make_pair(P * i - A[i] + P, -1));
}
cout << ans << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
860 KB |
Output is correct |
2 |
Correct |
2 ms |
832 KB |
Output is correct |
3 |
Correct |
3 ms |
860 KB |
Output is correct |
4 |
Runtime error |
495 ms |
65536 KB |
Execution killed with signal 9 |
5 |
Correct |
244 ms |
38732 KB |
Output is correct |
6 |
Correct |
516 ms |
60708 KB |
Output is correct |
7 |
Correct |
463 ms |
63220 KB |
Output is correct |
8 |
Correct |
378 ms |
54580 KB |
Output is correct |
9 |
Runtime error |
417 ms |
65536 KB |
Execution killed with signal 9 |
10 |
Correct |
443 ms |
61524 KB |
Output is correct |