結果

問題 No.359 門松行列
ユーザー uwiuwi
提出日時 2016-03-24 02:41:13
言語 Java21
(openjdk 21)
結果
AC  
実行時間 73 ms / 2,000 ms
コード長 4,200 bytes
コンパイル時間 4,381 ms
コンパイル使用メモリ 89,740 KB
実行使用メモリ 50,708 KB
最終ジャッジ日時 2024-10-01 21:45:53
合計ジャッジ時間 5,891 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
50,480 KB
testcase_01 AC 53 ms
50,360 KB
testcase_02 AC 52 ms
50,328 KB
testcase_03 AC 58 ms
50,380 KB
testcase_04 AC 54 ms
50,324 KB
testcase_05 AC 59 ms
50,336 KB
testcase_06 AC 54 ms
50,428 KB
testcase_07 AC 59 ms
50,456 KB
testcase_08 AC 72 ms
50,484 KB
testcase_09 AC 65 ms
50,560 KB
testcase_10 AC 63 ms
50,568 KB
testcase_11 AC 73 ms
50,232 KB
testcase_12 AC 65 ms
50,168 KB
testcase_13 AC 66 ms
50,448 KB
testcase_14 AC 63 ms
50,392 KB
testcase_15 AC 63 ms
50,540 KB
testcase_16 AC 68 ms
50,708 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.List;

public class Q940_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		for(int T = ni();T > 0;T--){
			if(!(T <= 100))throw new AssertionError();
			int L = ni();
			if(!(1 <= L))throw new AssertionError();
			if(!(L <= 1000000000))throw new AssertionError();
			int[] a = na(9);
			for(int i = 0;i < 9;i++){
				if(!(0 <= a[i]))throw new AssertionError();
				if(!(a[i] <= 1000000000))throw new AssertionError();
			}
			int[][] inds = {
					{0,1,2},{3,4,5},{6,7,8},
					{0,3,6},{1,4,7},{2,5,8},
					{0,4,8},{2,4,6}
			};
			List<Integer> st = new ArrayList<>();
			st.add(L/2);
			st.add(L/2+1);
			st.add(1);
			st.add(L);
			for(int i = 0;i < 9;i++){
				if(a[i] != 0){
					st.add(a[i]);
					st.add(a[i]+1);
					st.add(L-a[i]);
					st.add(L-a[i]+1);
				}
			}
			
			int[] pos = new int[2];
			int p = 0;
			for(int i = 0;i < 9;i++){
				if(a[i] == 0){
					pos[p++] = i;
				}
			}
			if(!(p == 2))throw new AssertionError();
			Collections.sort(st);
			int ret = 0;
			outer:
			for(int u = 0;u < st.size()-1;u++){
				a[pos[0]] = st.get(u);
				a[pos[1]] = L-st.get(u);
				for(int[] ind : inds){
					if(!ok(a[ind[0]], a[ind[1]], a[ind[2]])){
						continue outer;
					}
				}
				ret += st.get(u+1)-st.get(u);
			}
			out.println(ret);
		}
	}
	
	boolean ok(int a, int b, int c){
//	{
		return a > 0 && b > 0 && c > 0 && a != b && b != c && c != a && (a < b && b > c || a > b && b < c);
	}
	
	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 Q940_2().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