結果

問題 No.233 めぐるはめぐる (3)
ユーザー uwiuwi
提出日時 2015-06-27 01:08:04
言語 Java21
(openjdk 21)
結果
AC  
実行時間 588 ms / 1,000 ms
コード長 3,915 bytes
コンパイル時間 4,157 ms
コンパイル使用メモリ 81,092 KB
実行使用メモリ 76,596 KB
最終ジャッジ日時 2023-09-22 03:01:18
合計ジャッジ時間 10,379 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 228 ms
65,660 KB
testcase_01 AC 156 ms
59,600 KB
testcase_02 AC 127 ms
57,176 KB
testcase_03 AC 176 ms
61,552 KB
testcase_04 AC 528 ms
76,104 KB
testcase_05 AC 509 ms
76,184 KB
testcase_06 AC 381 ms
73,136 KB
testcase_07 AC 573 ms
76,596 KB
testcase_08 AC 588 ms
76,364 KB
testcase_09 AC 40 ms
49,172 KB
testcase_10 AC 39 ms
49,116 KB
testcase_11 AC 39 ms
49,000 KB
testcase_12 AC 157 ms
59,576 KB
testcase_13 AC 232 ms
65,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q5xx;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Set;

public class Q537 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		Set<String> set = new HashSet<String>();
		for(int i = 0;i < n;i++){
			set.add(ns());
		}
		// iaaeuu
		// nbmgr
		char[] V = "iaaeuu".toCharArray();
		char[] C = ".nbmgr".toCharArray();
		int[] a = new int[6];
		for(int i = 0;i < 6;i++)a[i] = i;
		char[] s = new char[11];
		do{
			int[] b = new int[6];
			for(int i = 0;i < 6;i++)b[i] = i;
			do{
				int p = 0;
				for(int i = 0;i < 6;i++){
					if(C[b[i]] != '.'){
						s[p++] = C[b[i]];
					}
					s[p++] = V[a[i]];
				}
				if(!set.contains(new String(s))){
					out.println(new String(s));
					return;
				}
			}while(nextPermutation(b));
		}while(nextPermutation(a));
		out.println("NO");
	}
	
	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 Q537().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