結果
問題 | No.2355 Unhappy Back Dance |
ユーザー | mkawa2 |
提出日時 | 2023-06-16 23:07:28 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 3,100 ms / 6,000 ms |
コード長 | 2,591 bytes |
コンパイル時間 | 920 ms |
コンパイル使用メモリ | 87,068 KB |
実行使用メモリ | 129,428 KB |
最終ジャッジ日時 | 2023-09-06 22:00:51 |
合計ジャッジ時間 | 44,015 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
71,256 KB |
testcase_01 | AC | 76 ms
71,244 KB |
testcase_02 | AC | 75 ms
71,232 KB |
testcase_03 | AC | 76 ms
71,240 KB |
testcase_04 | AC | 76 ms
71,236 KB |
testcase_05 | AC | 76 ms
70,980 KB |
testcase_06 | AC | 620 ms
85,172 KB |
testcase_07 | AC | 614 ms
84,952 KB |
testcase_08 | AC | 614 ms
85,192 KB |
testcase_09 | AC | 609 ms
85,032 KB |
testcase_10 | AC | 759 ms
86,852 KB |
testcase_11 | AC | 912 ms
89,896 KB |
testcase_12 | AC | 628 ms
85,676 KB |
testcase_13 | AC | 632 ms
85,100 KB |
testcase_14 | AC | 745 ms
86,604 KB |
testcase_15 | AC | 73 ms
71,136 KB |
testcase_16 | AC | 3,070 ms
128,308 KB |
testcase_17 | AC | 3,015 ms
127,880 KB |
testcase_18 | AC | 3,100 ms
128,688 KB |
testcase_19 | AC | 3,093 ms
129,428 KB |
testcase_20 | AC | 3,097 ms
128,940 KB |
testcase_21 | AC | 1,315 ms
91,484 KB |
testcase_22 | AC | 343 ms
78,540 KB |
testcase_23 | AC | 344 ms
78,328 KB |
testcase_24 | AC | 2,773 ms
122,140 KB |
testcase_25 | AC | 1,526 ms
94,264 KB |
testcase_26 | AC | 1,512 ms
94,216 KB |
testcase_27 | AC | 1,361 ms
91,356 KB |
testcase_28 | AC | 139 ms
77,728 KB |
testcase_29 | AC | 186 ms
77,852 KB |
testcase_30 | AC | 2,619 ms
117,648 KB |
testcase_31 | AC | 1,915 ms
101,604 KB |
testcase_32 | AC | 289 ms
78,108 KB |
testcase_33 | AC | 1,115 ms
88,704 KB |
testcase_34 | AC | 123 ms
77,664 KB |
testcase_35 | AC | 149 ms
77,692 KB |
testcase_36 | AC | 1,352 ms
91,024 KB |
testcase_37 | AC | 835 ms
84,336 KB |
testcase_38 | AC | 907 ms
84,628 KB |
testcase_39 | AC | 763 ms
82,928 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(1000005) 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 # 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 n = II() xy = LLI(n) def ok(st): for i in range(n-2): x, y = st[i] s, t = st[i+1] if x*t-s*y == 0 and x*s >= 0 and y*t >= 0: return True return False ans = 0 for x, y in xy: st = [(s-x, t-y) for s, t in xy if s != x or t != y] st = arg_sort(st) ans += ok(st) print(ans)