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

提出ソース

結果

問題	No.202 1円玉投げ
ユーザー	uwi
提出日時	2015-05-15 12:56:10
言語	Java21 (openjdk 21)
結果	AC
実行時間	169 ms / 5,000 ms
コード長	3,625 bytes
コンパイル時間	4,056 ms
コンパイル使用メモリ	81,568 KB
実行使用メモリ	55,884 KB
最終ジャッジ日時	2024-12-22 09:10:17
合計ジャッジ時間	10,884 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	151 ms 55,884 KB
testcase_01	AC	160 ms 55,512 KB
testcase_02	AC	84 ms 52,836 KB
testcase_03	AC	85 ms 52,564 KB
testcase_04	AC	84 ms 52,888 KB
testcase_05	AC	102 ms 53,688 KB
testcase_06	AC	155 ms 55,472 KB
testcase_07	AC	148 ms 55,536 KB
testcase_08	AC	157 ms 55,700 KB
testcase_09	AC	161 ms 55,696 KB
testcase_10	AC	123 ms 54,248 KB
testcase_11	AC	153 ms 55,460 KB
testcase_12	AC	150 ms 55,536 KB
testcase_13	AC	132 ms 54,380 KB
testcase_14	AC	107 ms 53,856 KB
testcase_15	AC	139 ms 55,584 KB
testcase_16	AC	158 ms 55,468 KB
testcase_17	AC	158 ms 55,592 KB
testcase_18	AC	153 ms 55,824 KB
testcase_19	AC	160 ms 55,372 KB
testcase_20	AC	154 ms 55,684 KB
testcase_21	AC	142 ms 55,648 KB
testcase_22	AC	89 ms 53,028 KB
testcase_23	AC	90 ms 52,788 KB
testcase_24	AC	87 ms 53,036 KB
testcase_25	AC	88 ms 53,140 KB
testcase_26	AC	88 ms 52,992 KB
testcase_27	AC	87 ms 53,040 KB
testcase_28	AC	88 ms 52,980 KB
testcase_29	AC	87 ms 52,992 KB
testcase_30	AC	82 ms 53,396 KB
testcase_31	AC	88 ms 52,968 KB
testcase_32	AC	85 ms 53,148 KB
testcase_33	AC	90 ms 52,988 KB
testcase_34	AC	90 ms 53,100 KB
testcase_35	AC	154 ms 55,308 KB
testcase_36	AC	163 ms 55,628 KB
testcase_37	AC	169 ms 55,800 KB
testcase_38	AC	154 ms 55,572 KB
testcase_39	AC	86 ms 53,064 KB
testcase_40	AC	89 ms 52,988 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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_4F {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		final int scale = 15;
		int n = ni();
		byte[][] box = new byte[20000/scale+1][20000/scale+1];
		for(int i = 0;i < box.length;i++)Arrays.fill(box[i], (byte)(-1));
		int[] dx = {-2, -2, -2, -1, -1, -1, -1, -1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2};
		int[] dy = {-1, 0, 1, -2, -1, 0, 1, 2, -2, -1, 0, 1, 2, -2, -1, 0, 1, 2, -1, 0, 1};
		
		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] != (byte)-1){
					int bx = (box[nx][ny]>>>4&15)+nx*scale, by = (box[nx][ny]&15)+ny*scale;
					if((bx-x)*(bx-x)+(by-y)*(by-y) < 400)continue outer;
				}
			}
			box[x/scale][y/scale] = (byte)(x%scale<<4|y%scale);
			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_4F().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)); }
}

yukicoder

結果

テストケース

ソースコード