제출 #1306787

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1306787		hssaan_arif	Rainy Markets (CCO22_day1problem2)	C++20	5 / 25	336 ms	61244 KiB

Main

#include <bits/stdc++.h>
using namespace std;

#define endl "\n"
#define pb push_back
#define int long long
#define fi first
#define se second

const int N = 1e6 + 5, M = 1e9 + 7, LG = 20;

int n , A[N] , B[N] , C[N] , D[N] , E[N];

void solve(){
    cin >> n;

    for (int i=1 ; i<=n ; i++){
        cin >> A[i];
    }

    for (int i=1 ; i<n ; i++){
        cin >> B[i];
    }

    for (int i=1 ; i<n ; i++){
        cin >> C[i];
    }

    for (int i=1 ; i<n ; i++){
        int p = min(A[i] , B[i]);

        A[i] -= p;
        D[i] += p;

        A[i+1] -= (B[i] - p);
        if (A[i+1] < 0){
            cout << "NO" << endl;
            return;
        }
        E[i] += (B[i] - p);
    }

    for (int i=1 ; i<=n ; i++){
        if (A[i] < 0){
            cout << "NO" << endl;
            return;
        }
    }

    cout << "YES" << endl;
    cout << 0 << endl;
    for (int i=1 ; i<n ; i++){
        cout << D[i] << ' ' << 0 << ' ' << E[i] << endl;
    }

}

signed main(){
    // freopen("" , "r" , stdin);
    // freopen("" , "w" , stdout);
    // cout << setprecision(30);
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int ts = 1;
    // cin >> ts;
    while(ts--){
        solve();
    }
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 6
• Subtask 4: 0 / 9