結果

問題 No.202 1円玉投げ
ユーザー uwiuwi
提出日時 2015-05-15 12:45:24
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,499 bytes
コンパイル時間 3,389 ms
コンパイル使用メモリ 78,000 KB
実行使用メモリ 58,672 KB
最終ジャッジ日時 2023-08-23 22:51:04
合計ジャッジ時間 9,369 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 133 ms
58,320 KB
testcase_01 AC 174 ms
58,672 KB
testcase_02 AC 61 ms
55,172 KB
testcase_03 AC 59 ms
55,084 KB
testcase_04 AC 59 ms
55,172 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 129 ms
58,244 KB
testcase_17 AC 136 ms
58,240 KB
testcase_18 AC 133 ms
58,252 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 67 ms
55,168 KB
testcase_23 AC 67 ms
55,212 KB
testcase_24 AC 66 ms
55,240 KB
testcase_25 AC 77 ms
55,188 KB
testcase_26 AC 68 ms
55,232 KB
testcase_27 AC 63 ms
55,276 KB
testcase_28 AC 63 ms
55,432 KB
testcase_29 AC 66 ms
55,216 KB
testcase_30 AC 64 ms
55,200 KB
testcase_31 AC 63 ms
55,176 KB
testcase_32 AC 63 ms
53,532 KB
testcase_33 WA -
testcase_34 AC 66 ms
55,200 KB
testcase_35 AC 128 ms
58,380 KB
testcase_36 AC 131 ms
58,320 KB
testcase_37 WA -
testcase_38 AC 135 ms
58,388 KB
testcase_39 AC 61 ms
55,556 KB
testcase_40 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q476_4 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int scale = 15;
		int n = ni();
		int[][] box = new int[20000/15+1][20000/15+1];
		for(int i = 0;i < box.length;i++)Arrays.fill(box[i], -1);
		int[] dx = {-2, -1, -1, -1, 0, 0, 0, 0, 0, 1, 1, 1, 2};
		int[] dy = {0, -1, 0, 1, -2, -1, 0, 1, 2, -1, 0, 1, 0};
		
		int ret = 0;
		outer:
		for(int z = 0;z < n;z++){
			int x = ni(), y = ni();
			for(int k = 0;k < dx.length;k++){
				int nx = x/scale + dx[k], ny = y/scale + dy[k];
				if(nx >= 0 && nx < box.length && ny >= 0 && ny < box[0].length && box[nx][ny] != -1){
					int bx = box[nx][ny]>>>16, by = box[nx][ny]&65535;
					if((bx-x)*(bx-x)+(by-y)*(by-y) < 400)continue outer;
				}
			}
			box[x/scale][y/scale] = x<<16|y;
			ret++;
		}
		out.println(ret);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q476_4().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0