oj.uz

Submission #638749

# Submission time Handle Problem Language Result Execution time Memory
638749 2022-09-07T09:06:54 Z morasha3 Rainy Markets (CCO22_day1problem2) C++17
5 / 25
 493 ms 70692 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef   double ld;
const ll mod=1e9+7;
#define endl '\n'

int32_t main()
{
    //freopen("jumping.in","r",stdin);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll n;
    cin>>n;
    ll arr[n];
    for(int i=0;i<n;i++)
    {
        cin>>arr[i];
    }
    vector<ll>v,b;
    for(int i=0;i<n-1;i++)
    {
        ll x;
        cin>>x;
        v.push_back(x);
    }

    for(int i=0;i<n-1;i++)
    {
        ll x;
        cin>>x;
        b.push_back(x);
    }
    bool f=1;
    ll cnt=0;
    for(int i=0;i<n-1;i++)
    {
        ll o=v[i];
        o-=arr[i]-cnt;
        cnt=0;
        if(o>0)
        {
            o-=b[i];
            if(o>0)
            {
                ll u=o;
                o-=arr[i+1];
                if(o>0)
                {
                    f=0;
                    break;
                }
                cnt=u;
            }
        }
    }
    if(f==0)
    {
        cout<<"NO";
    }
    else
    {
        cnt=0;
        ll ans=0;
        cout<<"YES"<<endl;
        cnt=0;
        vector<ll>ans1,ans2,ans3;
        for(int i=0;i<n-1;i++)
        {
            ll o=v[i];
            o-=arr[i];
            ans1.push_back(min(arr[i],v[i]));
            arr[i]-=min(arr[i],v[i]);
            if(o>0)
            {
                v[i]=o;
                o-=b[i];
                ans2.push_back(min(b[i],v[i]));
                if(o>0)
                {
                    v[i]=o;
                    ans3.push_back(v[i]);
                    arr[i+1]-=v[i];
                }
                else ans3.push_back(0);
            }
            else
            {
                ans2.push_back(0);
                ans3.push_back(0);
            }
        }
        for(int i=0;i<n-1;i++)
        {
            if(arr[i+1]>0)
            {
                ll o=min(ans2[i],arr[i+1]);
                ans2[i]-=o;
                ans3[i]+=o;
            }
            ans+=ans2[i];
        }
        cout<<ans<<endl;
        for(int i=0;i<n-1;i++)
        {
            cout<<ans1[i]<<" "<<ans2[i]<<" "<<ans3[i]<<endl;
        }
    }


    return 0;

}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 214 ms 29848 KB Output is correct
5 Correct 262 ms 29696 KB Output is correct
6 Correct 210 ms 29768 KB Output is correct
7 Correct 253 ms 29544 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 391 ms 54660 KB Output is correct
11 Correct 366 ms 56308 KB Output is correct
12 Correct 477 ms 68548 KB Output is correct
13 Correct 472 ms 62940 KB Output is correct
14 Correct 211 ms 29652 KB Output is correct
15 Correct 472 ms 70492 KB Output is correct
16 Correct 464 ms 70556 KB Output is correct
17 Correct 486 ms 70508 KB Output is correct
18 Correct 467 ms 70612 KB Output is correct
19 Correct 471 ms 70692 KB Output is correct
20 Correct 471 ms 70636 KB Output is correct
21 Correct 465 ms 70228 KB Output is correct
22 Correct 475 ms 67852 KB Output is correct
23 Correct 467 ms 70556 KB Output is correct
24 Correct 462 ms 69792 KB Output is correct
25 Correct 249 ms 29664 KB Output is correct
26 Correct 270 ms 29588 KB Output is correct
27 Correct 483 ms 70624 KB Output is correct
28 Correct 493 ms 68560 KB Output is correct
29 Correct 473 ms 70524 KB Output is correct
30 Correct 477 ms 70624 KB Output is correct
31 Correct 489 ms 69196 KB Output is correct
32 Correct 462 ms 70192 KB Output is correct
33 Correct 268 ms 29228 KB Output is correct
34 Correct 260 ms 29216 KB Output is correct
35 Correct 235 ms 29176 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 1 ms 468 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 1 ms 468 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 214 ms 29848 KB Output is correct
5 Correct 262 ms 29696 KB Output is correct
6 Correct 210 ms 29768 KB Output is correct
7 Correct 253 ms 29544 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 391 ms 54660 KB Output is correct
11 Correct 366 ms 56308 KB Output is correct
12 Correct 477 ms 68548 KB Output is correct
13 Correct 472 ms 62940 KB Output is correct
14 Correct 211 ms 29652 KB Output is correct
15 Correct 472 ms 70492 KB Output is correct
16 Correct 464 ms 70556 KB Output is correct
17 Correct 486 ms 70508 KB Output is correct
18 Correct 467 ms 70612 KB Output is correct
19 Correct 471 ms 70692 KB Output is correct
20 Correct 471 ms 70636 KB Output is correct
21 Correct 465 ms 70228 KB Output is correct
22 Correct 475 ms 67852 KB Output is correct
23 Correct 467 ms 70556 KB Output is correct
24 Correct 462 ms 69792 KB Output is correct
25 Correct 249 ms 29664 KB Output is correct
26 Correct 270 ms 29588 KB Output is correct
27 Correct 483 ms 70624 KB Output is correct
28 Correct 493 ms 68560 KB Output is correct
29 Correct 473 ms 70524 KB Output is correct
30 Correct 477 ms 70624 KB Output is correct
31 Correct 489 ms 69196 KB Output is correct
32 Correct 462 ms 70192 KB Output is correct
33 Correct 268 ms 29228 KB Output is correct
34 Correct 260 ms 29216 KB Output is correct
35 Correct 235 ms 29176 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 320 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 0 ms 340 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 328 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Incorrect 1 ms 468 KB Output isn't correct
45 Halted 0 ms 0 KB -