結果

問題 No.3282 Photos and Friends
ユーザー lif4635
提出日時 2025-09-26 21:46:57
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 255 ms / 2,000 ms
コード長 2,281 bytes
コンパイル時間 450 ms
コンパイル使用メモリ 82,640 KB
実行使用メモリ 82,576 KB
最終ジャッジ日時 2025-09-26 21:47:07
合計ジャッジ時間 9,679 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff # 

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


n, p, q = MI()

aa = [0] * n
bb = [0] * n
rr = [0] * n
for i in range(n):
    x, a, b = MI()
    if x > a + b:
        print("No")
        exit()
    else:
        r = a + b - x # あまり
        aa[i] = max(a - r, 0)
        bb[i] = max(b - r, 0)
        r = x - (aa[i] + bb[i]) # 真のあまり
        p -= aa[i]
        q -= bb[i]
        rr[i] = r

# print(aa, bb, rr)

if p < 0 or q < 0:
    print("No")
    exit()

for i in range(n):
    
    if rr[i] <= p:
        aa[i] += rr[i]
        p -= rr[i]
        continue
    
    if rr[i] > p:
        aa[i] += p
        rr[i] -= p
        p = 0
    
    if rr[i] <= q:
        bb[i] += rr[i]
        q -= rr[i]
        continue
    
    print("No")
    exit()
    
if p < 0 or q < 0:
    print("No")
    exit()

yes()
for i in range(n):
    print(aa[i], bb[i])
0