結果

問題 No.602 隠されていたゲーム2
ユーザー yuya178yuya178
提出日時 2017-12-02 01:28:52
言語 Java21
(openjdk 21)
結果
AC  
実行時間 184 ms / 2,000 ms
コード長 4,477 bytes
コンパイル時間 2,338 ms
コンパイル使用メモリ 80,932 KB
実行使用メモリ 41,360 KB
最終ジャッジ日時 2024-05-09 11:31:01
合計ジャッジ時間 5,112 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
37,356 KB
testcase_01 AC 50 ms
37,148 KB
testcase_02 AC 50 ms
37,328 KB
testcase_03 AC 50 ms
37,204 KB
testcase_04 AC 53 ms
37,292 KB
testcase_05 AC 51 ms
36,784 KB
testcase_06 AC 52 ms
37,236 KB
testcase_07 AC 51 ms
37,172 KB
testcase_08 AC 51 ms
37,416 KB
testcase_09 AC 51 ms
37,104 KB
testcase_10 AC 49 ms
37,292 KB
testcase_11 AC 49 ms
37,360 KB
testcase_12 AC 50 ms
37,060 KB
testcase_13 AC 50 ms
36,912 KB
testcase_14 AC 49 ms
37,456 KB
testcase_15 AC 51 ms
37,408 KB
testcase_16 AC 93 ms
38,960 KB
testcase_17 AC 110 ms
40,148 KB
testcase_18 AC 166 ms
41,168 KB
testcase_19 AC 183 ms
41,276 KB
testcase_20 AC 111 ms
40,560 KB
testcase_21 AC 110 ms
39,840 KB
testcase_22 AC 184 ms
41,360 KB
testcase_23 AC 109 ms
39,696 KB
権限があれば一括ダウンロードができます

ソースコード

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;
            }
        }
        if((Math.abs(x)+Math.abs(y))%2==0){
            if(Math.abs(x)+Math.abs(y) <= 2*d[n-1]){
                out.println(2);
                return;
            }
        }
        else{
            long odd = 0;
            long even = 0;
            for(int i = 0; i < n; i++){
                if(d [i]%2==0) odd = d[i];
                else even = d[i];
                if(odd==0||even==0) continue;
                long s = Math.abs(odd-even);
                long g = odd+even;
                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