oj.uz

Submission #220382

# Submission time Handle Problem Language Result Execution time Memory
220382 2020-04-07T19:12:50 Z infinite_iq Vudu (COCI15_vudu) C++14
42 / 140
 780 ms 24184 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll inf=1e18;
const ld pai=acos(-1);
int N,n,p;
int a[1000009],id[1000009];
pi ret[1000009];
int tree[4000009];
void upd(int node,int l,int r,int k){
        if(l==r){
                tree[node]++;
                return ;
        }
        if(k<=mid)upd(node*2,l,mid,k);
        else upd(node*2+1,mid+1,r,k);
        tree[node]=tree[node*2]+tree[node*2+1];
}
int query(int node,int l,int r,int s,int e){
        if(s>r || e<l ) return 0 ;
        if(s<=l && e>=r )return tree[node];
        return query(node*2,l,mid,s,e)+query(node*2+1,mid+1,r,s,e);
}
int main(){
        scanf("%d",&n);
        for(int i=1;i<=n;i++)scanf("%d",&a[i]);
        scanf("%d",&p);
        for(int i=1;i<=n;i++)a[i]-=p;
        for ( int i = 1 ; i <= n ;i ++ ){
                a[i]+=a[i-1];
                ret[i]={a[i],i};
        }
        sort(ret,ret+n+1);
        int crnt = 0 ;
        for ( int i=1 ;i<=n ;i ++ ){
                crnt += ( ret[i].fi != ret[i-1].fi ) ;
                id [ret[i].se]=crnt;
        }
        ll ans=0;
        for(int i=0;i<=n;i++){
                ans+=query(1,0,n,0,id[i]);
                upd(1,0,n,id[i]);
        }
        printf("%lld\n",ans);
}

Compilation message

vudu.cpp: In function 'int main()':
vudu.cpp:47:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&n);
         ~~~~~^~~~~~~~~
vudu.cpp:48:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         for(int i=1;i<=n;i++)scanf("%d",&a[i]);
                              ~~~~~^~~~~~~~~~~~
vudu.cpp:49:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&p);
         ~~~~~^~~~~~~~~

Subtask #1
42.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 512 KB Output is correct
2 Correct 8 ms 512 KB Output is correct
3 Correct 7 ms 512 KB Output is correct
4 Incorrect 750 ms 23672 KB Output isn't correct
5 Incorrect 392 ms 17144 KB Output isn't correct
6 Incorrect 668 ms 22008 KB Output isn't correct
7 Incorrect 694 ms 22520 KB Output isn't correct
8 Incorrect 605 ms 20600 KB Output isn't correct
9 Incorrect 780 ms 24184 KB Output isn't correct
10 Incorrect 665 ms 22136 KB Output isn't correct