結果

問題 No.2355 Unhappy Back Dance
ユーザー tenten
提出日時 2023-07-05 12:30:04
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,747 ms / 6,000 ms
コード長 3,103 bytes
コンパイル時間 3,060 ms
コンパイル使用メモリ 85,380 KB
実行使用メモリ 46,048 KB
最終ジャッジ日時 2024-07-19 06:43:48
合計ジャッジ時間 27,163 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 37
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        Point[] points = new Point[n];
        for (int i = 0; i < n; i++) {
            points[i] = new Point(sc.nextLong(), sc.nextLong());
        }
        int ans = 0;
        for (int i = 0; i < n; i++) {
            HashSet<Vect> vects = new HashSet<>();
            for (int j = 0; j < n; j++) {
                if (i == j) {
                    continue;
                }
                Vect x = points[i].getVect(points[j]);
                if (vects.contains(x)) {
                    ans++;
                    break;
                }
                vects.add(x);
            }
        }
        System.out.println(ans);
    }
    
    static class Point {
        long x;
        long y;
        public Point(long x, long y) {
            this.x = x;
            this.y = y;
        }
        
        public Vect getVect(Point p) {
            return new Vect(x - p.x, y - p.y);
        }
    }
    
    static class Vect {
        long x;
        long y;
        
        public Vect(long x, long y) {
            this.x = x;
            this.y = y;
            init();
        }
        
        private void init() {
            long gcd = getGCD(Math.abs(x), Math.abs(y));
            x /= gcd;
            y /= gcd;
        }
        
        private long getGCD(long x, long y) {
            if (y == 0) {
                return x;
            } else {
                return getGCD(y, x % y);
            }
        }
        
        public int hashCode() {
            return (int)(x + y);
        }
        
        public boolean equals(Object o) {
            Vect v = (Vect)o;
            return x == v.x && y == v.y;
        }
    }
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0