# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
950162 |
2024-03-20T06:11:17 Z |
vjudge1 |
Vudu (COCI15_vudu) |
C++17 |
|
595 ms |
65536 KB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<pair <ll,int> , null_type,less<pair <ll,int>>, rb_tree_tag,tree_order_statistics_node_update>
signed main(){
ios_base::sync_with_stdio();
cin.tie(0);cout.tie(0);
int n,p;
cin>>n;
vector <int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
cin>>p;
ordered_set st;
ll sum=0;
ll ans=0,x=0;
for(int i=0;i<n;i++){
x=sum-i*p;
st.insert({x,i});
sum+=a[i];
x=sum-p*i-p;
ans+=st.order_of_key({x,1e9});
}
cout<<ans<<"\n";
}
/*
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
860 KB |
Output is correct |
2 |
Correct |
3 ms |
604 KB |
Output is correct |
3 |
Correct |
4 ms |
604 KB |
Output is correct |
4 |
Incorrect |
583 ms |
64620 KB |
Output isn't correct |
5 |
Incorrect |
316 ms |
36608 KB |
Output isn't correct |
6 |
Incorrect |
533 ms |
57172 KB |
Output isn't correct |
7 |
Incorrect |
577 ms |
59500 KB |
Output isn't correct |
8 |
Incorrect |
470 ms |
51744 KB |
Output isn't correct |
9 |
Runtime error |
595 ms |
65536 KB |
Execution killed with signal 9 |
10 |
Incorrect |
538 ms |
57924 KB |
Output isn't correct |