Submission #851551

#	Time	Username	Problem	Language	Result	Execution time	Memory
851551		bachhoangxuan	Rainy Markets (CCO22_day1problem2)	C++17	5 / 25	408 ms	61464 KiB

Main

// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=1000005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int n,b[maxn],p[maxn],u[maxn];
pii a[maxn];

void solve(){
    cin >> n;
    for(int i=1;i<=n;i++) cin >> b[i];
    for(int i=1;i<n;i++) cin >> p[i];
    for(int i=1;i<n;i++) cin >> u[i];
    for(int i=1;i<n;i++){
        int d=min(p[i],b[i]-a[i].fi);
        a[i].se+=d;p[i]-=d;
        d=min(p[i],b[i+1]);
        a[i+1].fi=d;p[i]-=d;
    }
    for(int i=n-1;i>=1;i--){
        int d=min(b[i+1]-a[i+1].fi-a[i+1].se,p[i]+a[i].se);
        a[i+1].fi+=d;
        int k=min(d,p[i]);
        p[i]-=k;d-=k;a[i].se-=d;
    }
    int res=0;
    for(int i=1;i<n;i++){
        if(u[i]>=p[i]){
            int d=min({a[i+1].fi,u[i]-p[i],p[i+1]+a[i+2].fi});
            p[i]+=d;a[i+1].fi-=d;
            a[i+1].se+=d;
            int k=min(p[i+1],d);
            p[i+1]-=k;a[i+2].fi-=(d-k);
        }
        else{
            int d=min(p[i]-u[i],a[i+1].se);
            a[i+1].se-=d;p[i+1]+=d;
            p[i]-=d;a[i+1].fi+=d;
        }
        if(p[i]>u[i]){
            cout << "NO\n";
            return;
        }
        res+=p[i];
    }
    cout << "YES\n";
    cout << res << '\n';
    for(int i=1;i<n;i++) cout << a[i].se << ' ' << p[i] << ' ' << a[i+1].fi << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

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