結果
問題 | No.202 1円玉投げ |
ユーザー | uwi |
提出日時 | 2015-05-15 12:56:10 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 157 ms / 5,000 ms |
コード長 | 3,625 bytes |
コンパイル時間 | 3,528 ms |
コンパイル使用メモリ | 77,312 KB |
実行使用メモリ | 56,472 KB |
最終ジャッジ日時 | 2023-08-23 22:51:45 |
合計ジャッジ時間 | 9,335 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 127 ms
55,628 KB |
testcase_01 | AC | 157 ms
56,176 KB |
testcase_02 | AC | 60 ms
52,704 KB |
testcase_03 | AC | 59 ms
52,536 KB |
testcase_04 | AC | 59 ms
52,828 KB |
testcase_05 | AC | 85 ms
54,376 KB |
testcase_06 | AC | 129 ms
55,676 KB |
testcase_07 | AC | 134 ms
56,200 KB |
testcase_08 | AC | 125 ms
55,388 KB |
testcase_09 | AC | 116 ms
55,344 KB |
testcase_10 | AC | 106 ms
55,292 KB |
testcase_11 | AC | 119 ms
55,468 KB |
testcase_12 | AC | 120 ms
55,796 KB |
testcase_13 | AC | 109 ms
55,336 KB |
testcase_14 | AC | 87 ms
54,156 KB |
testcase_15 | AC | 121 ms
55,824 KB |
testcase_16 | AC | 124 ms
55,588 KB |
testcase_17 | AC | 124 ms
55,588 KB |
testcase_18 | AC | 121 ms
55,668 KB |
testcase_19 | AC | 113 ms
55,656 KB |
testcase_20 | AC | 121 ms
55,512 KB |
testcase_21 | AC | 115 ms
55,644 KB |
testcase_22 | AC | 67 ms
53,092 KB |
testcase_23 | AC | 63 ms
52,680 KB |
testcase_24 | AC | 61 ms
52,524 KB |
testcase_25 | AC | 61 ms
52,960 KB |
testcase_26 | AC | 68 ms
52,760 KB |
testcase_27 | AC | 74 ms
52,844 KB |
testcase_28 | AC | 60 ms
52,604 KB |
testcase_29 | AC | 62 ms
52,616 KB |
testcase_30 | AC | 66 ms
53,000 KB |
testcase_31 | AC | 63 ms
52,848 KB |
testcase_32 | AC | 63 ms
52,604 KB |
testcase_33 | AC | 72 ms
52,644 KB |
testcase_34 | AC | 73 ms
52,800 KB |
testcase_35 | AC | 125 ms
55,808 KB |
testcase_36 | AC | 138 ms
55,744 KB |
testcase_37 | AC | 137 ms
56,472 KB |
testcase_38 | AC | 132 ms
55,396 KB |
testcase_39 | AC | 61 ms
52,948 KB |
testcase_40 | AC | 60 ms
52,608 KB |
ソースコード
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)); } }