Submission #55535551

---

Source Code Expand

// Problem: C - Sum = 0
// URL: https://atcoder.jp/contests/abc362/tasks/abc362_c
// Written by WRuperD

#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e18;
const int mininf = 1e9 + 7;
#define int long long
#define pb emplace_back
inline int read(){int x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
inline void write(int x){if(x<0){x=~(x-1);putchar('-');}if(x>9)write(x/10);putchar(x%10+'0');}
#define put() putchar(' ')
#define endl puts("")
const int MAX = 2e5 + 10;

int l[MAX], r[MAX];
int ans[MAX];

void solve(){
	int n = read();
	int cnt = 0;
	for(int i = 1; i <= n; i++){
		l[i] = read(), r[i] = read();
		ans[i] = r[i];
		cnt += r[i];
		// if(l[i] > 0)	cnt += l[i], ans[i] = l[i];
		// else (r[i] < 0)	cnt += r[i], ans[i] = r[i];
		// else cnt += 0, ans[i] = 0;
	}
	if(cnt > 0){
		for(int i = 1; i <= n; i++){
			if(ans[i] - l[i] >= cnt){
				ans[i] = l[i] + (ans[i] - l[i] - cnt);
				cnt = 0;
				break;
			}else{
				cnt -= (ans[i] - l[i]);
				ans[i] = l[i];
			}
		}
		if(cnt){
			puts("No");
			return ;
		}
	}else if(cnt < 0){
		
		if(cnt){
			puts("No");
			return ;
		}
	}
	puts("Yes");
	for(int i = 1; i <= n; i++){
		write(ans[i]), put();
	}endl;
}

signed main(){
	int t = 1;
	while(t--)	solve();
	return 0;
}

Submission Info

Judge Result