結果
問題 | No.1041 直線大学 |
ユーザー | mkawa2 |
提出日時 | 2022-07-17 14:51:12 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 165 ms / 2,000 ms |
コード長 | 1,442 bytes |
コンパイル時間 | 189 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 89,472 KB |
最終ジャッジ日時 | 2024-11-16 08:14:26 |
合計ジャッジ時間 | 7,231 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 152 ms
88,320 KB |
testcase_01 | AC | 136 ms
88,320 KB |
testcase_02 | AC | 137 ms
88,576 KB |
testcase_03 | AC | 140 ms
88,192 KB |
testcase_04 | AC | 138 ms
88,320 KB |
testcase_05 | AC | 145 ms
88,576 KB |
testcase_06 | AC | 140 ms
88,320 KB |
testcase_07 | AC | 152 ms
88,960 KB |
testcase_08 | AC | 154 ms
89,088 KB |
testcase_09 | AC | 151 ms
89,344 KB |
testcase_10 | AC | 158 ms
89,216 KB |
testcase_11 | AC | 160 ms
89,088 KB |
testcase_12 | AC | 152 ms
89,472 KB |
testcase_13 | AC | 156 ms
88,960 KB |
testcase_14 | AC | 164 ms
89,088 KB |
testcase_15 | AC | 154 ms
89,088 KB |
testcase_16 | AC | 162 ms
89,344 KB |
testcase_17 | AC | 146 ms
88,832 KB |
testcase_18 | AC | 158 ms
89,344 KB |
testcase_19 | AC | 164 ms
89,344 KB |
testcase_20 | AC | 142 ms
88,320 KB |
testcase_21 | AC | 157 ms
89,216 KB |
testcase_22 | AC | 139 ms
88,320 KB |
testcase_23 | AC | 165 ms
89,216 KB |
testcase_24 | AC | 160 ms
89,216 KB |
testcase_25 | AC | 159 ms
89,344 KB |
testcase_26 | AC | 151 ms
89,344 KB |
testcase_27 | AC | 154 ms
89,088 KB |
testcase_28 | AC | 143 ms
88,320 KB |
testcase_29 | AC | 141 ms
88,320 KB |
testcase_30 | AC | 143 ms
88,448 KB |
testcase_31 | AC | 144 ms
88,448 KB |
testcase_32 | AC | 137 ms
88,704 KB |
testcase_33 | AC | 139 ms
88,192 KB |
testcase_34 | AC | 139 ms
88,576 KB |
testcase_35 | AC | 137 ms
88,064 KB |
testcase_36 | AC | 139 ms
88,576 KB |
testcase_37 | AC | 142 ms
88,064 KB |
testcase_38 | AC | 165 ms
89,216 KB |
testcase_39 | AC | 151 ms
89,216 KB |
ソースコード
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 from math import gcd from fractions import Fraction class Line: def __init__(self, x1, y1, x2, y2): a, b, c = y2-y1, x1-x2, x2*y1-x1*y2 if a < 0: a, b, c = -a, -b, -c g = gcd(a, gcd(b, c)) self.a, self.b, self.c = a//g, b//g, c//g def online(self, x, y): return self.a*x+self.b*y+self.c == 0 def cross(self, other): return Fraction(self.b*other.c-self.c*other.b, self.a*other.b-self.b*other.a) n = II() xy = LLI(n) ans = 2 for i in range(n): x1, y1 = xy[i] for j in range(i): x2, y2 = xy[j] l = Line(x1, y1, x2, y2) now = 0 for x, y in xy: now += l.online(x, y) ans = max(ans, now) print(ans)