結果

問題 No.233 めぐるはめぐる (3)
ユーザー suiginginsuigingin
提出日時 2015-06-27 00:19:04
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,386 bytes
コンパイル時間 3,393 ms
コンパイル使用メモリ 80,472 KB
実行使用メモリ 71,592 KB
最終ジャッジ日時 2024-07-07 19:35:46
合計ジャッジ時間 14,089 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 677 ms
68,712 KB
testcase_01 AC 535 ms
61,624 KB
testcase_02 AC 409 ms
59,832 KB
testcase_03 AC 556 ms
67,928 KB
testcase_04 AC 712 ms
71,444 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 824 ms
71,240 KB
testcase_08 AC 814 ms
71,156 KB
testcase_09 AC 239 ms
57,408 KB
testcase_10 AC 245 ms
57,384 KB
testcase_11 AC 106 ms
40,928 KB
testcase_12 AC 546 ms
67,176 KB
testcase_13 AC 716 ms
66,852 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class Main_origin {
	MyScanner sc = new MyScanner();
	Scanner sc2 = new Scanner(System.in);
	final int MOD = 1000000007;
	int[] dx = { 1, 0, 0, -1 };
	int[] dy = { 0, 1, -1, 0 };

	String sm = "aiueo";
	// String ss = "inabameguru";
	String ss = "meguruinaba";
	int L, N;
	char[] c;
	String[] s;
	ArrayList<StringBuilder> l;
	int cnt = 0;

	void run() {
		N = sc.nextInt();
		long start = System.currentTimeMillis();
		s = new String[N];
		c = ss.toCharArray();
		L = ss.length();
		l = new ArrayList<StringBuilder>();
		used = new boolean[L];
		perm = new int[L];

		for (int i = 0; i < N; i++)
			s[i] = sc.next();
		if (N == 0) {
			System.out.println(ss);
			return;
		}
		permutation(0);
		Arrays.sort(s);

		for (int i = 0; i < l.size(); i++) {
			boolean ok = true;
			if (Arrays.binarySearch(s, l.get(i).toString()) >= 0) {
				ok = false;
			}
			if (ok) {
				System.out.println(l.get(i));
				return;
			}
		}

		System.out.println("NO");
		// System.out.println(fin - start + " ms");
	}

	boolean[] used;
	int[] perm;

	void permutation(int pos) {
		if (pos == L) {
			StringBuilder make = new StringBuilder();
			for (int i = 0; i < ss.length(); i++) {
				make.append(ss.charAt(perm[i]));
			}
			l.add(make);
		}
		for (int i = 0; i < L; i++) {
			if (!used[i]) {
				if (pos > 0) {
					char c1 = c[perm[pos - 1]];
					char c2 = c[i];
					if (sm.indexOf(c1) < 0 && sm.indexOf(c2) < 0) continue;
					if (sm.indexOf(c2) < 0 && pos == L - 1) continue;
					if (pos != L-1 && sm.indexOf(c1) >= 0 && sm.indexOf(c2) >= 0) continue;
				}
				perm[pos] = i;
				used[i] = true;
				permutation(pos + 1);
				used[i] = false;
			}
		}
	}

	public static void main(String[] args) {
		new Main_origin().run();
	}

	void debug(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}

	void debug2(char[][] array) {
		for (int i = 0; i < array.length; i++) {
			for (int j = 0; j < array[i].length; j++) {
				System.out.print(array[i][j]);
			}
			System.out.println();
		}
	}

	boolean inner(int h, int w, int limH, int limW) {
		return 0 <= h && h < limH && 0 <= w && w < limW;
	}

	void swap(int[] x, int a, int b) {
		int tmp = x[a];
		x[a] = x[b];
		x[b] = tmp;
	}

	// find minimum i (a[i] >= border)
	int lower_bound(int a[], int border) {
		int l = -1;
		int r = a.length;
		while (r - l > 1) {
			int mid = (l + r) / 2;
			if (border <= a[mid]) {
				r = mid;
			} else {
				l = mid;
			}
		}
		// r = l + 1
		return r;
	}

	boolean palindrome(String s) {
		for (int i = 0; i < s.length() / 2; i++) {
			if (s.charAt(i) != s.charAt(s.length() - 1 - i)) {
				return false;
			}
		}
		return true;
	}

	class MyScanner {
		int nextInt() {
			try {
				int c = System.in.read();
				while (c != '-' && (c < '0' || '9' < c))
					c = System.in.read();
				if (c == '-')
					return -nextInt();
				int res = 0;
				do {
					res *= 10;
					res += c - '0';
					c = System.in.read();
				} while ('0' <= c && c <= '9');
				return res;
			} catch (Exception e) {
				return -1;
			}
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		String next() {
			try {
				StringBuilder res = new StringBuilder("");
				int c = System.in.read();
				while (Character.isWhitespace(c))
					c = System.in.read();
				do {
					res.append((char) c);
				} while (!Character.isWhitespace(c = System.in.read()));
				return res.toString();
			} catch (Exception e) {
				return null;
			}
		}

		int[] nextIntArray(int n) {
			int[] in = new int[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextInt();
			}
			return in;
		}

		int[][] nextInt2dArray(int n, int m) {
			int[][] in = new int[n][m];
			for (int i = 0; i < n; i++) {
				in[i] = nextIntArray(m);
			}
			return in;
		}

		double[] nextDoubleArray(int n) {
			double[] in = new double[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextDouble();
			}
			return in;
		}

		long[] nextLongArray(int n) {
			long[] in = new long[n];
			for (int i = 0; i < n; i++) {
				in[i] = nextLong();
			}
			return in;
		}

		char[][] nextCharField(int n, int m) {
			char[][] in = new char[n][m];
			for (int i = 0; i < n; i++) {
				String s = sc.next();
				for (int j = 0; j < m; j++) {
					in[i][j] = s.charAt(j);
				}
			}
			return in;
		}
	}
}
0