結果

問題 No.233 めぐるはめぐる (3)
ユーザー threepipes_sthreepipes_s
提出日時 2015-06-26 23:42:14
言語 Java21
(openjdk 21)
結果
AC  
実行時間 945 ms / 1,000 ms
コード長 4,090 bytes
コンパイル時間 2,202 ms
コンパイル使用メモリ 83,540 KB
実行使用メモリ 71,316 KB
最終ジャッジ日時 2024-07-07 18:36:46
合計ジャッジ時間 9,720 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 277 ms
55,072 KB
testcase_01 AC 217 ms
51,072 KB
testcase_02 AC 166 ms
45,704 KB
testcase_03 AC 223 ms
51,980 KB
testcase_04 AC 842 ms
64,612 KB
testcase_05 AC 739 ms
64,392 KB
testcase_06 AC 800 ms
64,520 KB
testcase_07 AC 945 ms
71,316 KB
testcase_08 AC 890 ms
64,956 KB
testcase_09 AC 43 ms
37,048 KB
testcase_10 AC 42 ms
37,284 KB
testcase_11 AC 41 ms
36,884 KB
testcase_12 AC 209 ms
51,288 KB
testcase_13 AC 274 ms
55,912 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;

public class Main {
	static HashSet<String> set = new HashSet<String>();
	static char[] ch = {'n', 'b', 'r', 'm', 'g'};
	static char[] mo = {'i', 'a', 'e', 'a', 'u', 'u'};
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		int n = in.nextInt();
		for(int i=0; i<n; i++){
			String s = in.nextToken();
			set.add(s);
		}
		if(!dfsCH(0, pc, 0)){
			System.out.println("NO");
		}else{
			System.out.println(res);
		}
	}
	
	static String res = null;
	static int[] pc = new int[5];
	static int[] pm = new int[6];
	static boolean dfsCH(int dpt, int[] p, int used){
		if(dpt == 5){
			if(dfsM(0, pm, 0)) return true;
			return false;
		}
		for(int i=0; i<5; i++){
			if((used&1<<i)>0) continue;
			p[dpt] = i;
			if(dfsCH(dpt+1, p, used|1<<i)) return true;
		}
		return false;
	}
	
	static boolean dfsM(int dpt, int[] p, int used){
		if(dpt == 6){
			if(make()) return true;
			return false;
		}
		for(int i=0; i<6; i++){
			if((used&1<<i)>0) continue;
			p[dpt] = i;
			if(dfsM(dpt+1, p, used|1<<i)) return true;
		}
		return false;
	}
	
	static boolean make(){
		List<Character> list = new LinkedList<Character>();
		for(int i=0; i<5; i++){
			list.add(ch[pc[i]]);
			list.add(mo[pm[i]]);
		}
		int size = list.size();
		for(int i=0; i<size; i++){
			list.add(i, mo[pm[5]]);
			StringBuilder sb = new StringBuilder();
			for(char c: list) sb.append(c);
			if(!set.contains(sb.toString())){
				res = sb.toString();
				return true;
			}
			list.remove(i);
		}
		return false;
	}
}

class Timer{
	long time;
	public void set(){
		time = System.currentTimeMillis();
	}
	
	public long stop(){
		return System.currentTimeMillis()-time;
	}
}

class Node{
	int id;
	ArrayList<Node> edge = new ArrayList<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
}

class MyComp implements Comparator<int[]> {
	final int idx;
	public MyComp(int idx){
		this.idx = idx;
	}
	public int compare(int[] a, int[] b) {
		return a[idx] - b[idx];
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}


class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}
	
	public void println(Object obj) {
		out.println(obj);
	}

	public void print(String str) {
		out.print(str);
	}
	
	public void print(Object obj) {
		out.print(obj);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}
	
	public String readLine() throws IOException{
		return reader.readLine();
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}
0