結果
問題 | No.1041 直線大学 |
ユーザー | McGregorsh |
提出日時 | 2023-04-26 22:44:08 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 156 ms / 2,000 ms |
コード長 | 1,872 bytes |
コンパイル時間 | 149 ms |
コンパイル使用メモリ | 82,688 KB |
実行使用メモリ | 90,368 KB |
最終ジャッジ日時 | 2024-11-16 08:16:35 |
合計ジャッジ時間 | 6,971 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 139 ms
89,600 KB |
testcase_01 | AC | 133 ms
89,472 KB |
testcase_02 | AC | 134 ms
89,472 KB |
testcase_03 | AC | 133 ms
89,600 KB |
testcase_04 | AC | 142 ms
89,216 KB |
testcase_05 | AC | 142 ms
89,472 KB |
testcase_06 | AC | 143 ms
89,600 KB |
testcase_07 | AC | 155 ms
90,368 KB |
testcase_08 | AC | 144 ms
90,240 KB |
testcase_09 | AC | 143 ms
90,240 KB |
testcase_10 | AC | 151 ms
90,112 KB |
testcase_11 | AC | 156 ms
89,984 KB |
testcase_12 | AC | 153 ms
89,856 KB |
testcase_13 | AC | 144 ms
89,856 KB |
testcase_14 | AC | 146 ms
90,112 KB |
testcase_15 | AC | 143 ms
89,728 KB |
testcase_16 | AC | 153 ms
89,856 KB |
testcase_17 | AC | 148 ms
89,344 KB |
testcase_18 | AC | 147 ms
90,368 KB |
testcase_19 | AC | 144 ms
90,240 KB |
testcase_20 | AC | 134 ms
89,216 KB |
testcase_21 | AC | 142 ms
89,600 KB |
testcase_22 | AC | 136 ms
89,216 KB |
testcase_23 | AC | 144 ms
89,728 KB |
testcase_24 | AC | 156 ms
90,112 KB |
testcase_25 | AC | 142 ms
89,856 KB |
testcase_26 | AC | 140 ms
90,112 KB |
testcase_27 | AC | 143 ms
90,368 KB |
testcase_28 | AC | 137 ms
89,344 KB |
testcase_29 | AC | 140 ms
89,216 KB |
testcase_30 | AC | 135 ms
89,344 KB |
testcase_31 | AC | 138 ms
89,472 KB |
testcase_32 | AC | 139 ms
89,472 KB |
testcase_33 | AC | 135 ms
89,600 KB |
testcase_34 | AC | 137 ms
89,600 KB |
testcase_35 | AC | 137 ms
88,960 KB |
testcase_36 | AC | 137 ms
89,600 KB |
testcase_37 | AC | 139 ms
88,960 KB |
testcase_38 | AC | 151 ms
89,984 KB |
testcase_39 | AC | 142 ms
89,984 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()