結果
問題 | No.202 1円玉投げ |
ユーザー | holeguma |
提出日時 | 2015-10-14 18:24:44 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 410 ms / 5,000 ms |
コード長 | 3,812 bytes |
コンパイル時間 | 2,513 ms |
コンパイル使用メモリ | 83,492 KB |
実行使用メモリ | 90,088 KB |
最終ジャッジ日時 | 2023-08-23 23:13:41 |
合計ジャッジ時間 | 16,246 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 280 ms
88,616 KB |
testcase_01 | AC | 358 ms
88,888 KB |
testcase_02 | AC | 180 ms
84,200 KB |
testcase_03 | AC | 180 ms
84,704 KB |
testcase_04 | AC | 184 ms
84,360 KB |
testcase_05 | AC | 236 ms
87,500 KB |
testcase_06 | AC | 410 ms
89,580 KB |
testcase_07 | AC | 400 ms
89,448 KB |
testcase_08 | AC | 358 ms
88,412 KB |
testcase_09 | AC | 340 ms
89,364 KB |
testcase_10 | AC | 257 ms
88,060 KB |
testcase_11 | AC | 318 ms
88,752 KB |
testcase_12 | AC | 331 ms
89,180 KB |
testcase_13 | AC | 262 ms
88,416 KB |
testcase_14 | AC | 238 ms
87,572 KB |
testcase_15 | AC | 330 ms
90,088 KB |
testcase_16 | AC | 271 ms
89,000 KB |
testcase_17 | AC | 272 ms
89,420 KB |
testcase_18 | AC | 276 ms
86,328 KB |
testcase_19 | AC | 327 ms
89,380 KB |
testcase_20 | AC | 368 ms
89,700 KB |
testcase_21 | AC | 323 ms
87,276 KB |
testcase_22 | AC | 189 ms
85,164 KB |
testcase_23 | AC | 189 ms
85,272 KB |
testcase_24 | AC | 187 ms
85,092 KB |
testcase_25 | AC | 187 ms
85,148 KB |
testcase_26 | AC | 191 ms
84,728 KB |
testcase_27 | AC | 188 ms
84,644 KB |
testcase_28 | AC | 186 ms
84,940 KB |
testcase_29 | AC | 188 ms
83,012 KB |
testcase_30 | AC | 190 ms
84,952 KB |
testcase_31 | AC | 187 ms
84,860 KB |
testcase_32 | AC | 190 ms
84,748 KB |
testcase_33 | AC | 191 ms
84,532 KB |
testcase_34 | AC | 189 ms
85,072 KB |
testcase_35 | AC | 324 ms
88,772 KB |
testcase_36 | AC | 295 ms
89,184 KB |
testcase_37 | AC | 390 ms
89,324 KB |
testcase_38 | AC | 322 ms
88,812 KB |
testcase_39 | AC | 184 ms
84,508 KB |
testcase_40 | AC | 184 ms
84,740 KB |
ソースコード
import java.io.InputStream; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.BitSet; import java.util.Comparator; import java.util.Collections; import java.util.Deque; import java.util.HashMap; import java.util.HashSet; import java.util.InputMismatchException; import java.util.Map; import java.util.NoSuchElementException; import java.util.PriorityQueue; import java.util.TreeMap; import java.util.TreeSet; import java.math.BigDecimal; import java.math.BigInteger; import java.awt.Point; public class Main{ static PrintWriter out; static InputReader ir; static final int INF=Integer.MAX_VALUE; static final long LINF=Long.MAX_VALUE; static int MAX=20000,size=20; static void solve(){ Bucket[][] bucket=new Bucket[MAX/size+1][MAX/size+1]; for(int i=0;i<=MAX/size;i++){ for(int j=0;j<=MAX/size;j++){ bucket[i][j]=new Bucket(); } } int n=ir.nextInt(); int ans=0; outer: for(int i=0;i<n;i++){ Point p=new Point(ir.nextInt(),ir.nextInt()); int bx=p.x/size; int by=p.y/size; for(int j=bx-1;j<=bx+1;j++){ for(int k=by-1;k<=by+1;k++){ if(j<0||j>MAX/size||k<0||k>MAX/size) continue; for(int l=0;l<bucket[j][k].size();l++){ if(p.distanceSq(bucket[j][k].get(l))<400) continue outer; } } } ans++; bucket[bx][by].add(p); } out.println(ans); } static class Bucket extends ArrayList<Point>{} public static void main(String[] args) throws Exception{ ir=new InputReader(System.in); out=new PrintWriter(System.out); solve(); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer=new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;} public boolean hasNextByte() { if(curbuf>=lenbuf){ curbuf= 0; try{ lenbuf=in.read(buffer); }catch(IOException e) { throw new InputMismatchException(); } if(lenbuf<=0) return false; } return true; } private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;} private boolean isSpaceChar(int c){return !(c>=33&&c<=126);} private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;} public boolean hasNext(){skip(); return hasNextByte();} public String next(){ if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb=new StringBuilder(); int b=readByte(); while(!isSpaceChar(b)){ sb.appendCodePoint(b); b=readByte(); } return sb.toString(); } public int nextInt() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } int res=0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } long res = 0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public double nextDouble(){return Double.parseDouble(next());} public BigInteger nextBigInteger(){return new BigInteger(next());} public BigDecimal nextBigDecimal(){return new BigDecimal(next());} public int[] nextIntArray(int n){ int[] a=new int[n]; for(int i=0;i<n;i++) a[i]=nextInt(); return a; } public char[][] nextCharMap(int n,int m){ char[][] map=new char[n][m]; for(int i=0;i<n;i++) map[i]=next().toCharArray(); return map; } } }