結果

問題 No.517 壊れたアクセサリー
ユーザー hiromi_ayase
提出日時 2017-05-30 14:52:09
言語 Java
(openjdk 23)
結果
AC  
実行時間 59 ms / 2,000 ms
コード長 4,160 bytes
コンパイル時間 2,284 ms
コンパイル使用メモリ 77,936 KB
実行使用メモリ 50,096 KB
最終ジャッジ日時 2024-09-21 19:19:06
合計ジャッジ時間 4,108 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.NoSuchElementException;
public class Main {
  public static void main(String[] args) {
    FastScanner sc = new FastScanner();
    int N = sc.nextInt();
    String[] A = new String[N];
    int len = 0;
    for (int i = 0; i < N; i ++) {
      A[i] = sc.next();
      len += A[i].length();
    }
    int M = sc.nextInt();
    String[] B = new String[M];
    for (int i = 0; i < M; i ++) {
      B[i] = sc.next();
    }
    
    if (len == 1) {
      if (A[0].equals(B[0])) {
        System.out.println(A[0]);
      } else {
        System.out.println(-1);
      }
      return;
    }
    int[] tree = new int[26];
    Arrays.fill(tree, -1);
    for (int i = 0; i < N; i ++) {
      for (int j = 1; j < A[i].length(); j ++) {
        tree[A[i].charAt(j - 1) - 'A'] = A[i].charAt(j) - 'A';
      }
    }
    
    for (int i = 0; i < M; i ++) {
      for (int j = 1; j < B[i].length(); j ++) {
        tree[B[i].charAt(j - 1) - 'A'] = B[i].charAt(j) - 'A';
      }
    }
    
    for (int i = 0; i < 26; i ++) {
      StringBuilder sb = new StringBuilder();
      int now = i;
      sb.append((char)(now + 'A'));
      while (tree[now] >= 0) {
        now = tree[now];
        sb.append((char)(now + 'A'));
      }
      if (sb.length() == len) {
        System.out.println(sb);
        return;
      }
    }
    System.out.println(-1);
  }
}
class FastScanner {
  public static String debug = null;
  private final InputStream in = System.in;
  private int ptr = 0;
  private int buflen = 0;
  private byte[] buffer = new byte[1024];
  private boolean eos = false;
  private boolean hasNextByte() {
    if (ptr < buflen) {
      return true;
    } else {
      ptr = 0;
      try {
        if (debug != null) {
          buflen = debug.length();
          buffer = debug.getBytes();
          debug = "";
          eos = true;
        } else {
          buflen = in.read(buffer);
        }
      } catch (IOException e) {
        e.printStackTrace();
      }
      if (buflen < 0) {
        eos = true;
        return false;
      } else if (buflen == 0) {
        return false;
      }
    }
    return true;
  }
  private int readByte() {
    if (hasNextByte())
      return buffer[ptr++];
    else
      return -1;
  }
  private static boolean isPrintableChar(int c) {
    return 33 <= c && c <= 126;
  }
  private void skipUnprintable() {
    while (hasNextByte() && !isPrintableChar(buffer[ptr]))
      ptr++;
  }
  public boolean isEOS() {
    return this.eos;
  }
  public boolean hasNext() {
    skipUnprintable();
    return hasNextByte();
  }
  public String next() {
    if (!hasNext())
      throw new NoSuchElementException();
    StringBuilder sb = new StringBuilder();
    int b = readByte();
    while (isPrintableChar(b)) {
      sb.appendCodePoint(b);
      b = readByte();
    }
    return sb.toString();
  }
  public long nextLong() {
    if (!hasNext())
      throw new NoSuchElementException();
    long n = 0;
    boolean minus = false;
    int b = readByte();
    if (b == '-') {
      minus = true;
      b = readByte();
    }
    if (b < '0' || '9' < b) {
      throw new NumberFormatException();
    }
    while (true) {
      if ('0' <= b && b <= '9') {
        n *= 10;
        n += b - '0';
      } else if (b == -1 || !isPrintableChar(b)) {
        return minus ? -n : n;
      } else {
        throw new NumberFormatException();
      }
      b = readByte();
    }
  }
  public int nextInt() {
    return (int) nextLong();
  }
  public long[] nextLongList(int n) {
    return nextLongTable(1, n)[0];
  }
  public int[] nextIntList(int n) {
    return nextIntTable(1, n)[0];
  }
  public long[][] nextLongTable(int n, int m) {
    long[][] ret = new long[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        ret[i][j] = nextLong();
      }
    }
    return ret;
  }
  public int[][] nextIntTable(int n, int m) {
    int[][] ret = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        ret[i][j] = nextInt();
      }
    }
    return ret;
  }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0