結果

問題 No.517 壊れたアクセサリー
ユーザー uwiuwi
提出日時 2017-05-28 21:27:35
言語 Java21
(openjdk 21)
結果
AC  
実行時間 53 ms / 2,000 ms
コード長 4,795 bytes
コンパイル時間 6,549 ms
コンパイル使用メモリ 80,432 KB
実行使用メモリ 53,344 KB
最終ジャッジ日時 2023-10-21 14:02:48
合計ジャッジ時間 5,675 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
53,320 KB
testcase_01 AC 50 ms
52,244 KB
testcase_02 AC 51 ms
53,308 KB
testcase_03 AC 52 ms
53,316 KB
testcase_04 AC 50 ms
53,312 KB
testcase_05 AC 48 ms
52,240 KB
testcase_06 AC 48 ms
53,312 KB
testcase_07 AC 49 ms
53,320 KB
testcase_08 AC 52 ms
53,308 KB
testcase_09 AC 53 ms
53,316 KB
testcase_10 AC 52 ms
53,312 KB
testcase_11 AC 52 ms
52,268 KB
testcase_12 AC 51 ms
53,320 KB
testcase_13 AC 52 ms
53,312 KB
testcase_14 AC 53 ms
52,268 KB
testcase_15 AC 52 ms
52,252 KB
testcase_16 AC 51 ms
53,344 KB
testcase_17 AC 51 ms
52,228 KB
testcase_18 AC 51 ms
51,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest170528;
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 B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		boolean[][] g = new boolean[26][26];
		DJSet ds = new DJSet(26);
		boolean[] ap = new boolean[26];
		for(int i = 0;i < n;i++){
			char[] s = ns().toCharArray();
			for(int j = 0;j < s.length;j++){
				ap[s[j]-'A'] = true;
			}
			for(int j = 0;j < s.length-1;j++){
				g[s[j]-'A'][s[j+1]-'A'] = true;
				ds.union(s[j]-'A', s[j+1]-'A');
			}
		}
		int m = ni();
		for(int i = 0;i < m;i++){
			char[] s = ns().toCharArray();
			for(int j = 0;j < s.length-1;j++){
				g[s[j]-'A'][s[j+1]-'A'] = true;
				ds.union(s[j]-'A', s[j+1]-'A');
			}
		}
		int root = -1;
		for(int i = 0;i < 26;i++){
			if(ap[i]){
				if(root == -1){
					root = ds.root(i);
				}else if(root != ds.root(i)){
					out.println("-1");
					return;
				}
			}
		}
		inner:
		for(int i = 0;i < 26;i++){
			if(ap[i]){
				for(int j = 0;j < 26;j++){
					if(g[j][i])continue inner;
				}
				int cur = i;
				middle:
				while(true){
					out.print((char)('A'+cur));
					for(int j = 0;j < 26;j++){
						if(g[cur][j]){
							cur = j;
							continue middle;
						}
					}
					out.println();
					break;
				}
				return;
			}
		}
		out.println(-1);
	}
	
	public static class DJSet {
		public int[] upper;

		public DJSet(int n) {
			upper = new int[n];
			Arrays.fill(upper, -1);
		}

		public int root(int x) {
			return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
		}

		public boolean equiv(int x, int y) {
			return root(x) == root(y);
		}

		public boolean union(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (upper[y] < upper[x]) {
					int d = x;
					x = y;
					y = d;
				}
				upper[x] += upper[y];
				upper[y] = x;
			}
			return x == y;
		}

		public int count() {
			int ct = 0;
			for (int u : upper)
				if (u < 0)
					ct++;
			return ct;
		}
	}

	
	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");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new B().run(); }
	
	private byte[] inbuf = new byte[1024];
	public 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	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[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	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