結果
問題 | No.202 1円玉投げ |
ユーザー | 37zigen |
提出日時 | 2020-04-09 03:23:38 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,447 bytes |
コンパイル時間 | 2,054 ms |
コンパイル使用メモリ | 75,124 KB |
実行使用メモリ | 73,244 KB |
最終ジャッジ日時 | 2023-08-24 00:08:30 |
合計ジャッジ時間 | 46,976 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4,173 ms
71,260 KB |
testcase_01 | AC | 1,009 ms
66,980 KB |
testcase_02 | AC | 39 ms
49,208 KB |
testcase_03 | AC | 43 ms
49,152 KB |
testcase_04 | AC | 40 ms
49,248 KB |
testcase_05 | AC | 103 ms
54,352 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 110 ms
54,852 KB |
testcase_15 | WA | - |
testcase_16 | AC | 3,783 ms
71,196 KB |
testcase_17 | AC | 3,861 ms
71,340 KB |
testcase_18 | AC | 3,873 ms
73,244 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 113 ms
55,672 KB |
testcase_23 | AC | 132 ms
56,992 KB |
testcase_24 | AC | 83 ms
53,600 KB |
testcase_25 | AC | 126 ms
55,708 KB |
testcase_26 | AC | 112 ms
55,788 KB |
testcase_27 | AC | 137 ms
56,764 KB |
testcase_28 | AC | 101 ms
54,940 KB |
testcase_29 | AC | 108 ms
55,696 KB |
testcase_30 | WA | - |
testcase_31 | AC | 41 ms
49,292 KB |
testcase_32 | AC | 49 ms
49,664 KB |
testcase_33 | AC | 120 ms
56,704 KB |
testcase_34 | WA | - |
testcase_35 | AC | 3,339 ms
71,928 KB |
testcase_36 | AC | 3,943 ms
71,096 KB |
testcase_37 | WA | - |
testcase_38 | AC | 3,266 ms
72,008 KB |
testcase_39 | WA | - |
testcase_40 | AC | 70 ms
53,096 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.HashSet; import java.util.NoSuchElementException; import java.util.Set; public class Main { public static void main(String[] args) { new Main().run(); } void run() { FastScanner sc=new FastScanner(); int N=sc.nextInt(); int MAX=(20000+18)/19; boolean[][] exist=new boolean[MAX][MAX]; Set<Long> set=new HashSet<>(); int[] X=new int[N]; int[] Y=new int[N]; for (int i=0;i<N;++i) { X[i]=sc.nextInt(); Y[i]=sc.nextInt(); } int ans=0; out:for (int i=0;i<N;++i) { if (exist[X[i]/19][Y[i]/19]) continue; boolean empty=true;; for (int dx=-1;dx<=1;++dx) { for (int dy=-1;dy<=1;++dy) { if (X[i]/19+dx<0||Y[i]/19+dy<0||X[i]/19+dx>=MAX||Y[i]/19+dy>=MAX) continue; empty &= !exist[X[i]/19+dx][Y[i]/19+dy]; } } if (!empty) { for (int x=Math.max(0, X[i]-19);x<=X[i]+19;++x) { for (int y=Math.max(0, Y[i]-19);y<=Y[i]+19;++y) { long dx=x-X[i]; long dy=y-Y[i]; if (dx*dx+dy*dy>=20*20) continue; if (set.contains((long)x<<32|y)) { continue out; } } } } ++ans; set.add((long)X[i]<<32|Y[i]); exist[X[i]/19][Y[i]/19]=true; } System.out.println(ans); } void tr(Object...objects) {System.out.println(Arrays.deepToString(objects));} } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; 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(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next());} }