#24172 (Java21) No.202 1円玉投げ

• 問題: No.202 1円玉投げ
• ユーザー: ぴろず
• 提出日時: 2015-05-03 23:37:11
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 233 ms / 5,000 ms
• コード長: 4,437 bytes
• コンパイル時間: 2,699 ms
• コンパイル使用メモリ: 75,564 KB
• 実行使用メモリ: 68,100 KB
• 最終ジャッジ日時: 2023-08-23 21:35:28
• 合計ジャッジ時間: 9,182 ms
• ジャッジサーバーID （参考情報）: judge13 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	188 ms; 67,584 KB
testcase_01	AC	206 ms; 67,840 KB
testcase_02	AC	50 ms; 58,352 KB
testcase_03	AC	49 ms; 58,232 KB
testcase_04	AC	50 ms; 58,288 KB
testcase_05	AC	83 ms; 61,036 KB
testcase_06	AC	187 ms; 67,508 KB
testcase_07	AC	233 ms; 67,744 KB
testcase_08	AC	189 ms; 67,732 KB
testcase_09	AC	155 ms; 63,916 KB
testcase_10	AC	110 ms; 62,224 KB
testcase_11	AC	143 ms; 63,276 KB
testcase_12	AC	148 ms; 64,160 KB
testcase_13	AC	113 ms; 62,556 KB
testcase_14	AC	80 ms; 60,760 KB
testcase_15	AC	154 ms; 63,692 KB
testcase_16	AC	189 ms; 67,896 KB
testcase_17	AC	190 ms; 67,692 KB
testcase_18	AC	190 ms; 67,692 KB
testcase_19	AC	152 ms; 62,936 KB
testcase_20	AC	192 ms; 68,100 KB
testcase_21	AC	148 ms; 63,764 KB
testcase_22	AC	56 ms; 59,036 KB
testcase_23	AC	55 ms; 58,388 KB
testcase_24	AC	54 ms; 58,424 KB
testcase_25	AC	55 ms; 58,644 KB
testcase_26	AC	55 ms; 58,668 KB
testcase_27	AC	55 ms; 56,636 KB
testcase_28	AC	55 ms; 58,424 KB
testcase_29	AC	56 ms; 58,336 KB
testcase_30	AC	57 ms; 58,400 KB
testcase_31	AC	55 ms; 58,524 KB
testcase_32	AC	55 ms; 58,664 KB
testcase_33	AC	56 ms; 59,032 KB
testcase_34	AC	56 ms; 58,440 KB
testcase_35	AC	189 ms; 67,932 KB
testcase_36	AC	193 ms; 67,980 KB
testcase_37	AC	200 ms; 67,180 KB
testcase_38	AC	194 ms; 67,956 KB
testcase_39	AC	51 ms; 58,260 KB
testcase_40	AC	51 ms; 58,208 KB

ソースコード

package no201;

import java.awt.Point;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	static IO io = new IO();

	static final int SIZE = 13;
	static final int MAX = 20100;
	static final int M = MAX / SIZE + 1;
	public static void main(String[] args) {
		int n = io.nextInt();
		Point[][] b = new Point[M][M];
		int count = 0;
		LOOP: for(int i=0;i<n;i++) {
			Point q = new Point(io.nextInt(),io.nextInt());
			int bx = q.x / SIZE;
			int by = q.y / SIZE;
//			System.out.println(bx + "," + by);
			for(int i2=bx-2;i2<=bx+2;i2++) {
				for(int j2=by-2;j2<=by+2;j2++) {
					if (i2 < 0 || i2 >= M || j2 < 0 || j2 >= M) {
						continue;
					}
					if (b[i2][j2] != null && b[i2][j2].distanceSq(q) < 400) {
						continue LOOP;
					}
				}
			}
			b[bx][by] = q;
			count++;
		}
		System.out.println(count);
	}

}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	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;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(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 char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(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 char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}