結果
| 問題 | No.3765 321-avoiding Grid |
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2026-10-16 22:21:25 |
| 言語 | PyPy3 (8.0.0 + ACL) |
| 結果 |
AC
不安定
|
| 実行時間 | 46 ms / 1,000 ms |
| + 300µs | |
| コード長 | 1,437 bytes |
| 記録 | |
| コンパイル時間 | 81 ms |
| コンパイル使用メモリ | 65,192 KB |
| 実行使用メモリ | 60,416 KB |
| 最終ジャッジ日時 | 2026-10-16 22:22:13 |
| 合計ジャッジ時間 | 3,699 ms |
|
ジャッジサーバーID (参考情報) |
judge5_0 / judge1_0 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 28 |
ソースコード
# https://github.com/robe2222555/atcoder-lib/blob/main/template/python/main.py
import sys
input = lambda: sys.stdin.readline().rstrip()
def LI(): return list(map(int, input().split()))
def II(): return int(input())
def solve():
N,a,b,c = LI()
if N==2:
if b==2:
print("22")
print("31")
elif a==2:
print("13")
print("21")
else:
print("32")
print("13")
return
if a>=N:
ans = [["" for _ in range(N)] for _ in range(N)]
for i in range(N):
for j in range(N):
if b>0:
ans[i][j] = "2"
b -= 1
elif a>0:
ans[i][j] = "1"
a -= 1
else:
ans[i][j] = "3"
c -= 1
for i in range(N):
print("".join(ans[i]))
return
if c>=N:
ans = [["" for _ in range(N)] for _ in range(N)]
for i in range(N):
for j in range(N):
if b>0:
ans[i][j] = "2"
b -= 1
elif c>0:
ans[i][j] = "3"
c -= 1
else:
ans[i][j] = "1"
a -= 1
for i in range(N):
print("".join(ans[i]))
return
assert a<N and c<N
ans = [["2" for _ in range(N)] for _ in range(N)]
if a<=c:
for i in range(a):
ans[0][i] = "1"
ans[1][i] = "3"
c -= 1
for i in range(c):
ans[2][i] = "3"
else:
for i in range(c):
ans[0][i] = "3"
ans[1][i] = "1"
a -= 1
for i in range(a):
ans[2][i] = "1"
for i in range(N):
print("".join(ans[i]))
return
def main():
T = 1
for _ in range(T):
solve()
return
if __name__ == '__main__':
main()