結果
問題 | No.5009 Draw A Convex Polygon |
ユーザー | mkawa2 |
提出日時 | 2022-12-03 18:41:22 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,536 ms / 2,600 ms |
コード長 | 1,506 bytes |
コンパイル時間 | 800 ms |
実行使用メモリ | 288,128 KB |
スコア | 1,000,000 |
最終ジャッジ日時 | 2022-12-03 18:41:30 |
合計ジャッジ時間 | 6,076 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
純コード判定しない問題か言語 |
(要ログイン)
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 # md = 10**9+7 md = 998244353 n = 10**6 l = (n-8)//8 si = [0, 1] bo = [1, 1] a = 1 while len(si) < l+1: a += 1 ps, pb = si, bo si, bo = [], [] for s, b in zip(ps, pb): if bo and bo[-1]+b == a: if len(si) == l+1: break si.append(si[-1]+s) bo.append(bo[-1]+b) if len(si) == l+1: break si.append(s) bo.append(b) xx = [1] yy = [-sum(si)-sum(bo)-1] for i in range(1,l+1): xx.append(xx[-1]+bo[i]) yy.append(yy[-1]+si[i]) xx.append(xx[-1]+1) yy.append(yy[-1]+1) for i in range(l,0,-1): xx.append(xx[-1]+si[i]) yy.append(yy[-1]+bo[i]) print(n) for _ in range(4): nx, ny = [], [] for x, y in zip(xx, yy): print(x, y) nx.append(-y) ny.append(x) xx, yy = nx, ny sys.stdout.flush()