oj.uz

Submission #523321

# Submission time Handle Problem Language Result Execution time Memory
523321 2022-02-07T12:53:14 Z lucri Snowball (JOI21_ho_t2) C++17
33 / 100
 213 ms 9412 KB 
#include <iostream>
#include <cmath>
#define ll long long
#define int ll
using namespace std;
int n,q,x[200010],ans[200010],mp[200010],w,cnt,dmin,dmax;
int cb(int b,int e,int val)
{
    if(b>e)
        return b;
    int m=(b+e)/2;
    if(abs(mp[m-1])+abs(mp[m])<val)
        return cb(m+1,e,val);
    return cb(b,m-1,val);
}
main()
{
    cin>>n>>q;
    for(int i=1;i<=n;++i)
    {
        cin>>x[i];
    }
    int dp=0;
    for(int 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(int i=1;i<n;++i)
    {
        int 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(int i=1;i<=n;++i)
    {
        cout<<ans[i]<<'\n';
    }
    return 0;
}

Compilation message

Main.cpp:16:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   16 | main()
      | ^~~~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 308 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 2 ms 332 KB Output is correct

Subtask #2
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 308 KB Output is correct
6 Correct 3 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 3 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 1 ms 300 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 86 ms 3100 KB Output is correct
21 Correct 77 ms 2912 KB Output is correct
22 Correct 78 ms 2860 KB Output is correct
23 Correct 70 ms 2636 KB Output is correct
24 Correct 73 ms 3068 KB Output is correct
25 Correct 193 ms 9412 KB Output is correct
26 Correct 190 ms 9372 KB Output is correct
27 Correct 204 ms 9076 KB Output is correct
28 Correct 213 ms 9232 KB Output is correct
29 Correct 185 ms 8380 KB Output is correct
30 Correct 177 ms 7332 KB Output is correct
31 Correct 137 ms 6724 KB Output is correct
32 Correct 138 ms 6864 KB Output is correct
33 Incorrect 20 ms 1192 KB Output isn't correct
34 Halted 0 ms 0 KB -