結果

問題 No.3282 Photos and Friends
ユーザー 👑 binap
提出日時 2025-09-26 22:00:00
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,146 bytes
コンパイル時間 4,081 ms
コンパイル使用メモリ 253,584 KB
実行使用メモリ 11,136 KB
最終ジャッジ日時 2025-09-26 22:00:22
合計ジャッジ時間 18,038 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1 WA * 1
other AC * 31 WA * 19
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int main(){
	int n;
	long long p, q;
	cin >> n >> p >> q;
	vector<long long> x(n), a(n), b(n);
	vector<long long> ans1(n), ans2(n);
	rep(i, n) cin >> x[i] >> a[i] >> b[i];
	long long f = 0, g = 0, h = 0;
	rep(i, n){
		if(a[i] + b[i] < x[i]){
			cout << "No\n";
			return 0;
		}
		if(a[i] <= x[i]){
			long long delta = x[i] - a[i];
			b[i] -= delta;
			x[i] -= delta;
			g += delta;
			ans2[i] += delta;
		}
		if(b[i] <= x[i]){
			long long delta = x[i] - b[i];
			a[i] -= delta;
			x[i] -= delta;
			f += delta;
			ans1[i] += delta;
		}
		h += x[i];
	}
	if(p < f){
		cout << "No\n";
		return 0;
	}
	if(q < g){
		cout << "No\n";
		return 0;
	}
	if(p + q < f + g + h){
		cout << "No\n";
		return 0;
	}
	cerr << ans1;
	cerr << ans2;
	cerr << f << ' ' << g << ' ' << h << "\n";
	long long rest1 = p - f;
	cout << "Yes\n";
	rep(i, n){
		if(rest1 >= 0){
			long long delta = min(rest1, x[i]);
			ans1[i] += delta;
			x[i] -= delta;
		}
		{
			ans2[i] += x[i];
		}
		cout << ans1[i] << ' ' << ans2[i] << "\n";
	}
	
	
	return 0;
}
0