oj.uz

Submission #947991

# Submission time Handle Problem Language Result Execution time Memory
947991 2024-03-17T11:26:00 Z Zena_Hossam Vudu (COCI15_vudu) C++14
0 / 140
 739 ms 65536 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
using namespace std;
namespace __gnu_pbds
{
typedef tree<ll,
        null_type,
        less_equal<ll>,
        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 ll1 long long
#define F first
#define S second
#define sz size()
#define all(s) s.begin(),s.end()
#define all1(s) s.rbegin(),s.rend()
int arr[1000006];
int main()
{
    //freopen("stdin.in","r",stdin);freopen("stdout.out","w",stdout);
    int T=1;
    //cin>>T;ll oo=0;
    while(T--)
    {
        int n;
        cin>>n;
        for(int i=0; i<n; i++)
        {
            cin>>arr[i];
        }
        int x;
        cin>>x;
        ordered_set s;
        ll c=0,ss;
        for(int i=0; i<n; i++)
        {
            ss+=(arr[i]-x);
           // cout<<c<<" ";

            ll k=ss;
            c+=(s.order_of_key(k+1));
            if(k>=0)c++;
            s.insert(ss);
           // cout<<c<<"\n";
        }
        cout<<c;
    }
}

Subtask #1
0 / 140.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 860 KB Output isn't correct
2 Incorrect 3 ms 712 KB Output isn't correct
3 Incorrect 3 ms 604 KB Output isn't correct
4 Incorrect 739 ms 64728 KB Output isn't correct
5 Incorrect 363 ms 36692 KB Output isn't correct
6 Incorrect 584 ms 57404 KB Output isn't correct
7 Incorrect 581 ms 59536 KB Output isn't correct
8 Incorrect 510 ms 51936 KB Output isn't correct
9 Runtime error 596 ms 65536 KB Execution killed with signal 9
10 Incorrect 586 ms 58008 KB Output isn't correct