結果

問題 No.334 門松ゲーム
ユーザー uwiuwi
提出日時 2016-01-15 22:36:36
言語 Java21
(openjdk 21)
結果
AC  
実行時間 118 ms / 2,000 ms
コード長 3,574 bytes
コンパイル時間 4,158 ms
コンパイル使用メモリ 87,328 KB
実行使用メモリ 40,364 KB
最終ジャッジ日時 2024-09-19 19:10:25
合計ジャッジ時間 5,587 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 80 ms
40,124 KB
testcase_01 AC 50 ms
36,652 KB
testcase_02 AC 61 ms
37,316 KB
testcase_03 AC 84 ms
39,832 KB
testcase_04 AC 91 ms
38,188 KB
testcase_05 AC 88 ms
39,976 KB
testcase_06 AC 94 ms
39,736 KB
testcase_07 AC 54 ms
36,684 KB
testcase_08 AC 91 ms
40,128 KB
testcase_09 AC 74 ms
37,452 KB
testcase_10 AC 76 ms
37,792 KB
testcase_11 AC 115 ms
39,992 KB
testcase_12 AC 114 ms
40,364 KB
testcase_13 AC 113 ms
39,992 KB
testcase_14 AC 80 ms
37,608 KB
testcase_15 AC 118 ms
39,980 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

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 Q930 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		boolean[] win = new boolean[1<<n];
		int[] last = null;
		outer:
		for(int i = 0;i < 1<<n;i++){
			for(int j = 0;j < n;j++){
				for(int k = j+1;k < n;k++){
					for(int l = k+1;l < n;l++){
						if(i<<~j<0 && i<<~k<0 && i<<~l<0 && kd(a[j], a[k], a[l])){
							int pre = i^1<<j^1<<k^1<<l;
							if(!win[pre]){
								if(i == (1<<n)-1){
									last = new int[]{j, k, l};
								}
								win[i] = true;
								continue outer;
							}
						}
					}
				}
			}
		}
		if(last != null){
			out.println((last[0]) + " " + (last[1]) + " " + (last[2]));
		}else{
			out.println(-1);
		}
	}
	
	boolean kd(int a, int b, int c)
	{
		if(a == b || b == c || c == a)return false;
		if(a < b && b < c)return false;
		if(c < b && b < a)return false;
		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 Q930().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)); }
}
0