結果

問題 No.202 1円玉投げ
ユーザー fujisufujisu
提出日時 2015-05-09 06:42:53
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,473 ms / 5,000 ms
コード長 3,346 bytes
コンパイル時間 2,913 ms
コンパイル使用メモリ 80,180 KB
実行使用メモリ 86,820 KB
最終ジャッジ日時 2024-12-22 08:51:33
合計ジャッジ時間 41,279 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,234 ms
86,820 KB
testcase_01 AC 2,144 ms
84,136 KB
testcase_02 AC 70 ms
52,092 KB
testcase_03 AC 69 ms
52,280 KB
testcase_04 AC 73 ms
52,288 KB
testcase_05 AC 229 ms
61,352 KB
testcase_06 AC 1,525 ms
77,788 KB
testcase_07 AC 1,596 ms
83,248 KB
testcase_08 AC 1,613 ms
80,704 KB
testcase_09 AC 1,266 ms
75,508 KB
testcase_10 AC 601 ms
73,468 KB
testcase_11 AC 1,056 ms
75,408 KB
testcase_12 AC 1,170 ms
75,556 KB
testcase_13 AC 680 ms
74,476 KB
testcase_14 AC 243 ms
62,240 KB
testcase_15 AC 1,198 ms
75,264 KB
testcase_16 AC 2,117 ms
86,564 KB
testcase_17 AC 2,473 ms
83,840 KB
testcase_18 AC 2,331 ms
86,556 KB
testcase_19 AC 1,321 ms
75,676 KB
testcase_20 AC 1,591 ms
77,684 KB
testcase_21 AC 1,203 ms
75,440 KB
testcase_22 AC 181 ms
58,348 KB
testcase_23 AC 150 ms
56,964 KB
testcase_24 AC 135 ms
56,448 KB
testcase_25 AC 128 ms
56,240 KB
testcase_26 AC 190 ms
58,744 KB
testcase_27 AC 149 ms
56,644 KB
testcase_28 AC 108 ms
54,008 KB
testcase_29 AC 118 ms
56,520 KB
testcase_30 AC 148 ms
56,088 KB
testcase_31 AC 113 ms
54,060 KB
testcase_32 AC 153 ms
56,760 KB
testcase_33 AC 131 ms
56,544 KB
testcase_34 AC 146 ms
56,928 KB
testcase_35 AC 1,666 ms
75,948 KB
testcase_36 AC 832 ms
82,352 KB
testcase_37 AC 1,861 ms
83,976 KB
testcase_38 AC 2,252 ms
81,860 KB
testcase_39 AC 113 ms
53,412 KB
testcase_40 AC 99 ms
53,524 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.util.InputMismatchException;
import java.util.TreeSet;

public class Main {
	class Point implements Comparable<Point> {
		int x, y;

		Point(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int compareTo(Point o) {
			return this.x != o.x ? this.x - o.x : this.y - o.y;
		}
	}

	boolean isIntersect(Point a, Point b) {
		return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y) < 400;
	}

	void run() {
		MyScanner sc = new MyScanner();

		TreeSet<Point>[] X = new TreeSet[20001];
		TreeSet<Point>[] Y = new TreeSet[20001];
		for (int i = 0; i < 20001; i++) {
			X[i] = new TreeSet<Point>();
			Y[i] = new TreeSet<Point>();
		}

		int n = sc.nextInt();

		int ans = 0;
		L: for (int i = 0; i < n; i++) {
			int x = sc.nextInt();
			int y = sc.nextInt();
			Point p = new Point(x, y);

			for (int j = Math.max(0, y - 19); j <= Math.min(20000, y + 19); j++) {
				for (Point q : Y[j]) {
					if (isIntersect(p, q)) {
						continue L;
					}
					if (p.x < q.x && !isIntersect(p, q)) {
						break;
					}
				}
			}
			for (int j = Math.max(0, x - 19); j <= Math.min(20000, x + 19); j++) {
				for (Point q : X[j]) {
					if (isIntersect(p, q)) {
						continue L;
					}
					if (p.y < q.y && !isIntersect(p, q)) {
						break;
					}
				}
			}
			X[x].add(p);
			Y[y].add(p);
			ans++;
		}
		System.out.println(ans);
	}

	public static void main(String[] args) {
		new Main().run();
	}

	public void mapDebug(int[][] a) {
		System.out.println("--------map display---------");
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.printf("%3d ", a[i][j]);
			}
			System.out.println();
		}
		System.out.println("----------------------------" + '\n');
	}

	class MyScanner {
		int read() {
			try {
				return System.in.read();
			} catch (IOException e) {
				throw new InputMismatchException();
			}
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();
			return array;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		long[] nextLongArray(int n) {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();
			return array;
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		double[] nextDoubleArray(int n) {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();
			return array;
		}

		String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		String[] nextStringArray(int n) {
			String[] array = new String[n];
			for (int i = 0; i < n; i++)
				array[i] = next();

			return array;
		}

		String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}
}
0