結果
問題 | No.1988 Divisor Tiling |
ユーザー |
![]() |
提出日時 | 2022-06-24 21:52:30 |
言語 | Python3 (3.13.1 + numpy 2.2.1 + scipy 1.14.1) |
結果 |
AC
|
実行時間 | 42 ms / 2,000 ms |
コード長 | 1,980 bytes |
コンパイル時間 | 445 ms |
コンパイル使用メモリ | 12,672 KB |
実行使用メモリ | 11,776 KB |
最終ジャッジ日時 | 2024-11-08 17:47:17 |
合計ジャッジ時間 | 2,795 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 32 |
ソースコード
import sys#input = sys.stdin.readline#input = sys.stdin.buffer.readline #文字列はダメ#sys.setrecursionlimit(1000000)#import bisect#import itertools#import random#from heapq import heapify, heappop, heappushfrom collections import defaultdict#from collections import deque#import copyimport math#from functools import lru_cache#@lru_cache(maxsize=None)MOD = pow(10,9) + 7#MOD = 998244353#dx = [1,0,-1,0]#dy = [0,1,0,-1]#dx8 = [1,1,0,-1,-1,-1,0,1]#dy8 = [0,1,1,1,0,-1,-1,-1]def make_divisors(n):lower_divisors , upper_divisors = [], []i = 1while i*i <= n:if n % i == 0:lower_divisors.append(i)if i != n // i:upper_divisors.append(n//i)i += 1return lower_divisors + upper_divisors[::-1]def main():N,H = map(int,input().split())TN = Ndic = defaultdict(int)for i in range(2,100000):while TN%i == 0:TN //= idic[i] += 1yakusu_list = make_divisors(N)[:-1]#print(dic)# # 2以外の素因数# mx = max(list(dic.keys()))Flag = Falseif H >= N//H:Flag = TrueW = HH = N//Helse:W = N//H#print(H,W)#print(yakusu_list)ans = [[-1]*W for _ in range(H)]idx = 0while yakusu_list[-1] >= W:tate = yakusu_list[-1]//Wfor i in range(tate):for j in range(W):ans[idx][j] = yakusu_list[-1]idx += 1yakusu_list.pop()idx = 0while yakusu_list:v = yakusu_list.pop()for i in range(v):ans[-1][idx] = vidx += 1#print(ans)if Flag:tans = [[-1]*H for _ in range(W)]ans,tans = tans,ans#print(tans)for i in range(H):for j in range(W):ans[j][i] = tans[i][j]#print(ans)for ret in ans:print(*ret)if __name__ == '__main__':main()