#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set = tree<T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
void solve(){
int n;
cin >> n;
ll arr[n];
for(int i = 0; i < n; i++)cin >> arr[i];
ll p;
cin >> p;
for(int i = 0; i < n; i++)arr[i] -= p;
ll pre[n + 1];
pre[n] = 0;
for(int i = n - 1; i >= 0; i--){
pre[i] = pre[i + 1] + arr[i];
}
ll ans = 0;
ordered_set<pair<ll,int>> s;
for(int i = 0; i < n; i++){
s.insert(mp(pre[i],i));
ll x = pre[i + 1];
ans += (i + 1LL) - ((ll)s.order_of_key(mp(x,-1)));
}
cout << ans << '\n';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//int t;cin >> t;while(t--)
solve();
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
844 KB |
Output is correct |
| 2 |
Correct |
3 ms |
716 KB |
Output is correct |
| 3 |
Correct |
3 ms |
716 KB |
Output is correct |
| 4 |
Runtime error |
496 ms |
65540 KB |
Execution killed with signal 9 |
| 5 |
Correct |
331 ms |
43076 KB |
Output is correct |
| 6 |
Runtime error |
524 ms |
65540 KB |
Execution killed with signal 9 |
| 7 |
Runtime error |
450 ms |
65540 KB |
Execution killed with signal 9 |
| 8 |
Correct |
502 ms |
63260 KB |
Output is correct |
| 9 |
Runtime error |
440 ms |
65540 KB |
Execution killed with signal 9 |
| 10 |
Runtime error |
460 ms |
65540 KB |
Execution killed with signal 9 |
