結果

問題 No.202 1円玉投げ
ユーザー uwiuwi
提出日時 2015-05-15 04:40:24
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,552 bytes
コンパイル時間 3,656 ms
コンパイル使用メモリ 79,260 KB
実行使用メモリ 116,276 KB
最終ジャッジ日時 2023-08-23 22:49:56
合計ジャッジ時間 12,408 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 191 ms
114,972 KB
testcase_01 AC 272 ms
114,736 KB
testcase_02 AC 88 ms
111,196 KB
testcase_03 AC 89 ms
111,248 KB
testcase_04 AC 89 ms
109,672 KB
testcase_05 AC 166 ms
113,572 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 221 ms
114,980 KB
testcase_10 AC 196 ms
113,156 KB
testcase_11 AC 231 ms
115,320 KB
testcase_12 WA -
testcase_13 WA -
testcase_14 AC 146 ms
115,304 KB
testcase_15 WA -
testcase_16 AC 176 ms
113,564 KB
testcase_17 AC 194 ms
113,632 KB
testcase_18 AC 189 ms
113,996 KB
testcase_19 WA -
testcase_20 AC 302 ms
113,264 KB
testcase_21 AC 248 ms
113,096 KB
testcase_22 AC 104 ms
110,368 KB
testcase_23 AC 103 ms
112,368 KB
testcase_24 AC 96 ms
112,256 KB
testcase_25 AC 98 ms
110,344 KB
testcase_26 AC 99 ms
110,704 KB
testcase_27 AC 100 ms
110,348 KB
testcase_28 AC 93 ms
110,188 KB
testcase_29 AC 93 ms
108,700 KB
testcase_30 AC 105 ms
110,712 KB
testcase_31 AC 96 ms
112,572 KB
testcase_32 AC 101 ms
112,792 KB
testcase_33 AC 99 ms
110,740 KB
testcase_34 AC 98 ms
110,308 KB
testcase_35 AC 179 ms
114,988 KB
testcase_36 AC 207 ms
112,864 KB
testcase_37 WA -
testcase_38 AC 182 ms
113,588 KB
testcase_39 AC 96 ms
110,632 KB
testcase_40 AC 95 ms
109,856 KB
権限があれば一括ダウンロードができます

ソースコード

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_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void paint(long[] a, int inf, int sup)
	{
		if(inf>>>6 == sup>>>6){
			a[inf>>>6] |= (1L<<sup+1)-(1L<<inf);
		}else{
			a[inf>>>6] |= -(1L<<inf);
			a[sup>>>6] |= (1L<<sup+1)-1L;
			for(int i = (inf>>>6)+1;i < sup>>>6;i++)a[i] = -1L;
		}
	}
	
	void solve()
	{
		int n = ni();
		long[][] map = new long[20001][22000>>>6];
		int ret = 0;
		int[] vj = new int[20];
		for(int i = 0;i < 20;i++){
			int j = (int)Math.sqrt(400-i*i);
			if(i*i+j*j == 400)j--;
			vj[i] = j;
		}
		for(int z = 0;z < n;z++){
			int x = ni(), y = ni();
			if(map[x][y>>>6]<<~y<0)continue;
			for(int i = -19;i <= 19;i++){
				if(x+i < 0 || x+i > 20000)continue;
				int inf = Math.max(0, y-vj[Math.abs(i)]);
				int sup = y+vj[Math.abs(i)];
				paint(map[x+i], inf, sup);
			}
			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_2().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