oj.uz

답안 #949107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
949107 2024-03-19T01:05:26 Z sondos225 Vudu (COCI15_vudu) C++17
14 / 140
 1000 ms 27284 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T>using ordered_set = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;//find_by_order(ind);
//order_of_key()
#define int long long
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
#define pb push_back
#define yes "YES"
#define no "NO"
#define bigg INT_MAX
#define debug(x) cout<<(#x)<<" = " <<x<<endl;
#define all(x) x.begin(),x.end()
#define sz size()
#define nn '\n'
#define mms(x,y) memset(x,y,sizeof(x))
#define forr(i,j,n) for (int i=j; i<n; i++)
#define forn(i,j,n) for (int i=j; i>n; i--)
#define fi first
#define se second
#define la "LA"
#define cinn(x,y) for(int i=0; i<y; i++) cin>>x[i];
#define pii pair<int,int>
signed main()
{
//    #ifndef LOCAL
//    freopen("lifeguards.in","r",stdin);
//    freopen("lifeguards.out","w", stdout);
//    #endif
    fast
    int n;
    cin>>n;
    int a[n];
    forr(i,0,n) cin>>a[i];
    int p;
    cin>>p;
    int sm[n];
    sm[0]=a[0];
    //int b[n];
    //b[0]=sm[0];
    //vector<int> s;
    multiset<int> s;
   // s.pb(0);
    s.insert(a[0]-p);
    s.insert(0);
    int ans=0;
    forr(i,1,n)
    {
        sm[i]=sm[i-1]+a[i];
        int x=sm[i]-(p*(i+1));

    //    sort(all(s));
        //cout<<no<<x<<endl;
       // for(auto y:s) cout<<la<<y<<endl;
       //cout<<x<<endl;
       auto k=s.lower_bound(x+1);
        int w=distance( s.begin(), k );
      //  s.order_of_key(x+1);
        //w--;
       // cout<<w<<endl;
        s.insert(x);
       // (lower_bound(all(s),x+1)-s.begin());
        //w--;
       // int d=
      // if (w==s.sz) w=0;
     // w++;

      // cout<<w<<endl;
        ans+=max(0ll,w);


      //  b[i]=;
    }
    cout<<ans;
    return 0;
}

Subtask #1
14.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 860 KB Output is correct
2 Incorrect 59 ms 816 KB Output isn't correct
3 Incorrect 45 ms 600 KB Output isn't correct
4 Execution timed out 1058 ms 25760 KB Time limit exceeded
5 Execution timed out 1042 ms 15376 KB Time limit exceeded
6 Execution timed out 1012 ms 23336 KB Time limit exceeded
7 Execution timed out 1061 ms 24172 KB Time limit exceeded
8 Execution timed out 1066 ms 22356 KB Time limit exceeded
9 Execution timed out 1042 ms 27284 KB Time limit exceeded
10 Execution timed out 1044 ms 23492 KB Time limit exceeded