This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n"
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
* graph approach
* dp
* dividing the problem to smaller statements
* finding the real constraint
* sqrt decomposition
* greedy approach
* pigeonhole principle
* rewriting the problem/equality
* bitwise approaches
* binary search if monotonic
* divide and conquer
* combinatorics
* inclusion - exclusion
* think like bfs
*/
inline int in()
{
int x;cin >> x;
return x;
}
inline string in2()
{
string x;cin >> x;
return x;
}
void solve()
{
int n=in();
int ar[n+1];
int ar2[n+1];
int ar3[n+1];
for(int i=1;i<=n;i++) ar[i]=in();
for(int i=1;i<n;i++) ar2[i]=in();
for(int i=1;i<n;i++) ar3[i]=in();
array<int,3> hm[n+1];
for(int i=0;i<=n;i++) hm[i]={0,0,0};
for(int i=1;i<n;i++)
{
if(ar2[i]>=ar3[i])
{
hm[i][1]=ar3[i];
ar2[i]-=ar3[i];
ar3[i]=0;
}
else
{
hm[i][1]=ar2[i];
ar3[i]-=ar2[i];
ar2[i]=0;
}
}
for(int i=1;i<n;i++)
{
if(ar2[i])
{
int xd=min(ar[i],ar2[i]);
ar[i]-=xd;
ar2[i]-=xd;
hm[i][0]+=xd;
xd=min(ar[i+1],ar2[i]);
ar[i+1]-=xd;
ar2[i]-=xd;
hm[i][2]+=xd;
if(ar2[i]>0)
{
cout << "NO\n";
return;
}
}
}
int ans=0;
for(int i=1;i<n;i++)
{
int xd=min(hm[i][1],ar[i]);
hm[i][1]-=xd;
ar[i]-=xd;
hm[i][0]+=xd;
xd=min(hm[i][1],ar[i+1]);
hm[i][1]-=xd;
ar[i+1]-=xd;
hm[i][2]+=xd;
ans+=hm[i][1];
}
cout << "YES\n";
cout << ans << endl;
for(int i=1;i<n;i++) cout << hm[i][0] << " " << hm[i][1] << " " << hm[i][2] << endl;
}
int32_t main(){
cin.tie(0); ios::sync_with_stdio(0);
cout << fixed << setprecision(15);
int t=1;//cin>> t;
for(int i=1;i<=t;i++)
{
// cout << "Case #" << i << ": ";
solve();
}
return 0;
}
Compilation message (stderr)
Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
2 | #pragma optimize ("Bismillahirrahmanirrahim")
|
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |