結果
問題 | No.3094 Stapler |
ユーザー |
![]() |
提出日時 | 2025-04-16 00:02:30 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 1,281 bytes |
コンパイル時間 | 217 ms |
コンパイル使用メモリ | 82,732 KB |
実行使用メモリ | 67,728 KB |
最終ジャッジ日時 | 2025-04-16 00:04:15 |
合計ジャッジ時間 | 6,196 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | RE * 71 |
ソースコード
n = int(input()) matrix = [] missing_i = -1 missing_j = -1 for i in range(n): row = input().split() for j in range(n): if row[j] == '?': missing_i = i missing_j = j matrix.append(row) if missing_j == 0: if n == 1: print(1) else: x_candidates = [] for l in range(1, n): val_str = matrix[missing_i][l] if val_str == '?': continue # should not happen as per problem statement val = int(val_str) if val == 0: continue sum_other = 0 for k in range(n): if k == missing_i: continue d_k = int(matrix[k][0]) a_kl = int(matrix[k][l]) sum_other += d_k * a_kl x_candidate = (-sum_other) // val x_candidates.append(x_candidate) # All candidates must be the same x = x_candidates[0] print(x) else: j = missing_j i = missing_i sum_other = 0 for k in range(n): if k == i: continue d_k = int(matrix[k][0]) a_kj = int(matrix[k][j]) sum_other += d_k * a_kj d_i = int(matrix[i][0]) x = (-sum_other) // d_i print(x)