結果

問題 No.202 1円玉投げ
ユーザー t8m8⛄️t8m8⛄️
提出日時 2015-05-04 00:56:07
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,342 ms / 5,000 ms
コード長 4,341 bytes
コンパイル時間 3,699 ms
コンパイル使用メモリ 75,444 KB
実行使用メモリ 466,340 KB
最終ジャッジ日時 2023-08-23 22:07:51
合計ジャッジ時間 34,467 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 855 ms
463,704 KB
testcase_01 AC 1,299 ms
464,132 KB
testcase_02 AC 373 ms
463,248 KB
testcase_03 AC 367 ms
463,292 KB
testcase_04 AC 365 ms
461,488 KB
testcase_05 AC 490 ms
466,312 KB
testcase_06 AC 1,219 ms
466,112 KB
testcase_07 AC 1,342 ms
466,320 KB
testcase_08 AC 1,284 ms
466,020 KB
testcase_09 AC 932 ms
465,824 KB
testcase_10 AC 634 ms
466,272 KB
testcase_11 AC 845 ms
466,276 KB
testcase_12 AC 839 ms
466,340 KB
testcase_13 AC 652 ms
466,000 KB
testcase_14 AC 494 ms
465,964 KB
testcase_15 AC 936 ms
466,000 KB
testcase_16 AC 806 ms
466,008 KB
testcase_17 AC 856 ms
465,996 KB
testcase_18 AC 858 ms
465,828 KB
testcase_19 AC 901 ms
466,024 KB
testcase_20 AC 1,139 ms
463,952 KB
testcase_21 AC 872 ms
465,844 KB
testcase_22 AC 388 ms
465,176 KB
testcase_23 AC 389 ms
465,220 KB
testcase_24 AC 381 ms
465,056 KB
testcase_25 AC 387 ms
465,080 KB
testcase_26 AC 387 ms
465,400 KB
testcase_27 AC 381 ms
464,572 KB
testcase_28 AC 385 ms
464,824 KB
testcase_29 AC 386 ms
464,956 KB
testcase_30 AC 386 ms
464,952 KB
testcase_31 AC 380 ms
464,964 KB
testcase_32 AC 395 ms
465,332 KB
testcase_33 AC 389 ms
465,232 KB
testcase_34 AC 399 ms
465,292 KB
testcase_35 AC 803 ms
465,944 KB
testcase_36 AC 1,164 ms
466,028 KB
testcase_37 AC 1,326 ms
465,964 KB
testcase_38 AC 690 ms
466,324 KB
testcase_39 AC 377 ms
464,784 KB
testcase_40 AC 375 ms
464,948 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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();}};
}
0