#23162 (Java21) No.197 手品

提出ソース

結果

問題	No.197 手品
ユーザー	uwi
提出日時	2015-04-29 00:02:43
言語	Java21 (openjdk 21)
結果	AC
実行時間	50 ms / 1,000 ms
コード長	3,908 bytes
コンパイル時間	3,512 ms
コンパイル使用メモリ	83,136 KB
実行使用メモリ	36,972 KB
最終ジャッジ日時	2024-07-20 03:35:45
合計ジャッジ時間	6,799 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	48 ms 36,640 KB
testcase_01	AC	50 ms 36,540 KB
testcase_02	AC	48 ms 36,852 KB
testcase_03	AC	45 ms 36,564 KB
testcase_04	AC	46 ms 36,656 KB
testcase_05	AC	47 ms 36,568 KB
testcase_06	AC	46 ms 36,468 KB
testcase_07	AC	47 ms 36,668 KB
testcase_08	AC	46 ms 36,904 KB
testcase_09	AC	46 ms 36,928 KB
testcase_10	AC	46 ms 36,648 KB
testcase_11	AC	48 ms 36,956 KB
testcase_12	AC	46 ms 36,904 KB
testcase_13	AC	44 ms 36,304 KB
testcase_14	AC	46 ms 36,456 KB
testcase_15	AC	46 ms 36,728 KB
testcase_16	AC	45 ms 36,632 KB
testcase_17	AC	46 ms 36,844 KB
testcase_18	AC	48 ms 36,904 KB
testcase_19	AC	46 ms 36,872 KB
testcase_20	AC	46 ms 36,972 KB
testcase_21	AC	45 ms 36,640 KB
testcase_22	AC	44 ms 36,696 KB
testcase_23	AC	46 ms 36,340 KB
testcase_24	AC	45 ms 36,856 KB
testcase_25	AC	45 ms 36,624 KB
testcase_26	AC	47 ms 36,664 KB
testcase_27	AC	45 ms 36,344 KB
testcase_28	AC	47 ms 36,660 KB
testcase_29	AC	45 ms 36,924 KB
testcase_30	AC	44 ms 36,740 KB
testcase_31	AC	46 ms 36,736 KB
testcase_32	AC	45 ms 36,216 KB
testcase_33	AC	46 ms 36,856 KB
testcase_34	AC	46 ms 36,552 KB
testcase_35	AC	45 ms 36,436 KB
testcase_36	AC	46 ms 36,672 KB
testcase_37	AC	48 ms 36,452 KB
testcase_38	AC	46 ms 36,856 KB
testcase_39	AC	47 ms 36,904 KB
testcase_40	AC	47 ms 36,676 KB
testcase_41	AC	45 ms 36,848 KB
testcase_42	AC	45 ms 36,456 KB
testcase_43	AC	46 ms 36,628 KB
testcase_44	AC	45 ms 36,876 KB
testcase_45	AC	44 ms 36,596 KB
testcase_46	AC	44 ms 36,844 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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 Q432 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		String F = "FAILURE";
		String S = "SUCCESS";
		char[] s = ns(3);
		int n = ni();
		char[] t = ns(3);
		// 012:0
		// 021:1
		// 120:2
		int[] ord = new int[3];
		for(int i = 0;i < 3;i++)ord[i] = i;
		inner:
		do{
			int[] u = Arrays.copyOf(ord, 3);
			int flip = 0;
			outer:
			while(true){
				for(int i = 0;i < 3;i++){
					for(int j = i+1;j < 3;j++){
						if(u[j] == i){
							int d = u[j-1]; u[j-1] = u[j]; u[j] = d;
							flip++;
							continue outer;
						}
					}
				}
				break;
			}
			if(n-flip >= 0 && (n-flip) % 2 == 0){
				for(int i = 0;i < 3;i++){
					if(t[ord[i]] != s[i])continue inner;
				}
				out.println(F);
				return;
			}
		}while(nextPermutation(ord));
		out.println(S);
	}
	
	static boolean nextPermutation(int[] src) {
		int i;
		for (i = src.length - 2; i >= 0 && src[i] > src[i + 1]; i--)
			;
		if (i == -1)
			return false;
		int j;
		for (j = i + 1; j < src.length && src[i] < src[j]; j++)
			;
		int d = src[i];
		src[i] = src[j - 1];
		src[j - 1] = d;
		for (int p = i + 1, q = src.length - 1; p < q; p++, q--) {
			d = src[p];
			src[p] = src[q];
			src[q] = d;
		}
		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 Q432().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)); }
}

yukicoder

結果

テストケース

ソースコード