oj.uz

답안 #553585

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553585 2022-04-26T09:50:15 Z andrei_boaca Snowball (JOI21_ho_t2) C++14
33 / 100
 1610 ms 10528 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll INF=1e17;
ll n,q,x[200005],w[200005],smax[200005],smin[200005],sol[200005];
ll getfst(ll need)
{
    assert(need!=0);
    if(need>0)
    {
        ll st=1;
        ll dr=q;
        ll poz=INF;
        while(st<=dr)
        {
            ll mij=(st+dr)/2;
            if(smax[mij]>=need)
            {
                poz=min(poz,mij);
                dr=mij-1;
            }
            else
                st=mij+1;
        }
        return poz;
    }
    else
    {
        ll st=1;
        ll dr=q;
        ll poz=INF;
        while(st<=dr)
        {
            ll mij=(st+dr)/2;
            if(smin[mij]<=need)
            {
                poz=min(poz,mij);
                dr=mij-1;
            }
            else
                st=mij+1;
        }
        return poz;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>q;
    for(ll i=1;i<=n;i++)
        cin>>x[i];
    for(ll i=1;i<=q;i++)
        cin>>w[i];
    smax[1]=w[1];
    smin[1]=w[1];
    for(ll i=2;i<=q;i++)
    {
        w[i]=w[i-1]+w[i];
        smax[i]=max(smax[i-1],w[i]);
        smin[i]=min(smin[i-1],w[i]);
    }
    for(ll i=1;i<n;i++)
    {
        ll p1=x[i];
        ll p2=x[i+1];
        ll st=p1+1;
        ll dr=p2;
        ll nr=0;
        while(st<=dr)
        {
            ll mij=(st+dr)/2;
            ll needL=mij-p1;
            ll needR=(mij-1)-p2;
            ll fstL=getfst(needL);
            ll fstR=getfst(needR);
            if(fstL<fstR&&fstL<=q)
            {
                nr=mij-p1;
                st=mij+1;
            }
            else
                dr=mij-1;
        }
        sol[i]+=nr;
        st=p1;
        dr=p2-1;
        nr=0;
        while(st<=dr)
        {
            ll mij=(st+dr)/2;
            ll needL=mij+1-p1;
            ll needR=mij-p2;
            ll fstL=getfst(needL);
            ll fstR=getfst(needR);
            if(fstR<fstL&&fstR<=q)
            {
                nr=p2-mij;
                dr=mij-1;
            }
            else
                st=mij+1;
        }
        sol[i+1]+=nr;
    }
    sol[1]-=smin[q];
    sol[n]+=smax[q];
    for(ll i=1;i<=n;i++)
        cout<<sol[i]<<'\n';
    return 0;
}

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 10 ms 468 KB Output is correct
5 Correct 9 ms 464 KB Output is correct
6 Correct 8 ms 468 KB Output is correct
7 Correct 7 ms 380 KB Output is correct
8 Correct 7 ms 464 KB Output is correct
9 Correct 6 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 10 ms 468 KB Output is correct
16 Correct 9 ms 476 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 468 KB Output is correct

Subtask #2
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 10 ms 468 KB Output is correct
5 Correct 9 ms 464 KB Output is correct
6 Correct 8 ms 468 KB Output is correct
7 Correct 7 ms 380 KB Output is correct
8 Correct 7 ms 464 KB Output is correct
9 Correct 6 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 324 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 10 ms 468 KB Output is correct
16 Correct 9 ms 476 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 32 ms 5856 KB Output is correct
21 Correct 28 ms 5764 KB Output is correct
22 Correct 29 ms 5752 KB Output is correct
23 Correct 40 ms 5708 KB Output is correct
24 Correct 183 ms 6216 KB Output is correct
25 Correct 1579 ms 10448 KB Output is correct
26 Correct 1604 ms 10380 KB Output is correct
27 Correct 1464 ms 10316 KB Output is correct
28 Correct 1445 ms 10296 KB Output is correct
29 Correct 1345 ms 10092 KB Output is correct
30 Correct 774 ms 9668 KB Output is correct
31 Correct 112 ms 9292 KB Output is correct
32 Correct 82 ms 9268 KB Output is correct
33 Correct 125 ms 1612 KB Output is correct
34 Correct 1473 ms 10524 KB Output is correct
35 Correct 1404 ms 10304 KB Output is correct
36 Correct 1610 ms 10528 KB Output is correct
37 Correct 1518 ms 10244 KB Output is correct
38 Correct 1468 ms 10272 KB Output is correct
39 Correct 1513 ms 10280 KB Output is correct
40 Correct 801 ms 10260 KB Output is correct
41 Incorrect 42 ms 5748 KB Output isn't correct
42 Halted 0 ms 0 KB -