結果
問題 | No.1041 直線大学 |
ユーザー | McGregorsh |
提出日時 | 2023-04-26 22:44:08 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 168 ms / 2,000 ms |
コード長 | 1,872 bytes |
コンパイル時間 | 166 ms |
コンパイル使用メモリ | 82,212 KB |
実行使用メモリ | 90,240 KB |
最終ジャッジ日時 | 2024-04-28 00:20:05 |
合計ジャッジ時間 | 7,738 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 143 ms
89,472 KB |
testcase_01 | AC | 143 ms
89,780 KB |
testcase_02 | AC | 151 ms
89,040 KB |
testcase_03 | AC | 143 ms
89,304 KB |
testcase_04 | AC | 142 ms
89,728 KB |
testcase_05 | AC | 142 ms
89,224 KB |
testcase_06 | AC | 142 ms
89,328 KB |
testcase_07 | AC | 149 ms
90,116 KB |
testcase_08 | AC | 158 ms
90,240 KB |
testcase_09 | AC | 150 ms
89,924 KB |
testcase_10 | AC | 155 ms
89,980 KB |
testcase_11 | AC | 158 ms
90,008 KB |
testcase_12 | AC | 154 ms
89,856 KB |
testcase_13 | AC | 149 ms
89,976 KB |
testcase_14 | AC | 151 ms
89,984 KB |
testcase_15 | AC | 149 ms
89,844 KB |
testcase_16 | AC | 156 ms
90,236 KB |
testcase_17 | AC | 149 ms
89,820 KB |
testcase_18 | AC | 160 ms
90,112 KB |
testcase_19 | AC | 150 ms
90,192 KB |
testcase_20 | AC | 156 ms
89,472 KB |
testcase_21 | AC | 151 ms
90,008 KB |
testcase_22 | AC | 155 ms
89,400 KB |
testcase_23 | AC | 155 ms
90,116 KB |
testcase_24 | AC | 166 ms
89,964 KB |
testcase_25 | AC | 150 ms
89,924 KB |
testcase_26 | AC | 162 ms
89,984 KB |
testcase_27 | AC | 157 ms
90,012 KB |
testcase_28 | AC | 156 ms
89,292 KB |
testcase_29 | AC | 146 ms
89,292 KB |
testcase_30 | AC | 145 ms
89,008 KB |
testcase_31 | AC | 143 ms
89,364 KB |
testcase_32 | AC | 142 ms
89,076 KB |
testcase_33 | AC | 152 ms
89,392 KB |
testcase_34 | AC | 145 ms
89,344 KB |
testcase_35 | AC | 145 ms
89,588 KB |
testcase_36 | AC | 160 ms
89,404 KB |
testcase_37 | AC | 145 ms
89,088 KB |
testcase_38 | AC | 168 ms
90,240 KB |
testcase_39 | AC | 151 ms
89,924 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def ret(x1, y1, x2, y2, x3, y3): dx1 = x2 - x1 dx2 = x3 - x1 dy1 = y2 - y1 dy2 = y3 - y1 if dx1 * dy2 == dx2 * dy1: return True else: return False def main(): N = int(input()) XY = [i_list() for i in range(N)] ans = 0 for i in range(N-1): a, b = XY[i] for j in range(i+1, N): c, d = XY[j] cou = 0 for k in range(N): e, f = XY[k] if ret(a, b, c, d, e, f): cou += 1 ans = max(ans, cou) print(ans) if __name__ == '__main__': main()