結果

問題 No.245 貫け！
ユーザー uwi
提出日時 2015-07-19 02:54:36
言語 Java
(openjdk 23)
結果
AC  
実行時間 155 ms / 5,000 ms
コード長 4,424 bytes
コンパイル時間 3,502 ms
コンパイル使用メモリ 84,140 KB
実行使用メモリ 52,124 KB
最終ジャッジ日時 2024-07-08 10:17:01
合計ジャッジ時間 6,162 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 16
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

package q5xx;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Q507 {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
    
    void solve()
    {
        int n = ni();
        long[][] co = new long[n][];
        for(int i = 0;i < n;i++){
            co[i] = new long[]{ni(), ni(), ni(), ni()};;
        }
        
        int ret = 0;
        for(int i = 0;i < n;i++){
            for(int j = 0;j < 4;j+=2){
                for(int k = 0;k < n;k++){
                    for(int l = 0;l < 4;l+=2){
                        int ct = 0;
                        for(int m = 0;m < n;m++){
                            if(hasCommonPoint(
                                    co[i][j] + (co[k][l]-co[i][j])*-1000L, co[i][j+1] + (co[k][l+1]-co[i][j+1])*-1000L, 
                                    co[k][l] + (co[k][l]-co[i][j])*1000L, co[k][l+1] + (co[k][l+1]-co[i][j+1])*1000L,
                                    co[m][0], co[m][1], 
                                    co[m][2], co[m][3]
                                            )){
                                ct++;
                            }
                        }
                        ret = Math.max(ret, ct);
                    }
                }
            }
        }
        out.println(ret);
    }
    
    public static boolean hasCommonPoint(long ax, long ay, long bx, long by, long cx, long cy, long dx, long dy)
    {
        long c1 = (cx-ax)*(by-ay)-(cy-ay)*(bx-ax);
        long c2 = (dx-ax)*(by-ay)-(dy-ay)*(bx-ax);
        if(c1 < 0 && c2 < 0 || c1 > 0 && c2 > 0)return false;
        long d1 = (ax-cx)*(dy-cy)-(ay-cy)*(dx-cx);
        long d2 = (bx-cx)*(dy-cy)-(by-cy)*(dx-cx);
        if(d1 < 0 && d2 < 0 || d1 > 0 && d2 > 0)return false;
        if(c1 == 0 && c2 == 0 && d1 == 0 && d2 == 0){
            if(ax == bx && ay == by){
                return (cx-ax)*(dx-ax)+(cy-ay)*(dy-ay) <= 0;
            }else{
                long posc = (cx-ax)*(bx-ax)+(cy-ay)*(by-ay);
                long posd = (dx-ax)*(bx-ax)+(dy-ay)*(by-ay);
                long den = (bx-ax)*(bx-ax)+(by-ay)*(by-ay);
    //          return Math.max(0, Math.min(posc, posd)) <= Math.min(den, Math.max(posc, posd));
    //          return Math.min(posc, posd) <= den && 0 <= Math.max(posc, posd);
                return (posc <= den || posd <= den) && (0 <= posc || 0 <= posd);
            }
        }
        return true;
    }
    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Q507().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0