oj.uz

답안 #201800

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
201800 2020-02-12T02:58:16 Z mdn2002 Vudu (COCI15_vudu) C++14
140 / 140
 880 ms 48324 KB 
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
long long n,p,sum[1000006],tree[6000006],inda[1000006];
vector<pair<long long,int> >pr;
void up(int nod,int l,int r,int x)
{
    if(x<l||r<x)return;
    if(l==r)
    {
        tree[nod]++;
        return;
    }
    int mid=(l+r)/2;
    up(nod*2,l,mid,x);
    up(nod*2+1,mid+1,r,x);
    tree[nod]=tree[nod*2]+tree[nod*2+1];
}
long long qr(int nod,int l,int r,int x,int y)
{
    if(x<=l&&r<=y)return tree[nod];
    if(r<x||y<l)return 0;
    int mid=(l+r)/2;
    return qr(nod*2,l,mid,x,y)+qr(nod*2+1,mid+1,r,x,y);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //freopen("empty.in","r",stdin);
    //freopen("empty.out","w",stdout);
    cin>>n;
    for(int i=0;i<n;i++)
    {
        long long x;
        cin>>x;
        sum[i]=sum[i-1]+x;
    }
    cin>>p;
    for(int i=0;i<n;i++)
    {
        long long x=-sum[i-1]+(p*i);
        pr.push_back({x,i});
    }
    sort(pr.begin(),pr.end());
    for(int i=0;i<pr.size();i++)inda[pr[i].second]=i;
    long long ans=0;
    for(int i=0;i<n;i++)
    {
        long long x=inda[i];
        long long y=p-sum[i]+(p*i);
        y=lower_bound(pr.begin(),pr.end(),make_pair(y,0))-pr.begin();
        up(1,0,n+5,x);
        ans+=qr(1,0,n+5,y,n+5);
    }
    cout<<ans;
}

Compilation message

vudu.cpp: In function 'int main()':
vudu.cpp:47:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<pr.size();i++)inda[pr[i].second]=i;
                 ~^~~~~~~~~~

Subtask #1
140.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 888 KB Output is correct
2 Correct 7 ms 760 KB Output is correct
3 Correct 7 ms 760 KB Output is correct
4 Correct 880 ms 47264 KB Output is correct
5 Correct 441 ms 33984 KB Output is correct
6 Correct 707 ms 43840 KB Output is correct
7 Correct 690 ms 44736 KB Output is correct
8 Correct 626 ms 41024 KB Output is correct
9 Correct 832 ms 48324 KB Output is correct
10 Correct 703 ms 44096 KB Output is correct