# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
946455 | Mohamed_Kachef06 | Vudu (COCI15_vudu) | C++17 | 467 ms | 65536 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/extc++.h>
#define int long long
using namespace std;
using namespace __gnu_pbds;
int const mxN = 3e5+5;
signed main() {
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
int n,p, ans = 0;
cin>>n;
int a[n+1];
for(int i=0; i<n; i++) cin>>a[i];
cin>>p;
tree<int,null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> st;
st.insert(p);
for(int i=0; i<n; i++) {
a[i] += (i? a[i-1]:0);
int x = a[i] - p*i;
ans += st.order_of_key(x+1);
st.insert(x);
}
cout<<ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |