結果
問題 | No.1144 Triangles |
ユーザー | mkawa2 |
提出日時 | 2023-12-01 02:09:28 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,914 ms / 3,000 ms |
コード長 | 2,852 bytes |
コンパイル時間 | 282 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 106,000 KB |
最終ジャッジ日時 | 2023-12-01 02:09:54 |
合計ジャッジ時間 | 26,600 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
55,600 KB |
testcase_01 | AC | 41 ms
55,600 KB |
testcase_02 | AC | 42 ms
55,600 KB |
testcase_03 | AC | 42 ms
55,600 KB |
testcase_04 | AC | 1,899 ms
105,092 KB |
testcase_05 | AC | 1,914 ms
105,552 KB |
testcase_06 | AC | 1,890 ms
105,768 KB |
testcase_07 | AC | 1,851 ms
106,000 KB |
testcase_08 | AC | 1,857 ms
104,384 KB |
testcase_09 | AC | 40 ms
55,600 KB |
testcase_10 | AC | 40 ms
55,600 KB |
testcase_11 | AC | 40 ms
55,600 KB |
testcase_12 | AC | 39 ms
55,600 KB |
testcase_13 | AC | 39 ms
55,600 KB |
testcase_14 | AC | 1,769 ms
102,024 KB |
testcase_15 | AC | 1,763 ms
100,424 KB |
testcase_16 | AC | 1,837 ms
104,388 KB |
testcase_17 | AC | 1,881 ms
103,516 KB |
testcase_18 | AC | 1,872 ms
103,304 KB |
testcase_19 | AC | 274 ms
78,248 KB |
testcase_20 | AC | 103 ms
76,368 KB |
testcase_21 | AC | 98 ms
76,540 KB |
testcase_22 | AC | 1,770 ms
103,360 KB |
testcase_23 | AC | 240 ms
77,936 KB |
testcase_24 | AC | 1,761 ms
102,864 KB |
testcase_25 | AC | 719 ms
83,188 KB |
testcase_26 | AC | 183 ms
77,272 KB |
testcase_27 | AC | 297 ms
83,584 KB |
testcase_28 | AC | 478 ms
79,908 KB |
ソースコード
import sys # sys.setrecursionlimit(1000005) # sys.set_int_max_str_digits(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-(-1 << 31) inf = -1-(-1 << 63) md = 10**9+7 # md = 998244353 def arg_sort(xy): def msort(xx): if not xx: return n = len(xx) a = [xx, xx[:]] lr = [(0, n, 1, 0)] while lr: l, r, f, g = lr.pop() m = (l+r)//2 if f: lr.append((l, r, 0, g)) if m-l > 1: lr.append((l, m, 1, g ^ 1)) if r-m > 1: lr.append((m, r, 1, g ^ 1)) else: i, j, p, q = l, m, m-1, r-1 a1 = a[g] a2 = a[g ^ 1] for k in range((r-l)//2): x, y = a2[i] s, t = a2[j] if s*y-t*x > 0: a1[l+k] = a2[j] j += 1 else: a1[l+k] = a2[i] i += 1 x, y = a2[p] s, t = a2[q] if s*y-t*x > 0: a1[r-1-k] = a2[p] p -= 1 else: a1[r-1-k] = a2[q] q -= 1 if (r-l) & 1: a1[m] = a2[i] if i == p else a2[j] z1, z2, z3, z4, z5 = [], [], [], [], [] for x, y in xy: if x == y == 0: z5.append((x, y)) elif y >= 0: if x >= 0: z1.append((x, y)) else: z2.append((x, y)) else: if x < 0: z3.append((x, y)) else: z4.append((x, y)) msort(z1) msort(z2) msort(z3) msort(z4) return z1+z2+z3+z4+z5 from collections import deque n = II() xy = LLI(n) ans = 0 for i in range(n): x0, y0 = xy[i] nxy = [] for _ in range(n-1): i += 1 if i == n: i -= n nx, ny = xy[i] nxy.append((nx-x0, ny-y0)) nxy = arg_sort(nxy) q=deque() s = t = 0 for x,y in nxy: while q and q[0][0]*y-q[0][1]*x<0: qx,qy=q.popleft() s-=qx*2 t-=qy*2 ans+=s*y%md-t*x%md ans%=md q.append((x,y)) s+=x t+=y ans *= pow(3, md-2, md) print(ans%md)