結果
| 問題 |
No.3282 Photos and Friends
|
| コンテスト | |
| ユーザー |
detteiuu
|
| 提出日時 | 2025-09-26 21:58:18 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
AC
|
| 実行時間 | 488 ms / 2,000 ms |
| コード長 | 770 bytes |
| コンパイル時間 | 212 ms |
| コンパイル使用メモリ | 82,664 KB |
| 実行使用メモリ | 138,248 KB |
| 最終ジャッジ日時 | 2025-09-26 21:58:35 |
| 合計ジャッジ時間 | 10,678 ms |
|
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 50 |
ソースコード
N, P, Q = map(int, input().split())
X, A, B = map(list, zip(*[list(map(int, input().split())) for _ in range(N)]))
for i in range(N):
A[i] = min(A[i], X[i])
B[i] = min(B[i], X[i])
P = min(P, sum(A))
Q = min(Q, sum(B))
SUM = 0
C = []
for i in range(N):
if A[i]+B[i] < X[i]:
exit(print("No"))
SUM += X[i]-B[i]
C.append(X[i]-B[i])
if P < SUM:
exit(print("No"))
diff = sum(B)-Q
if diff == 0:
print("Yes")
for i in range(N):
print(C[i], B[i])
elif P < SUM+diff:
print("No")
else:
print("Yes")
for i in range(N):
if diff:
a = min(A[i]-C[i], diff, B[i])
C[i] += a
B[i] -= a
diff -= a
print(C[i], B[i])
else:
print(C[i], B[i])
detteiuu