結果

問題 No.168 ものさし
ユーザー holegumaholeguma
提出日時 2015-11-02 21:52:50
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,455 bytes
コンパイル時間 2,453 ms
コンパイル使用メモリ 82,112 KB
実行使用メモリ 80,460 KB
最終ジャッジ日時 2024-09-13 07:10:33
合計ジャッジ時間 12,524 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 232 ms
59,196 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 AC 54 ms
50,280 KB
testcase_04 AC 54 ms
50,240 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 54 ms
50,188 KB
testcase_08 WA -
testcase_09 AC 65 ms
50,636 KB
testcase_10 AC 81 ms
51,556 KB
testcase_11 AC 226 ms
58,628 KB
testcase_12 AC 819 ms
68,192 KB
testcase_13 AC 1,045 ms
79,836 KB
testcase_14 AC 1,017 ms
79,672 KB
testcase_15 AC 54 ms
49,960 KB
testcase_16 AC 60 ms
50,260 KB
testcase_17 AC 75 ms
51,492 KB
testcase_18 AC 111 ms
52,560 KB
testcase_19 AC 1,222 ms
79,836 KB
testcase_20 WA -
testcase_21 AC 1,109 ms
79,740 KB
testcase_22 AC 1,094 ms
79,640 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
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 void solve(){
 int n=ir.nextInt();
 Point[] ps=new Point[n];
 for(int i=0;i<n;i++){
  ps[i]=new Point(ir.nextInt(),ir.nextInt());
 }
 Edge[] es=new Edge[n*(n-1)/2];
 int p=0;
 for(int i=0;i<n;i++){
  for(int j=i+1;j<n;j++){
   es[p++]=new Edge(i,j,(long)ps[i].distanceSq(ps[j]));
  }
 }
 Arrays.sort(es,new Comparator<Edge>(){
  public int compare(Edge e1,Edge e2){
   return e1.cost>e2.cost?1:e1.cost<e2.cost?-1:0;
  }
 });
 UnionFindTree uf=new UnionFindTree(n);
 long ma=0;
 p=0;
 while(!uf.same(0,n-1)){
  Edge e=es[p++];
  if(!uf.same(e.from,e.to)){
   uf.unite(e.from,e.to);
   ma=(long)Math.max(ma,e.cost);
  }
 }
 double ans=Math.sqrt((double)ma);
 long aa=(long)Math.ceil(ans);
 aa+=(aa%10==0)?aa:10-aa%10;
 out.println(aa);
}

public static void main(String[] args) throws Exception{
 ir=new InputReader(System.in);
 out=new PrintWriter(System.out);
 solve();
 out.flush();
}

static class Edge{
 int from;
 int to;
 long cost;
 public Edge(int from,int to,long cost){
  this.from=from; this.to=to; this.cost=cost;
 }
 public Edge(int to,long cost){
  this.to=to; this.cost=cost;
 }
}

static class UnionFindTree{

 private int[] par;
 private int[] rank;

 public UnionFindTree(int size){
  par=new int[size];
  rank=new int[size];
  for(int i=0;i<size;i++){
   par[i]=i;
   rank[i]=0;
  }
 }

 private int find(int x){
  if(par[x]==x) return x;
  else return par[x]=find(par[x]);
 }

 public void unite(int x,int y){
  x=find(x);
  y=find(y);
  if(x==y) return;
  else if(rank[x]>rank[y]) par[y]=x;
  else{
   par[x]=y;
   if(rank[x]==rank[y]) rank[y]++;
  }
 }

 public boolean same(int x,int y){
  return find(x)==find(y);
 }
}

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 long[] nextLongArray(int n){
  long[] a=new long[n];
  for(int i=0;i<n;i++) a[i]=nextLong();
  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;
 }
}
}
0