oj.uz

Submission #152671

# Submission time Handle Problem Language Result Execution time Memory
152671 2019-09-09T06:24:09 Z balbit Vudu (COCI15_vudu) C++14
140 / 140
 338 ms 57008 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
#define ll long long 
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define FOR(i,a,b) for (int i=(a); i<(b); i++)
#define REP(i,n) for (int i=0; i<(n); i++)
#define RREP(i,n) for (int i=(n-1); i>=0; i--)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define bug(x) cerr<<#x<<" is "<<x<<endl
using namespace std;

#define int ll

const int iinf = 1<<29;
const ll inf = 1ll<<60;
const ll mod = 1e9+7;


void GG(){cout<<"No\n"; exit(0);}

ll mpow(ll a, ll n){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mod;
        a = a*a %mod;
        n>>=1;
    }
    return re;
}

ll inv (ll b){
    if (b==1) return b;
    return (mod-mod/b) * inv(mod%b) % mod;
}   

const int maxn = 2e6+5;

struct BIT{
    vector<int> s;
    int mx;
    ll QU(int e){
        e++; ll re = 0; 
        while(e>0) re+=s[e], e-=e&(-e);
        return re;
    }
    void MO(int e, int v){
        e++; 
        while (e<mx) s[e] += v, e+=e&(-e);
    }
    BIT(int mm){
        mx = mm; s.resize(mm+1);
    }
};

int tod[maxn];

signed main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int n; cin>>n;
    vector<int> a(n); int pp;
    vector<ll> ps(n+1);
    REP(i,n) cin>>a[i];
    cin>>pp;
    REP(i,n) a[i] -= pp;
    REP(i,n){
        ps[i+1] = ps[i] + a[i];
    }
    vector<pii> v;
    REP(i,n+1){
        v.pb({ps[i],i});
    }
    sort(ALL(v)); 
    int id = 0;
    REP(i,n+1){
        if (i || v[i].f != v[i-1].f){
            id++;
        }tod[v[i].s] = id;
    }
    BIT bb(n+4);
    ll re = 0;
    REP(i,n+1){
        re += bb.QU(tod[i]);
        bb.MO(tod[i], 1);
    }
    cout<<re<<endl;
}

Subtask #1
140.0 / 140.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 760 KB Output is correct
2 Correct 4 ms 760 KB Output is correct
3 Correct 4 ms 632 KB Output is correct
4 Correct 338 ms 55124 KB Output is correct
5 Correct 183 ms 26144 KB Output is correct
6 Correct 295 ms 44640 KB Output is correct
7 Correct 300 ms 48580 KB Output is correct
8 Correct 279 ms 36880 KB Output is correct
9 Correct 338 ms 57008 KB Output is correct
10 Correct 289 ms 46020 KB Output is correct