結果

問題 No.762 PDCAパス
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-12-10 08:48:13
言語 Java21
(openjdk 21)
結果
AC  
実行時間 376 ms / 2,000 ms
コード長 3,632 bytes
コンパイル時間 2,949 ms
コンパイル使用メモリ 94,516 KB
実行使用メモリ 54,108 KB
最終ジャッジ日時 2024-09-16 15:47:23
合計ジャッジ時間 12,018 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 73 ms
38,292 KB
testcase_01 AC 79 ms
38,292 KB
testcase_02 AC 73 ms
38,336 KB
testcase_03 AC 74 ms
38,528 KB
testcase_04 AC 76 ms
38,408 KB
testcase_05 AC 74 ms
38,232 KB
testcase_06 AC 74 ms
37,912 KB
testcase_07 AC 74 ms
38,104 KB
testcase_08 AC 76 ms
38,528 KB
testcase_09 AC 74 ms
38,104 KB
testcase_10 AC 74 ms
38,408 KB
testcase_11 AC 76 ms
38,336 KB
testcase_12 AC 75 ms
38,152 KB
testcase_13 AC 75 ms
38,232 KB
testcase_14 AC 74 ms
37,912 KB
testcase_15 AC 74 ms
38,108 KB
testcase_16 AC 79 ms
38,320 KB
testcase_17 AC 75 ms
38,104 KB
testcase_18 AC 75 ms
38,392 KB
testcase_19 AC 75 ms
38,044 KB
testcase_20 AC 76 ms
38,196 KB
testcase_21 AC 75 ms
38,120 KB
testcase_22 AC 271 ms
46,832 KB
testcase_23 AC 274 ms
47,996 KB
testcase_24 AC 355 ms
54,108 KB
testcase_25 AC 333 ms
53,952 KB
testcase_26 AC 277 ms
47,820 KB
testcase_27 AC 279 ms
48,316 KB
testcase_28 AC 376 ms
53,048 KB
testcase_29 AC 361 ms
53,000 KB
testcase_30 AC 348 ms
53,028 KB
testcase_31 AC 345 ms
53,188 KB
testcase_32 AC 345 ms
53,144 KB
testcase_33 AC 323 ms
49,540 KB
testcase_34 AC 327 ms
49,516 KB
testcase_35 AC 324 ms
49,712 KB
testcase_36 AC 294 ms
48,288 KB
testcase_37 AC 296 ms
48,048 KB
testcase_38 AC 298 ms
47,968 KB
testcase_39 AC 299 ms
48,188 KB
testcase_40 AC 291 ms
47,852 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

public class Main {


  private static void solve() {
    int n = ni();
    int m = ni();
    char[] s = ns();
    int[] from = new int[m];
    int[] to = new int[m];
    for (int i = 0; i < m; i++) {
      from[i] = ni() - 1;
      to[i] = ni() - 1;
    }
    int[][] g = packU(n, from, to);
    long[][] dp = new long[n][4];

    int mod = 1000000000 + 7;
    char[] t = {'P', 'D', 'C', 'A'};
    for (int k = 0; k < 4; k ++) {
      for (int i = 0; i < n; i++) {
        if (s[i] == t[k]) {
          if (k == 0) dp[i][k] = 1;
          else {
            for (int next : g[i]) {
              if (s[next] == t[k - 1]) {
                dp[i][k] += dp[next][k - 1];
                dp[i][k] %= mod;
              }
            }
          }
        }
      }
    }
    long ret = 0;
    for (int i = 0; i < n; i ++) {
      ret += dp[i][3];
      ret %= mod;
    }
    System.out.println(ret);

  }

  static int[][] packU(int n, int[] from, int[] to) {
    int[][] g = new int[n][];
    int[] p = new int[n];
    for (int f : from)
      p[f]++;
    for (int t : to)
      p[t]++;
    for (int i = 0; i < n; i++)
      g[i] = new int[p[i]];
    for (int i = 0; i < from.length; i++) {
      g[from[i]][--p[from[i]]] = to[i];
      g[to[i]][--p[to[i]]] = from[i];
    }
    return g;
  }

  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) {
        throw new RuntimeException(e);
      }
    }
    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