結果
問題 | No.202 1円玉投げ |
ユーザー | t8m8⛄️ |
提出日時 | 2015-05-04 00:56:07 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 1,193 ms / 5,000 ms |
コード長 | 4,341 bytes |
コンパイル時間 | 5,547 ms |
コンパイル使用メモリ | 78,568 KB |
実行使用メモリ | 465,868 KB |
最終ジャッジ日時 | 2024-12-22 07:59:24 |
合計ジャッジ時間 | 34,951 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 829 ms
465,828 KB |
testcase_01 | AC | 1,146 ms
465,848 KB |
testcase_02 | AC | 400 ms
463,560 KB |
testcase_03 | AC | 387 ms
463,376 KB |
testcase_04 | AC | 392 ms
463,688 KB |
testcase_05 | AC | 487 ms
465,528 KB |
testcase_06 | AC | 1,039 ms
465,736 KB |
testcase_07 | AC | 1,138 ms
465,844 KB |
testcase_08 | AC | 1,104 ms
465,740 KB |
testcase_09 | AC | 834 ms
465,816 KB |
testcase_10 | AC | 621 ms
465,684 KB |
testcase_11 | AC | 828 ms
464,280 KB |
testcase_12 | AC | 793 ms
465,688 KB |
testcase_13 | AC | 625 ms
465,824 KB |
testcase_14 | AC | 492 ms
465,624 KB |
testcase_15 | AC | 832 ms
465,560 KB |
testcase_16 | AC | 735 ms
465,564 KB |
testcase_17 | AC | 826 ms
465,868 KB |
testcase_18 | AC | 851 ms
465,660 KB |
testcase_19 | AC | 847 ms
465,644 KB |
testcase_20 | AC | 992 ms
465,648 KB |
testcase_21 | AC | 803 ms
464,020 KB |
testcase_22 | AC | 423 ms
464,968 KB |
testcase_23 | AC | 426 ms
464,700 KB |
testcase_24 | AC | 413 ms
464,716 KB |
testcase_25 | AC | 419 ms
465,000 KB |
testcase_26 | AC | 424 ms
463,560 KB |
testcase_27 | AC | 420 ms
464,448 KB |
testcase_28 | AC | 414 ms
462,660 KB |
testcase_29 | AC | 407 ms
464,680 KB |
testcase_30 | AC | 422 ms
464,540 KB |
testcase_31 | AC | 405 ms
464,896 KB |
testcase_32 | AC | 421 ms
464,908 KB |
testcase_33 | AC | 418 ms
464,896 KB |
testcase_34 | AC | 423 ms
464,876 KB |
testcase_35 | AC | 785 ms
465,744 KB |
testcase_36 | AC | 812 ms
465,496 KB |
testcase_37 | AC | 1,193 ms
463,788 KB |
testcase_38 | AC | 806 ms
464,476 KB |
testcase_39 | AC | 419 ms
464,528 KB |
testcase_40 | AC | 426 ms
464,832 KB |
ソースコード
import java.util.*; import java.io.*; import static java.util.Arrays.*; import static java.lang.Math.*; public class No0202 { static final Reader in = new Reader(); static final PrintWriter out = new PrintWriter(System.out,false); static void solve(){ int n = in.nextInt(); f = new boolean[20001][20001]; int cnt = 0; for (int i=0; i<n; i++) { int x = in.nextInt(); int y = in.nextInt(); if (search(x,y)) { f[x][y] = true; cnt++; } } out.println(cnt); } static boolean[][] f; static boolean search(int x, int y) { for (int i=-20; i<=20; i++) { for (int j=-20; j<20; j++) { if (x + i < 0 || 20001 <= x + i || y + j < 0 || 20001 <= y + j) continue; if (f[x+i][y+j] && i*i+j*j < 400) return false; } } return true; } public static void main(String[] args) throws Exception { long start = System.currentTimeMillis(); solve(); out.flush(); long end = System.currentTimeMillis(); //trace(end-start + "ms"); in.close(); out.close(); } static void trace(Object... o) { System.out.println(deepToString(o));} } class Reader { private final InputStream in; private final byte[] buf = new byte[1024]; private int ptr = 0; private int buflen = 0; public Reader() { this(System.in);} public Reader(InputStream source) { this.in = source;} private boolean hasNextByte() { if (ptr < buflen) return true; ptr = 0; try{ buflen = in.read(buf); }catch (IOException e) {e.printStackTrace();} if (buflen <= 0) return false; return true; } private int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;} private boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;} public boolean hasNext() {skip(); 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 long nextLong() { if (!hasNext()) throw new NoSuchElementException(); boolean minus = false; long num = readByte(); if(num == '-'){ num = 0; minus = true; }else if (num < '0' || '9' < num){ throw new NumberFormatException(); }else{ num -= '0'; } while(true){ int b = readByte(); if('0' <= b && b <= '9') num = num * 10 + (b - '0'); else if(b == -1 || !isPrintableChar(b)) return minus ? -num : num; else throw new NoSuchElementException(); } } public int nextInt() { long num = nextLong(); if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num) throw new NumberFormatException(); return (int)num; } public double nextDouble() { return Double.parseDouble(next()); } public char nextChar() { if (!hasNext()) throw new NoSuchElementException(); return (char)readByte(); } public String nextLine() { while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++; if (!hasNextByte()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (b != '\n' && b != '\r') { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i=0; i<n; i++) res[i] = nextInt(); return res; } public char[] nextCharArray(int n) { char[] res = new char[n]; for (int i=0; i<n; i++) res[i] = nextChar(); return res; } public void close() {try{ in.close();}catch(IOException e){ e.printStackTrace();}}; }