結果
問題 | No.762 PDCAパス |
ユーザー | hiromi_ayase |
提出日時 | 2018-12-10 08:48:13 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 372 ms / 2,000 ms |
コード長 | 3,632 bytes |
コンパイル時間 | 4,358 ms |
コンパイル使用メモリ | 81,972 KB |
実行使用メモリ | 65,220 KB |
最終ジャッジ日時 | 2023-10-14 22:06:36 |
合計ジャッジ時間 | 13,494 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
50,964 KB |
testcase_01 | AC | 72 ms
50,804 KB |
testcase_02 | AC | 71 ms
50,956 KB |
testcase_03 | AC | 69 ms
50,776 KB |
testcase_04 | AC | 70 ms
51,084 KB |
testcase_05 | AC | 69 ms
51,072 KB |
testcase_06 | AC | 69 ms
50,740 KB |
testcase_07 | AC | 69 ms
51,064 KB |
testcase_08 | AC | 68 ms
50,944 KB |
testcase_09 | AC | 69 ms
50,752 KB |
testcase_10 | AC | 69 ms
50,796 KB |
testcase_11 | AC | 69 ms
50,752 KB |
testcase_12 | AC | 70 ms
50,892 KB |
testcase_13 | AC | 69 ms
50,760 KB |
testcase_14 | AC | 68 ms
50,948 KB |
testcase_15 | AC | 68 ms
50,668 KB |
testcase_16 | AC | 73 ms
50,864 KB |
testcase_17 | AC | 68 ms
50,840 KB |
testcase_18 | AC | 69 ms
50,752 KB |
testcase_19 | AC | 69 ms
50,744 KB |
testcase_20 | AC | 70 ms
50,976 KB |
testcase_21 | AC | 70 ms
50,960 KB |
testcase_22 | AC | 263 ms
58,504 KB |
testcase_23 | AC | 266 ms
59,156 KB |
testcase_24 | AC | 352 ms
65,108 KB |
testcase_25 | AC | 351 ms
65,220 KB |
testcase_26 | AC | 264 ms
59,132 KB |
testcase_27 | AC | 269 ms
59,024 KB |
testcase_28 | AC | 372 ms
63,068 KB |
testcase_29 | AC | 362 ms
63,068 KB |
testcase_30 | AC | 325 ms
63,340 KB |
testcase_31 | AC | 330 ms
61,332 KB |
testcase_32 | AC | 325 ms
61,168 KB |
testcase_33 | AC | 306 ms
60,884 KB |
testcase_34 | AC | 303 ms
60,872 KB |
testcase_35 | AC | 305 ms
60,788 KB |
testcase_36 | AC | 280 ms
59,352 KB |
testcase_37 | AC | 273 ms
59,092 KB |
testcase_38 | AC | 276 ms
59,252 KB |
testcase_39 | AC | 283 ms
59,304 KB |
testcase_40 | AC | 279 ms
59,348 KB |
ソースコード
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)); } }