oj.uz

답안 #947302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947302 2024-03-15T21:15:57 Z Zena_Hossam Vudu (COCI15_vudu) C++14
98 / 140
 616 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 int
#define F first
#define S second
#define sz size()
#define all(s) s.begin(),s.end()
#define all1(s) s.rbegin(),s.rend()
ll a[1000006];
ll1 arr[1000006];
int main()
{
    //freopen("stdin.in","r",stdin);freopen("stdout.out","w",stdout);
    ll T=1;
    
    //cin>>T;ll oo=0;
    while(T--)
    {
        ll1 n;
        cin>>n;
        for(ll1 i=0; i<n; i++)
        {
            cin>>arr[i];
        }
        ll1 x;
        cin>>x;
        ordered_set s;
        ll c=0;
        for(ll1 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+=(s.order_of_key(k+1));
            }
            s.insert(a[i]);
           // cout<<c<<"\n";
        }
        cout<<c;
    }
}

Subtask #1
98.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 3 ms 860 KB Output is correct
4 Runtime error 616 ms 65536 KB Execution killed with signal 9
5 Correct 348 ms 41060 KB Output is correct
6 Correct 598 ms 64588 KB Output is correct
7 Runtime error 526 ms 65536 KB Execution killed with signal 9
8 Correct 562 ms 58692 KB Output is correct
9 Runtime error 569 ms 65536 KB Execution killed with signal 9
10 Correct 587 ms 65256 KB Output is correct