結果
問題 | No.1041 直線大学 |
ユーザー |
![]() |
提出日時 | 2020-05-01 22:36:57 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 93 ms / 2,000 ms |
コード長 | 2,952 bytes |
コンパイル時間 | 3,361 ms |
コンパイル使用メモリ | 89,764 KB |
実行使用メモリ | 39,304 KB |
最終ジャッジ日時 | 2024-11-16 07:58:01 |
合計ジャッジ時間 | 7,492 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
38,192 KB |
testcase_01 | AC | 75 ms
37,940 KB |
testcase_02 | AC | 74 ms
38,064 KB |
testcase_03 | AC | 73 ms
37,964 KB |
testcase_04 | AC | 73 ms
38,224 KB |
testcase_05 | AC | 74 ms
38,260 KB |
testcase_06 | AC | 72 ms
38,216 KB |
testcase_07 | AC | 74 ms
37,976 KB |
testcase_08 | AC | 75 ms
38,204 KB |
testcase_09 | AC | 75 ms
37,972 KB |
testcase_10 | AC | 86 ms
38,692 KB |
testcase_11 | AC | 86 ms
38,728 KB |
testcase_12 | AC | 93 ms
39,304 KB |
testcase_13 | AC | 76 ms
37,976 KB |
testcase_14 | AC | 81 ms
37,924 KB |
testcase_15 | AC | 75 ms
37,824 KB |
testcase_16 | AC | 79 ms
38,064 KB |
testcase_17 | AC | 75 ms
37,972 KB |
testcase_18 | AC | 76 ms
38,456 KB |
testcase_19 | AC | 80 ms
37,936 KB |
testcase_20 | AC | 72 ms
37,900 KB |
testcase_21 | AC | 76 ms
38,064 KB |
testcase_22 | AC | 73 ms
38,132 KB |
testcase_23 | AC | 90 ms
38,940 KB |
testcase_24 | AC | 82 ms
38,180 KB |
testcase_25 | AC | 77 ms
38,176 KB |
testcase_26 | AC | 74 ms
38,144 KB |
testcase_27 | AC | 76 ms
37,940 KB |
testcase_28 | AC | 73 ms
38,016 KB |
testcase_29 | AC | 74 ms
38,064 KB |
testcase_30 | AC | 75 ms
38,312 KB |
testcase_31 | AC | 75 ms
38,364 KB |
testcase_32 | AC | 73 ms
38,052 KB |
testcase_33 | AC | 74 ms
37,960 KB |
testcase_34 | AC | 74 ms
37,960 KB |
testcase_35 | AC | 75 ms
38,204 KB |
testcase_36 | AC | 75 ms
38,132 KB |
testcase_37 | AC | 74 ms
38,064 KB |
testcase_38 | AC | 89 ms
38,748 KB |
testcase_39 | AC | 76 ms
37,936 KB |
ソースコード
public class Main { private static void solve() { int n = ni(); int ret = 0; int[][] p = ntable(n, 2); for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { int now = 2; int dx = p[i][0] - p[j][0]; int dy = p[i][1] - p[j][1]; int sx = p[i][0]; int sy = p[i][1]; for (int k = j + 1; k < n; k++) { int x = p[k][0]; int y = p[k][1]; if ((x - sx) * dy - (y - sy) * dx == 0) { now++; } } ret = Math.max(ret, now); } } System.out.println(ret); } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }