結果
問題 | No.1999 Lattice Teleportation |
ユーザー | vwxyz |
提出日時 | 2023-09-03 00:11:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,412 ms / 2,000 ms |
コード長 | 1,862 bytes |
コンパイル時間 | 294 ms |
コンパイル使用メモリ | 87,120 KB |
実行使用メモリ | 162,708 KB |
最終ジャッジ日時 | 2023-09-03 00:11:51 |
合計ジャッジ時間 | 26,408 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 217 ms
91,224 KB |
testcase_01 | AC | 241 ms
91,432 KB |
testcase_02 | AC | 215 ms
91,260 KB |
testcase_03 | AC | 214 ms
90,988 KB |
testcase_04 | AC | 234 ms
93,952 KB |
testcase_05 | AC | 249 ms
95,104 KB |
testcase_06 | AC | 270 ms
95,152 KB |
testcase_07 | AC | 227 ms
93,876 KB |
testcase_08 | AC | 229 ms
93,828 KB |
testcase_09 | AC | 215 ms
91,432 KB |
testcase_10 | AC | 206 ms
91,432 KB |
testcase_11 | AC | 267 ms
94,744 KB |
testcase_12 | AC | 1,034 ms
162,708 KB |
testcase_13 | AC | 1,388 ms
162,240 KB |
testcase_14 | AC | 222 ms
91,192 KB |
testcase_15 | AC | 1,349 ms
161,848 KB |
testcase_16 | AC | 787 ms
131,136 KB |
testcase_17 | AC | 1,209 ms
154,472 KB |
testcase_18 | AC | 1,045 ms
147,736 KB |
testcase_19 | AC | 1,124 ms
152,528 KB |
testcase_20 | AC | 1,365 ms
162,608 KB |
testcase_21 | AC | 1,340 ms
161,868 KB |
testcase_22 | AC | 1,331 ms
161,924 KB |
testcase_23 | AC | 305 ms
98,160 KB |
testcase_24 | AC | 588 ms
115,388 KB |
testcase_25 | AC | 1,079 ms
147,364 KB |
testcase_26 | AC | 950 ms
137,020 KB |
testcase_27 | AC | 861 ms
131,108 KB |
testcase_28 | AC | 1,412 ms
157,652 KB |
testcase_29 | AC | 735 ms
122,676 KB |
testcase_30 | AC | 437 ms
106,016 KB |
testcase_31 | AC | 391 ms
103,072 KB |
testcase_32 | AC | 882 ms
134,320 KB |
ソースコード
import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write #import pypyjit #pypyjit.set_param('max_unroll_recursion=-1') def Declination_Sort(XY): class xy: def __init__(self,x,y): self.x=x self.y=y def __lt__(self,other): if (self.y,self.x)>=(0,0) and (other.y,other.x)<(0,0): return True if (self.y,self.x)<(0,0) and (other.y,other.x)>=(0,0): return False return self.x*other.y>self.y*other.x assert all(x or y for x,y in XY) lst=[xy(x,y) for x,y in XY] lst.sort() return [(lst[i].x,lst[i].y) for i in range(len(lst))] N=int(readline()) mod=10**9+7 XY=[] for n in range(N): x,y=map(int,readline().split()) if x or y: XY.append((x,y)) XY.append((-x,-y)) else: N-=1 if not N: ans=1 else: XY=Declination_Sort(XY) X,Y=[0],[0] for x,y in XY: X.append(x) Y.append(y) for i in range(1,2*N+1): X[i]+=X[i-1] Y[i]+=Y[i-1] sum_X=sum(X) sum_Y=sum(Y) S=0 b=0 for x,y,xx,yy in zip(X,Y,X[1:],Y[1:]): S+=x*yy-y*xx b+=GCD(x-xx,y-yy) S//=2 i=S-b//2+1 ans=i+b ans%=mod print(ans)