結果

問題 No.602 隠されていたゲーム2
ユーザー yuya178yuya178
提出日時 2017-12-02 00:52:43
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,332 bytes
コンパイル時間 2,204 ms
コンパイル使用メモリ 80,952 KB
実行使用メモリ 41,336 KB
最終ジャッジ日時 2024-05-06 00:27:40
合計ジャッジ時間 4,678 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
37,172 KB
testcase_01 AC 45 ms
37,044 KB
testcase_02 AC 45 ms
36,856 KB
testcase_03 WA -
testcase_04 AC 46 ms
37,184 KB
testcase_05 AC 44 ms
37,064 KB
testcase_06 AC 42 ms
37,076 KB
testcase_07 AC 43 ms
36,768 KB
testcase_08 AC 45 ms
36,784 KB
testcase_09 AC 45 ms
36,916 KB
testcase_10 AC 45 ms
36,900 KB
testcase_11 AC 42 ms
36,912 KB
testcase_12 AC 43 ms
36,548 KB
testcase_13 AC 44 ms
37,028 KB
testcase_14 AC 44 ms
37,152 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 104 ms
39,912 KB
testcase_18 AC 161 ms
41,028 KB
testcase_19 AC 166 ms
41,168 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 182 ms
41,336 KB
testcase_23 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1_000_000_007;
    List<Integer>[] node;
    boolean[] seen;
    void solve()
    {
        int n = ni();
        long[] d = new long[n];
        for(int i = 0; i < n; i++){
            d[i] = nl();
        }
        long x = nl();
        long y = nl();
        if(x==0&&y==0){
            out.println(0);
            return;
        }
        Arrays.sort(d);
        for(int i = 0; i < n; i++){
            if(Math.abs(x)+Math.abs(y)==d[i]){
                out.println(1);
                return;
            }
        }
        for(int i = 0; i < n - 1; i++){
            long s = Math.abs(d[i+1]-d[i]);
            long g = d[i]+d[i+1];
            if(Math.abs(x)+Math.abs(y) >= s && Math.abs(x)+Math.abs(y) <= g){
                out.println(2);
                return;
            }
        }
        for(int i = 0; i < n; i++){
            long s = 0;
            long g = d[i]+d[i];
            if(Math.abs(x)+Math.abs(y) >= s && Math.abs(x)+Math.abs(y) <= g){
                out.println(2);
                return;
            }
        }
        out.println(-1);

    }
    
    
    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 Main().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) && 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)); }

}
0