#include "bits/stdc++.h"
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update>;
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()
using ll = long long;
const int mod = 1e9+7;
void solve(int tc) {
int n;
cin >> n;
vector<int> v(n+1);
for (int i = 1; i <= n; ++i) cin >> v[i];
ll p;
cin >> p;
ll ans = 0;
ordered_set s;
s.insert(-1);
for (int i = 1; i <= n; ++i) {
v[i] += v[i-1]-p;
ans += s.order_of_key(v[i]);
s.insert(v[i]-1);
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL);
int tc = 1;
//cin >> tc;
for (int i = 1; i <= tc; ++i) solve(i);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
876 KB |
Output is correct |
2 |
Correct |
3 ms |
748 KB |
Output is correct |
3 |
Correct |
3 ms |
748 KB |
Output is correct |
4 |
Execution timed out |
1082 ms |
60208 KB |
Time limit exceeded |
5 |
Incorrect |
699 ms |
36716 KB |
Output isn't correct |
6 |
Execution timed out |
1049 ms |
55068 KB |
Time limit exceeded |
7 |
Execution timed out |
1096 ms |
59628 KB |
Time limit exceeded |
8 |
Execution timed out |
1016 ms |
51716 KB |
Time limit exceeded |
9 |
Execution timed out |
1095 ms |
61036 KB |
Time limit exceeded |
10 |
Execution timed out |
1054 ms |
55916 KB |
Time limit exceeded |