結果

問題 No.1041 直線大学
ユーザー k_6101
提出日時 2020-05-01 22:21:13
言語 Java
(openjdk 23)
結果
AC  
実行時間 81 ms / 2,000 ms
コード長 4,469 bytes
コンパイル時間 2,858 ms
コンパイル使用メモリ 79,776 KB
実行使用メモリ 37,968 KB
最終ジャッジ日時 2024-11-16 07:56:06
合計ジャッジ時間 5,754 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;
import static java.util.Comparator.*;
public class Main {
    public static void main(String[] args) {
        Main main = new Main();
        main.solve();
        main.out.close();
    }
    // ======================================================================
    public void solve() {
        int N = ni();
        int[] X = new int[N];
        int[] Y = new int[N];
        for (int i = 0; i < N; i++) {
            X[i] = ni();
            Y[i] = ni();
        }
        int ans = 0, cnt, a, b;
        for (int i = 0; i < N; i++) {
            for (int j = i+1; j < N; j++) {
                cnt = 2;
                a = X[j] - X[i];
                b = Y[j] - Y[i];
                for (int j2 = 0; j2 < N; j2++) {
                    if(j2 == i || j2 == j)  continue;
                    if((a * (Y[j2] - Y[i])) == (b * (X[j2] - X[i]))) {
//                      out.println("Y[" + j2 + "] = " + Y[j2]
//                              + "  a = " + a + "  X[" + j2 + "] = " + X[j2]
//                              + "  b = " + b + "  -->  " + (a * X[j2] + b));
                        cnt++;
                    }
                }
                ans = Math.max(ans, cnt);
//              out.println("cnt = " + cnt + "  ans = " + ans);
            }
        }
        out.println(ans);
    }
    // ------------------------------------------
    // ライブラリ
    // ------------------------------------------
    // Print
    private PrintWriter out = new PrintWriter(System.out);
    // Scanner
    private FastScanner scan = new FastScanner();
    int ni() {
        return scan.nextInt();
    }
    int[] ni(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = ni();
        }
        return a;
    }
    int[][] ni(int y, int x) {
        int[][] a = new int[y][x];
        for (int i = 0; i < y; i++) {
            for (int j = 0; j < x; j++) {
                a[i][j] = ni();
            }
        }
        return a;
    }
    long nl() {
        return scan.nextLong();
    }
    long[] nl(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = nl();
        }
        return a;
    }
    long[][] nl(int y, int x) {
        long[][] a = new long[y][x];
        for (int i = 0; i < y; i++) {
            for (int j = 0; j < x; j++) {
                a[i][j] = nl();
            }
        }
        return a;
    }
    String ns() {
        return scan.next();
    }
    String[] ns(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++) {
            a[i] = ns();
        }
        return a;
    }
    String[][] ns(int y, int x) {
        String[][] a = new String[y][x];
        for (int i = 0; i < y; i++) {
            for (int j = 0; j < x; j++) {
                a[i][j] = ns();
            }
        }
        return a;
    }
}
class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }
    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }
    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }
    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() {
        return Double.parseDouble(next());
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0