結果

問題 No.202 1円玉投げ
ユーザー ぴろずぴろず
提出日時 2015-05-03 23:34:20
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,437 bytes
コンパイル時間 2,920 ms
コンパイル使用メモリ 78,820 KB
実行使用メモリ 67,036 KB
最終ジャッジ日時 2024-12-22 06:10:34
合計ジャッジ時間 9,402 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 179 ms
56,076 KB
testcase_01 AC 234 ms
57,532 KB
testcase_02 AC 65 ms
48,716 KB
testcase_03 AC 68 ms
48,708 KB
testcase_04 AC 69 ms
48,716 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 174 ms
55,892 KB
testcase_17 AC 182 ms
55,600 KB
testcase_18 AC 180 ms
54,888 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 70 ms
48,432 KB
testcase_23 AC 73 ms
48,888 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 73 ms
48,792 KB
testcase_27 AC 68 ms
48,952 KB
testcase_28 WA -
testcase_29 WA -
testcase_30 AC 72 ms
49,132 KB
testcase_31 AC 70 ms
48,668 KB
testcase_32 AC 71 ms
48,716 KB
testcase_33 WA -
testcase_34 AC 69 ms
48,792 KB
testcase_35 AC 171 ms
56,316 KB
testcase_36 AC 188 ms
56,408 KB
testcase_37 WA -
testcase_38 AC 176 ms
55,952 KB
testcase_39 AC 66 ms
48,832 KB
testcase_40 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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-1;i2<=bx+1;i2++) {
				for(int j2=by-1;j2<=by+1;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) {}}
}
0