結果

問題 No.199 星を描こう
ユーザー holegumaholeguma
提出日時 2016-01-19 20:34:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 52 ms / 2,000 ms
コード長 4,214 bytes
コンパイル時間 2,240 ms
コンパイル使用メモリ 87,368 KB
実行使用メモリ 50,772 KB
最終ジャッジ日時 2024-06-09 13:55:18
合計ジャッジ時間 4,424 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
50,396 KB
testcase_01 AC 49 ms
50,284 KB
testcase_02 AC 49 ms
50,476 KB
testcase_03 AC 52 ms
50,772 KB
testcase_04 AC 52 ms
50,416 KB
testcase_05 AC 50 ms
50,452 KB
testcase_06 AC 51 ms
50,588 KB
testcase_07 AC 52 ms
50,320 KB
testcase_08 AC 52 ms
50,612 KB
testcase_09 AC 48 ms
50,484 KB
testcase_10 AC 49 ms
50,408 KB
testcase_11 AC 48 ms
50,496 KB
testcase_12 AC 48 ms
50,644 KB
testcase_13 AC 50 ms
50,132 KB
testcase_14 AC 50 ms
50,140 KB
testcase_15 AC 49 ms
50,636 KB
testcase_16 AC 48 ms
50,296 KB
testcase_17 AC 49 ms
50,536 KB
testcase_18 AC 48 ms
50,596 KB
testcase_19 AC 48 ms
50,464 KB
testcase_20 AC 49 ms
50,668 KB
testcase_21 AC 48 ms
50,372 KB
testcase_22 AC 48 ms
50,560 KB
testcase_23 AC 49 ms
50,612 KB
testcase_24 AC 47 ms
50,176 KB
testcase_25 AC 46 ms
50,260 KB
testcase_26 AC 46 ms
50,572 KB
testcase_27 AC 47 ms
50,400 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.BigInteger;

public class Main{

static PrintWriter out;
static InputReader ir;

static void solve(){
 P[] ps=new P[5];
 for(int i=0;i<5;i++) ps[i]=new P(ir.nextDouble(),ir.nextDouble());
 P[] c=convexHull(ps);
 out.println(c.length==5?"YES":"NO");
}

public static P[] convexHull(P[] ps){
 int n=ps.length;
 Arrays.sort(ps,new Comparator<P>(){
  public int compare(P a,P b){
   if(a.getX()!=b.getX()) return Double.compare(a.getX(),b.getX());
   return Double.compare(a.getY(),b.getY());
  }
 });
 int p=0;
 P[] qs=new P[2*n];
 for(int i=0;i<n;i++){
  while(p>1&&(qs[p-1].sub(qs[p-2])).det(ps[i].sub(qs[p-1]))<=0) p--;
  qs[p++]=ps[i];
 }
 for(int i=n-2,t=p;i>=0;i--){
  while(p>t&&(qs[p-1].sub(qs[p-2])).det(ps[i].sub(qs[p-1]))<=0) p--;
  qs[p++]=ps[i];
 }
 return Arrays.copyOf(qs,p-1);
}

static final double EPS=1e-10;

public static double accurateTotal(double a,double b){
 if(Math.abs(a+b)<EPS*(Math.abs(a)+Math.abs(b))) return 0.0;
 return a+b;
}

static class P{

 public double x,y;

 public P(double x,double y){
  this.x=x; this.y=y;
 }

 public double getX(){
  return this.x;
 }

 public double getY(){
  return this.y;
 }

 public P add(P v){
  return new P(accurateTotal(this.x,v.x),accurateTotal(this.y,v.y));
 }

 public P sub(P v){
  return new P(accurateTotal(this.x,-v.x),accurateTotal(this.y,-v.y));
 }

 public P mul(double k){
  return new P(this.x*k,this.y*k);
 }

 public double dot(P v){
  return accurateTotal(this.x*v.x,this.y*v.y);
 }

 public double det(P v){
  return accurateTotal(this.x*v.y,-this.y*v.x);
 }
}

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 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