oj.uz

Submission #94408

# Submission time Handle Problem Language Result Execution time Memory
94408 2019-01-18T08:59:31 Z theknife2001 Vudu (COCI15_vudu) C++17
42 / 140
 1000 ms 66560 KB 
#include <bits/stdc++.h>
#define ll long long

using namespace std;
const int N=1e6+55;
ll a[N];
ll sum[N];
multiset < ll > st;

int main()
{
    ios::sync_with_stdio(false);
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>a[i];
    int P;
    cin>>P;
    for(int i=0;i<n;i++)
    {
        sum[i]=a[i]-P;
        if(i)
            sum[i]+=sum[i-1];
        st.insert(sum[i]);
    }
    ll ans=0;
    ll x=0;
    for(int i=0;i<n;i++)
    {
        ans+=distance(st.lower_bound(x),st.end());
        st.erase(st.find(sum[i]));
        x+=a[i]-P;
    }
    cout<<ans<<endl;
    return 0;
}

Subtask #1
42.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 111 ms 888 KB Output is correct
2 Correct 106 ms 760 KB Output is correct
3 Correct 77 ms 788 KB Output is correct
4 Execution timed out 1073 ms 66560 KB Time limit exceeded
5 Execution timed out 1074 ms 39888 KB Time limit exceeded
6 Execution timed out 1077 ms 62240 KB Time limit exceeded
7 Execution timed out 1069 ms 64760 KB Time limit exceeded
8 Execution timed out 1072 ms 56124 KB Time limit exceeded
9 Execution timed out 1075 ms 66560 KB Time limit exceeded
10 Execution timed out 1074 ms 63072 KB Time limit exceeded