結果
| 問題 |
No.199 星を描こう
|
| コンテスト | |
| ユーザー |
 threepipes_s
|
| 提出日時 | 2016-08-25 16:20:41 |
| 言語 | Java (openjdk 23) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 10,302 bytes |
| コンパイル時間 | 3,324 ms |
| コンパイル使用メモリ | 93,692 KB |
| 実行使用メモリ | 37,492 KB |
| 最終ジャッジ日時 | 2024-11-08 02:22:11 |
| 合計ジャッジ時間 | 6,021 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 13 WA * 12 |
ソースコード
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Random;
import java.util.TreeMap;
public class Main {
static ContestScanner in;static Writer out;static StringBuilder sb=new StringBuilder();
public static void main(String[] args)
{try{in=new ContestScanner();out=new Writer();Main solve=new Main();solve.solve();
in.close();out.flush();out.close();}catch(IOException e){e.printStackTrace();}}
static void dump(int[]a){sb.setLength(0);for(int i=0;i<a.length;i++)
sb.append(a[i]).append("\t");out.println(sb.toString().trim());}
static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();}
static void dump(long[]a){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}
static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}
static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}
static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}
static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}
static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}
static void m_sort(int[]a,int s,int sz,int[]b)
{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
while(l<le&&r<re){if(a[l]>a[r])b[x++]=a[r++];else b[x++]=a[l++];}
while(r<re)b[x++]=a[r++];while(l<le)b[x++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];
} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */
static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}
static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}
static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}
static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}
static void m_sort(long[]a,int s,int sz,long[]b)
{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int x=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
while(l<le&&r<re){if(a[l]>a[r])b[x++]=a[r++];else b[x++]=a[l++];}
while(r<re)b[x++]=a[r++];while(l<le)b[x++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}
static void swap(long[]a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}
static void swap(int[]a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}
static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v
{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
static int binarySearchSmallerMax(int[]a,int v,int l,int r)
{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
List<Integer>[]randomTree(int n,Random r){List<Integer>[]g=graph(n);
for(int i=1;i<n;i++){int p=r.nextInt(i);g[p].add(i);g[i].add(p);}return g;}
static List<Integer>[]graph(int n){List<Integer>[]g=new List[n];
for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}
void solve() throws NumberFormatException, IOException{
final int n = 5;
Pos[] p = new Pos[n];
List<int[]> list = new ArrayList<>();
for(int i=0; i<n; i++){
int x = in.nextInt();
int y = in.nextInt();
p[i] = new Pos(x, y);
list.add(new int[]{x, y});
}
List<int[]> hull = convexHull(list);
for(int i=0; i<n; i++){
for(int j=i+1; j<n; j++){
for(int k=j+1; k<n; k++){
if(Line.ccw(p[i], p[j], p[k])==0){
System.out.println("NO");
return;
}
}
}
}
if(hull.size()<n){
System.out.println("NO");
}else{
System.out.println("YES");
}
}
public List<int[]> convexHull(List<int[]> list){
int k = 0;
Collections.sort(list, new Sort());
int n = list.size();
int[][] qs = new int[n*2][2];
for(int i=0; i<n; i++){
while(k > 1 && cross(qs[k-2], qs[k-1], qs[k-1], list.get(i)) < 0) k--;
qs[k++] = list.get(i);
}
for(int i=n-2, t=k; i>=0; i--){
while(k > t && cross(qs[k-2], qs[k-1], qs[k-1], list.get(i)) < 0) k--;
qs[k++] = list.get(i);
}
List<int[]> res = new ArrayList<int[]>();
for(int i=0; i<k; i++){
res.add(qs[i]);
}
return res;
}
class Sort implements Comparator<int[]>{
@Override
public int compare(int[] o1, int[] o2) {
if(o1[0] != o2[0]) return o1[0]-o2[0];
return o1[1]-o2[1];
}
}
public int cross(int[] p11, int[] p12, int[] p21, int[] p22){
return (p12[0]-p11[0])*(p22[1]-p21[1]) - (p22[0]-p21[0])*(p12[1]-p11[1]);
}
}
class Pos implements Comparable<Pos>{
static final double EPS = 1e-10;
double x, y;
public Pos(double x, double y){
this.x = x;
this.y = y;
}
public double dist2(Pos p){
return (x-p.x)*(x-p.x) + (y-p.y)*(y-p.y);
}
@Override
public int compareTo(Pos o) {
if(Math.abs(x-o.x) >= EPS) return Double.compare(x, o.x);
if(Math.abs(y-o.y) >= EPS) return Double.compare(y, o.y);
return 0;
}
}
class Line{
static final double EPS = 1e-10;
Pos p1, p2;
Pos vec;
public Line(Pos p1, Pos p2){
this.p1 = p1;
this.p2 = p2;
vec = new Pos(p2.x-p1.x, p2.y-p1.y);
}
public Line(double x1, double y1, double x2, double y2){
p1 = new Pos(x1, y1);
p2 = new Pos(x2, y2);
vec = new Pos(x2-x1, y2-y1);
}
Pos crossPos(Line l){
if(!cross(p1, p2, l.p1, l.p2)) return null;
double d1 = Math.abs(cross(l.vec.x, l.vec.y, p1.x-l.p1.x, p1.y-l.p1.y));
double d2 = Math.abs(cross(l.vec.x, l.vec.y, p2.x-l.p1.x, p2.y-l.p1.y));
double t = d1/(d1+d2);
return new Pos(p1.x+(p2.x-p1.x)*t, p1.y+(p2.y-p1.y)*t);
}
boolean link(Line l){
return p1.compareTo(l.p1) == 0
|| p1.compareTo(l.p2) == 0
|| p2.compareTo(l.p1) == 0
|| p2.compareTo(l.p2) == 0;
}
static boolean cross(Pos p1, Pos p2, Pos p3, Pos p4){
return ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 && ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0;
}
static double cross(Pos a, Pos b){
return a.x*b.y - b.x*a.y;
}
public static double cross(double x1, double y1, double x2, double y2){
return x1*y2 - x2*y1;
}
// 上正座標で反時計回りが正
// 下正なら当然逆になる
static double ccw(Pos a, Pos b, Pos c){
double dx1 = b.x - a.x;
double dy1 = b.y - a.y;
double dx2 = c.x - a.x;
double dy2 = c.y - a.y;
return dx1*dy2 - dx2*dy1;
}
public static double dist(Pos a, Pos b, Pos c){
// a->b からcへの距離
if(dot(b.x-a.x, b.y-a.y, c.x-a.x, c.y-a.y) < EPS)
return Math.sqrt(a.dist2(c));
if(dot(a.x-b.x, a.y-b.y, c.x-b.x, c.y-b.y) < EPS)
return Math.sqrt(b.dist2(c));
return Math.abs(ccw(a, b, c))/Math.sqrt(a.dist2(b));
}
public double dist(Line l){
double res1 = Math.min(dist(p1, p2, l.p1), dist(p1, p2, l.p2));
double res2 = Math.min(dist(l.p1, l.p2, p1), dist(l.p1, l.p2, p2));
return Math.min(res1, res2);
}
public static double dot(double x, double y, double x1, double y2){
return x*x1 + y*y2;
}
}
class MultiSet<T> extends HashMap<T, Integer>{
@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
public void add(T key,int v){put(key,get(key)+v);}
public void add(T key){put(key,get(key)+1);}
public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
public MultiSet<T> merge(MultiSet<T> set)
{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}
}
class OrderedMultiSet<T> extends TreeMap<T, Integer>{
@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
public void add(T key,int v){put(key,get(key)+v);}
public void add(T key){put(key,get(key)+1);}
public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
public OrderedMultiSet<T> merge(OrderedMultiSet<T> set)
{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}
}
class Pair implements Comparable<Pair>{
int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}
public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}
public int hashCode(){return hash;}
public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}
}
class Timer{
long time;public void set(){time=System.currentTimeMillis();}
public long stop(){return time=System.currentTimeMillis()-time;}
public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}
@Override public String toString(){return"Time: "+time+"ms";}
}
class Writer extends PrintWriter{
public Writer(String filename)throws IOException
{super(new BufferedWriter(new FileWriter(filename)));}
public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
private BufferedReader in;private int c=-2;
public ContestScanner()throws IOException
{in=new BufferedReader(new InputStreamReader(System.in));}
public ContestScanner(String filename)throws IOException
{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
public String nextToken()throws IOException {
StringBuilder sb=new StringBuilder();
while((c=in.read())!=-1&&Character.isWhitespace(c));
while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
return sb.toString();
}
public String readLine()throws IOException{
StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
return sb.toString();
}
public long nextLong()throws IOException,NumberFormatException
{return Long.parseLong(nextToken());}
public int nextInt()throws NumberFormatException,IOException
{return(int)nextLong();}
public double nextDouble()throws NumberFormatException,IOException
{return Double.parseDouble(nextToken());}
public void close() throws IOException {in.close();}
}