제출 #711117

#제출 시각아이디문제언어결과실행 시간메모리
711117ld_minh4354Rainy Markets (CCO22_day1problem2)C++17
0 / 25
1 ms340 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define fi first #define se second #define pb push_back #define debug(x) cout<<#x<<": "<<x<<"\n" int n,i,x,y,b[1000005],p[1000005],u[1000005]; pair<int,int> ans[1000005]; signed main() { ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); // freopen("input.000","r",stdin); // freopen("output.000","w",stdout); // srand((unsigned)time(NULL)); // rand() cin>>n; for (i=1;i<n+1;i++) cin>>b[i]; for (i=1;i<n;i++) cin>>p[i]; for (i=1;i<n;i++) cin>>u[i]; for (i=1;i<n;i++) { ans[i].fi=min(b[i],p[i]); ans[i].se=p[i]-ans[i].fi; if (ans[i].se>b[i+1]) { cout<<"NO";return 0; } b[i+1] -= ans[i].se; } cout<<"YES"; for (i=1;i<n;i++) cout<<"\n"<<ans[i].fi<<" 0 "<<ans[i].se; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...