제출 #165578

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
165578		Atill83	Vudu (COCI15_vudu)	C++14	56 / 140	783 ms	65540 KiB

vudu

#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e6+5;
    
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int a[MAXN];
ll pre[MAXN];
map<ll, int> mp;
vector<ll> events;
int t[MAXN];
    
void upd(int pos){
    for(; pos < MAXN; pos += (pos & -pos)){
        t[pos]++;
    }
}
    
ll get(int pos){
    ll res = 0;
    for(; pos > 0; pos -= (pos &-pos))
        res += t[pos];
    return res;
}
    
    
    
    
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    
    #ifdef Local
        freopen("../IO/int.txt","r",stdin);
        freopen("../IO/out.txt","w",stdout);
    #endif
    
    cin>>n;
    
    for(ll i = 1; i <= n; i++){
        cin>>a[i];
        pre[i] = pre[i - 1] + a[i];
    }
    
    ll P;
    cin>>P;
    for(int i = 0; i <= n; i++){
        events.push_back(pre[i] - P*i);
    }
    sort(events.begin(), events.end());
    events.resize(unique(events.begin(), events.end()) - events.begin());
    int nx = 1;
    for(ll i: events){
        mp[i] = nx++;
    }
    ll ans = 0;
    upd(mp[0]);
    for(ll i = 1; i <= n; i++){
        ans += get(mp[pre[i] - P*i]);
        upd(mp[pre[i] - P*i]);
    }
    cout<<ans<<endl;
    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

• Subtask 1: 56 / 140