| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 950171 | vjudge1 | Vudu (COCI15_vudu) | C++17 | 725 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/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;
    ll 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,y=0;
    for(int i=0;i<n;i++){
        x=i;x*=p;
        x=sum-x;
        st.insert({x,i});
        x=a[i];
        sum+=x;
        x=i;x*=p;
        x=sum-x-p;
        ans+=st.order_of_key({x,1e9});
    }
    cout<<ans<<"\n";
}
/*
 
 */
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
