oj.uz

답안 #523329

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
523329 2022-02-07T13:05:55 Z lucri Snowball (JOI21_ho_t2) C++17
33 / 100
 192 ms 9500 KB 
#include <iostream>
#include <cmath>
using namespace std;
long long n,q,x[200010],ans[200010],mp[200010],w,cnt,dmin,dmax;
long long cb(long long b,long long e,long long val)
{
    while(b<=e)
    {
        long long m=(b+e)/2;
        if(mp[m-1]-mp[m]<val&&mp[m]-mp[m-1]<val)
            b=m+1;
        else
            e=m-1;
    }
    return b;
}
int main()
{
    cin>>n>>q;
    for(long long i=1;i<=n;++i)
    {
        cin>>x[i];
    }
    long long dp=0;
    for(long long i=1;i<=q;++i)
    {
        cin>>w;
        dp+=w;
        if(dp<0)
        {
            if(mp[cnt]<0)
            {
                if(dp<mp[cnt])
                    mp[cnt]=dp;
            }
            else
            {
                if(dp<dmin)
                {
                    mp[++cnt]=dp;
                    dmin=dp;
                }
            }
        }
        else if(dp>0)
        {
            if(mp[cnt]>0)
            {
                if(dp>mp[cnt])
                    mp[cnt]=dp;
            }
            else
            {
                if(dp>dmax)
                {
                    mp[++cnt]=dp;
                    dmax=dp;
                }
            }
        }
    }
    if(mp[cnt]<0)
    {
        ans[1]-=mp[cnt];
        ans[n]+=mp[cnt-1];
    }
    else
    {
        ans[1]-=mp[cnt-1];
        ans[n]+=mp[cnt];
    }
    for(long long i=1;i<n;++i)
    {
        long long b=cb(1,cnt,x[i+1]-x[i]);
        if(b>cnt)
        {
            if(mp[cnt]<0)
            {
                ans[i+1]-=mp[cnt];
                ans[i]+=mp[cnt-1];
            }
            else
            {
                ans[i+1]-=mp[cnt-1];
                ans[i]+=mp[cnt];
            }
        }
        else
        {
            if(mp[b]<0)
            {
                ans[i]+=mp[b-1];
                ans[i+1]+=x[i+1]-x[i]-mp[b-1];
            }
            else
            {
                ans[i+1]-=mp[b-1];
                ans[i]+=x[i+1]-x[i]+mp[b-1];
            }
        }
    }
    for(long long i=1;i<=n;++i)
    {
        cout<<ans[i]<<'\n';
    }
    return 0;
}

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 312 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 312 KB Output is correct
8 Correct 2 ms 312 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 2 ms 316 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 2 ms 332 KB Output is correct

Subtask #2
0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 312 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 312 KB Output is correct
8 Correct 2 ms 312 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 296 KB Output is correct
15 Correct 3 ms 332 KB Output is correct
16 Correct 2 ms 316 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 292 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 84 ms 3012 KB Output is correct
21 Correct 78 ms 2960 KB Output is correct
22 Correct 74 ms 2748 KB Output is correct
23 Correct 71 ms 2624 KB Output is correct
24 Correct 75 ms 3160 KB Output is correct
25 Correct 187 ms 9500 KB Output is correct
26 Correct 190 ms 9228 KB Output is correct
27 Correct 191 ms 9188 KB Output is correct
28 Correct 192 ms 9128 KB Output is correct
29 Correct 190 ms 8352 KB Output is correct
30 Correct 152 ms 7364 KB Output is correct
31 Correct 174 ms 6748 KB Output is correct
32 Correct 141 ms 6848 KB Output is correct
33 Incorrect 23 ms 1240 KB Output isn't correct
34 Halted 0 ms 0 KB -