結果

問題 No.602 隠されていたゲーム2
ユーザー uwiuwi
提出日時 2017-12-02 00:23:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 189 ms / 2,000 ms
コード長 4,966 bytes
コンパイル時間 4,467 ms
コンパイル使用メモリ 82,940 KB
実行使用メモリ 45,136 KB
最終ジャッジ日時 2024-12-15 23:57:15
合計ジャッジ時間 7,066 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
37,012 KB
testcase_01 AC 51 ms
37,088 KB
testcase_02 AC 49 ms
36,644 KB
testcase_03 AC 49 ms
37,220 KB
testcase_04 AC 51 ms
37,072 KB
testcase_05 AC 49 ms
37,144 KB
testcase_06 AC 51 ms
36,864 KB
testcase_07 AC 49 ms
36,884 KB
testcase_08 AC 50 ms
37,072 KB
testcase_09 AC 52 ms
37,072 KB
testcase_10 AC 51 ms
37,292 KB
testcase_11 AC 49 ms
36,960 KB
testcase_12 AC 52 ms
37,308 KB
testcase_13 AC 50 ms
36,732 KB
testcase_14 AC 48 ms
37,000 KB
testcase_15 AC 50 ms
37,120 KB
testcase_16 AC 93 ms
39,336 KB
testcase_17 AC 108 ms
40,456 KB
testcase_18 AC 178 ms
43,096 KB
testcase_19 AC 189 ms
43,468 KB
testcase_20 AC 146 ms
45,136 KB
testcase_21 AC 128 ms
42,968 KB
testcase_22 AC 182 ms
41,032 KB
testcase_23 AC 107 ms
42,184 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 N602 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long[] d = new long[n];
		for(int i = 0;i < n;i++)d[i] = nl();
		int x = ni(), y = ni();
		long m = Math.abs(x) + Math.abs(y);
		Arrays.sort(d);
		if(m == 0){
			out.println(0);
			return;
		}
		for(int i = 0;i < n;i++){
			if(d[i] == m){
				out.println(1);
				return;
			}
		}
		
		if(m % 2 == 0){
			long max = d[n-1]*2;
			if(m <= max){
				out.println(2);
				return;
			}
		}else{
			long[] es = new long[n];
			long[] os = new long[n];
			int p = 0, q = 0;
			for(int i = 0;i < n;i++){
				if(d[i] % 2 == 0){
					es[p++] = d[i];
				}else{
					os[q++] = d[i];
				}
			}
			es = Arrays.copyOf(es, p);
			os = Arrays.copyOf(os, q);
			if(!(p == 0 || q == 0)){
				for(int i = 0;i < p;i++){
					int ind = Arrays.binarySearch(os, es[i]);
					if(ind >= 0){
						if(m <= es[i] + os[ind]){
							out.println(2);
							return;
						}
					}else{
						int low = -ind-2;
						if(low >= 0){
							if(es[i] - os[low] <= m && m <= es[i] + os[low]){
								out.println(2);
								return;
							}
						}
						int high = -ind-1;
						if(high < q){
							if(os[high] - es[i] <= m && m <= os[high] + es[i]){
								out.println(2);
								return;
							}
						}
					}
				}
				for(int i = 0;i < q;i++){
					int ind = Arrays.binarySearch(es, os[i]);
					if(ind >= 0){
						if(m <= os[i] + es[ind]){
							out.println(2);
							return;
						}
					}else{
						int low = -ind-2;
						if(low >= 0){
							if(os[i] - es[low] <= m && m <= os[i] + es[low]){
								out.println(2);
								return;
							}
						}
						int high = -ind-1;
						if(high < p){
							if(es[high] - os[i] <= m && m <= es[high] + os[i]){
								out.println(2);
								return;
							}
						}
					}
				}
			}
		}
		out.println(-1);
	}
	
	public static int lowerBound(long[] a, long v)
	{
		int low = -1, high = a.length;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] >= v){
				high = h;
			}else{
				low = h;
			}
		}
		return high;
	}

	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new N602().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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