oj.uz

Submission #1039306

# Submission time Handle Problem Language Result Execution time Memory
1039306 2024-07-30T16:47:46 Z DucNguyen2007 Snowball (JOI21_ho_t2) C++14
33 / 100
 2500 ms 6796 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fi first
#define se second
const int maxN=2e5+5;
const ll inf=2e18;
int n,q;
pll b[maxN+1];
ll x[maxN+1],a[maxN+1],w[maxN+1];
int main()
{
    //freopen("","r",stdin);
    //freopen("","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.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];
    }
    ll val=0,l=0,r=0;
    for(int j=1;j<=q;j++)
    {
        val+=w[j];
        l=max(l,val);
        r=max(r,-val);
        //cout<<j<<'\n';
        for(int i=1;i<n;i++)
        {
            ll tmp=x[i+1]-x[i];
            //cout<<i<<" "<<tmp<<" "<<l[i]<<" "<<r[i+1]<<'\n';
            if(l+r<=tmp)
            {
                b[i].fi=l;
                b[i].se=r;
            }
            else
            {
                ll pre_l=b[i].fi,pre_r=b[i].se;
                ll cur=tmp-pre_l-pre_r;
                if(val>0)
                {
                    b[i].fi+=cur;
                }
                else b[i].se+=cur;
            }
        }
    }
    //cout<<b[1].fi<<'\n';
    for(int i=1;i<=n;i++)
    {
        if(i<n)
        {
            a[i]+=b[i].fi;
            a[i+1]+=b[i].se;
        }
        if(i==1)
        {
            a[i]+=r;
        }
        if(i==n)
        {
            a[i]+=l;
        }
        cout<<a[i]<<'\n';
    }
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 6 ms 4444 KB Output is correct
5 Correct 6 ms 4440 KB Output is correct
6 Correct 6 ms 4584 KB Output is correct
7 Correct 5 ms 4580 KB Output is correct
8 Correct 6 ms 4444 KB Output is correct
9 Correct 6 ms 4444 KB Output is correct
10 Correct 5 ms 4444 KB Output is correct
11 Correct 3 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 0 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 6 ms 4444 KB Output is correct
16 Correct 6 ms 4440 KB Output is correct
17 Correct 5 ms 4444 KB Output is correct
18 Correct 0 ms 4444 KB Output is correct
19 Correct 3 ms 4444 KB Output is correct

Subtask #2
0 / 67.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 6 ms 4444 KB Output is correct
5 Correct 6 ms 4440 KB Output is correct
6 Correct 6 ms 4584 KB Output is correct
7 Correct 5 ms 4580 KB Output is correct
8 Correct 6 ms 4444 KB Output is correct
9 Correct 6 ms 4444 KB Output is correct
10 Correct 5 ms 4444 KB Output is correct
11 Correct 3 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 0 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 6 ms 4444 KB Output is correct
16 Correct 6 ms 4440 KB Output is correct
17 Correct 5 ms 4444 KB Output is correct
18 Correct 0 ms 4444 KB Output is correct
19 Correct 3 ms 4444 KB Output is correct
20 Correct 16 ms 6744 KB Output is correct
21 Correct 19 ms 6748 KB Output is correct
22 Correct 58 ms 6796 KB Output is correct
23 Correct 427 ms 6744 KB Output is correct
24 Execution timed out 2556 ms 6748 KB Time limit exceeded
25 Halted 0 ms 0 KB -