結果

問題 No.3061 uxs hxixtya pyuyn ixc hyixa kxuyn
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-04-01 22:24:16
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,393 bytes
コンパイル時間 2,642 ms
コンパイル使用メモリ 89,616 KB
実行使用メモリ 39,716 KB
最終ジャッジ日時 2024-06-27 11:34:48
合計ジャッジ時間 5,020 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 73 ms
38,100 KB
testcase_01 AC 73 ms
37,972 KB
testcase_02 AC 72 ms
38,048 KB
testcase_03 AC 73 ms
37,972 KB
testcase_04 AC 74 ms
38,068 KB
testcase_05 AC 99 ms
39,348 KB
testcase_06 AC 96 ms
39,716 KB
testcase_07 AC 76 ms
38,160 KB
testcase_08 AC 75 ms
38,048 KB
testcase_09 AC 75 ms
38,352 KB
testcase_10 AC 76 ms
37,948 KB
testcase_11 AC 75 ms
38,092 KB
testcase_12 AC 77 ms
38,144 KB
testcase_13 WA -
testcase_14 AC 75 ms
37,948 KB
testcase_15 WA -
testcase_16 AC 74 ms
38,408 KB
testcase_17 AC 75 ms
38,344 KB
testcase_18 AC 75 ms
37,968 KB
testcase_19 AC 74 ms
38,196 KB
testcase_20 AC 73 ms
38,176 KB
testcase_21 AC 73 ms
38,380 KB
testcase_22 AC 75 ms
38,364 KB
testcase_23 AC 75 ms
38,144 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;

public class Main {

  private static void solve() {
    char[] s;
    try {
      s = reader.readLine().toCharArray();
    } catch (IOException e) {
      throw new RuntimeException();
    }

    int n = s.length;
    for (int l = 0; l < n; l++) {
      outer: for (int r = l + 2; r <= n; r++) {

        int rem = 0;
        for (int i = 0; i < l; i++) {
          if (s[i] == ' ')
            continue;
          rem |= 1 << (s[i] - 'a');
        }
        for (int i = r; i < n; i++) {
          if (s[i] == ' ')
            continue;
          rem |= 1 << (s[i] - 'a');
        }
        for (int i = l + 1; i < r; i += 2) {
          if (s[i] == ' ')
            continue;
          rem |= 1 << (s[i] - 'a');
        }

        for (int i = l; i < r; i += 2) {
          if (s[i] == ' ')
            continue outer;
          int b = 1 << (s[i] - 'a');
          if ((rem & b) != 0) {
            continue outer;
          }
        }

        System.out.println("Yes");
        return;
      }
    }
    System.out.println("NO");

  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        return "";
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0