結果
問題 | No.2355 Unhappy Back Dance |
ユーザー | tenten |
提出日時 | 2023-07-05 12:29:22 |
言語 | Java21 (openjdk 21) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,101 bytes |
コンパイル時間 | 2,423 ms |
コンパイル使用メモリ | 91,828 KB |
実行使用メモリ | 46,060 KB |
最終ジャッジ日時 | 2024-07-19 06:42:46 |
合計ジャッジ時間 | 6,708 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
37,144 KB |
testcase_01 | AC | 48 ms
37,012 KB |
testcase_02 | AC | 49 ms
37,284 KB |
testcase_03 | AC | 49 ms
37,308 KB |
testcase_04 | AC | 50 ms
37,196 KB |
testcase_05 | RE | - |
testcase_06 | AC | 91 ms
38,568 KB |
testcase_07 | AC | 86 ms
38,552 KB |
testcase_08 | AC | 83 ms
39,132 KB |
testcase_09 | RE | - |
testcase_10 | AC | 343 ms
45,344 KB |
testcase_11 | AC | 262 ms
44,912 KB |
testcase_12 | AC | 83 ms
38,840 KB |
testcase_13 | AC | 82 ms
39,204 KB |
testcase_14 | AC | 340 ms
46,060 KB |
testcase_15 | AC | 47 ms
36,644 KB |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | RE | - |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | RE | - |
testcase_36 | RE | - |
testcase_37 | RE | - |
testcase_38 | RE | - |
testcase_39 | RE | - |
ソースコード
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.nextInt(), sc.nextInt()); } 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(); } }