oj.uz

Submission #947284

# Submission time Handle Problem Language Result Execution time Memory
947284 2024-03-15T20:53:47 Z Zena_Hossam Vudu (COCI15_vudu) C++14
42 / 140
 824 ms 65536 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
namespace __gnu_pbds
{
typedef tree<int,
        null_type,
        less_equal<int>,
        rb_tree_tag,
        tree_order_statistics_node_update> ordered_set;
}
using namespace __gnu_pbds;
#define fi ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define ll double
#define ll long long
//#define ll1 int
#define F first
#define S second
#define sz size()
#define all(s) s.begin(),s.end()
#define all1(s) s.rbegin(),s.rend()
int main()
{
    //freopen("stdin.in","r",stdin);freopen("stdout.out","w",stdout);
    ll T=1;
    fi
    //cin>>T;ll oo=0;
    while(T--)
    {
        ll n;
        cin>>n;
        ll arr[n];
        for(ll i=0; i<n; i++)
        {
            cin>>arr[i];
        }
        ll x;
        cin>>x;
        ll a[n]= {};
        ordered_set s,v;
        ll c=0;
        for(ll i=0; i<n; i++)
        {
            a[i]+=(arr[i]-x);
            if(i)a[i]+=a[i-1];
           // cout<<c<<" ";

            ll k=a[i];
            if(k>=0)
            {
                c+=(i+1-(s.size()-s.order_of_key(k+1)));
            }
            if(k<0)
            {
                c+=(v.order_of_key(k+1));
            }if(a[i]>=0)
            {
                s.insert(a[i]);
            }
            else v.insert(a[i]);
           // cout<<c<<"\n";
        }
        cout<<c;
    }
}

Subtask #1
42.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 856 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Incorrect 824 ms 65536 KB Output isn't correct
5 Incorrect 339 ms 34656 KB Output isn't correct
6 Incorrect 598 ms 59076 KB Output isn't correct
7 Incorrect 638 ms 63076 KB Output isn't correct
8 Incorrect 607 ms 48712 KB Output isn't correct
9 Incorrect 715 ms 65536 KB Output isn't correct
10 Incorrect 612 ms 61008 KB Output isn't correct