oj.uz

답안 #553571

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

using namespace std;
typedef long long ll;
const ll INF=1e9;
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=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=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(int i=1;i<=n;i++)
        cin>>x[i];
    for(int i=1;i<=q;i++)
        cin>>w[i];
    smax[1]=w[1];
    smin[1]=w[1];
    for(int 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(int 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!=INF)
            {
                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!=INF)
            {
                nr=p2-mij;
                dr=mij-1;
            }
            else
                st=mij+1;
        }
        sol[i+1]+=nr;
    }
    sol[1]+=abs(smin[q]);
    sol[n]+=smax[q];
    for(int i=1;i<=n;i++)
        cout<<sol[i]<<'\n';
    return 0;
}

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 7 ms 468 KB Output is correct
7 Correct 6 ms 460 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 6 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 11 ms 476 KB Output is correct
16 Correct 10 ms 468 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 2 ms 340 KB Output is correct

Subtask #2
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 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 7 ms 468 KB Output is correct
7 Correct 6 ms 460 KB Output is correct
8 Correct 7 ms 376 KB Output is correct
9 Correct 6 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 11 ms 476 KB Output is correct
16 Correct 10 ms 468 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 26 ms 5180 KB Output is correct
21 Correct 26 ms 5152 KB Output is correct
22 Correct 26 ms 5188 KB Output is correct
23 Correct 40 ms 5236 KB Output is correct
24 Correct 210 ms 5656 KB Output is correct
25 Correct 1555 ms 9896 KB Output is correct
26 Correct 1541 ms 9944 KB Output is correct
27 Correct 1503 ms 9792 KB Output is correct
28 Correct 1429 ms 9712 KB Output is correct
29 Correct 1341 ms 9556 KB Output is correct
30 Correct 773 ms 9312 KB Output is correct
31 Correct 115 ms 8740 KB Output is correct
32 Correct 66 ms 8700 KB Output is correct
33 Correct 123 ms 1448 KB Output is correct
34 Correct 1396 ms 10044 KB Output is correct
35 Correct 1368 ms 9804 KB Output is correct
36 Correct 1579 ms 9936 KB Output is correct
37 Correct 1446 ms 9768 KB Output is correct
38 Correct 1429 ms 9800 KB Output is correct
39 Correct 1450 ms 9840 KB Output is correct
40 Correct 818 ms 9824 KB Output is correct
41 Incorrect 28 ms 5196 KB Output isn't correct
42 Halted 0 ms 0 KB -