結果

問題 No.602 隠されていたゲーム2
ユーザー uwiuwi
提出日時 2017-12-02 00:06:45
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,839 bytes
コンパイル時間 3,364 ms
コンパイル使用メモリ 85,436 KB
実行使用メモリ 41,408 KB
最終ジャッジ日時 2024-05-05 21:27:30
合計ジャッジ時間 5,808 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
36,788 KB
testcase_01 AC 43 ms
37,228 KB
testcase_02 AC 44 ms
37,096 KB
testcase_03 AC 44 ms
37,100 KB
testcase_04 AC 44 ms
37,100 KB
testcase_05 AC 43 ms
36,972 KB
testcase_06 AC 43 ms
36,972 KB
testcase_07 AC 42 ms
37,328 KB
testcase_08 AC 43 ms
36,920 KB
testcase_09 AC 42 ms
37,120 KB
testcase_10 AC 45 ms
36,824 KB
testcase_11 AC 45 ms
37,044 KB
testcase_12 AC 44 ms
37,020 KB
testcase_13 AC 46 ms
37,156 KB
testcase_14 AC 47 ms
36,824 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 103 ms
39,344 KB
testcase_18 AC 160 ms
41,132 KB
testcase_19 AC 172 ms
41,152 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 179 ms
41,408 KB
testcase_23 AC 101 ms
39,384 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;
			}
		}
		long[] maxs = new long[2];
		Arrays.fill(maxs, -1);
		for(int i = 0;i < n;i++){
			maxs[(int)(d[i]%2)] = Math.max(maxs[(int)(d[i]%2)], d[i]);
		}
		
		for(int i = 0;i < n;i++){
			int tar = (int)((m+d[i])%2);
			if(maxs[tar] != -1 && 
					m <= maxs[tar] + d[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