結果
問題 | No.762 PDCAパス |
ユーザー | uwi |
提出日時 | 2018-12-10 00:03:02 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 164 ms / 2,000 ms |
コード長 | 3,983 bytes |
コンパイル時間 | 3,760 ms |
コンパイル使用メモリ | 81,212 KB |
実行使用メモリ | 48,148 KB |
最終ジャッジ日時 | 2024-09-16 15:40:12 |
合計ジャッジ時間 | 9,701 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,672 KB |
testcase_01 | AC | 51 ms
37,088 KB |
testcase_02 | AC | 51 ms
36,788 KB |
testcase_03 | AC | 51 ms
36,464 KB |
testcase_04 | AC | 51 ms
36,964 KB |
testcase_05 | AC | 53 ms
36,832 KB |
testcase_06 | AC | 52 ms
37,108 KB |
testcase_07 | AC | 51 ms
36,832 KB |
testcase_08 | AC | 51 ms
36,708 KB |
testcase_09 | AC | 53 ms
36,488 KB |
testcase_10 | AC | 50 ms
36,780 KB |
testcase_11 | AC | 51 ms
36,876 KB |
testcase_12 | AC | 52 ms
37,092 KB |
testcase_13 | AC | 52 ms
36,956 KB |
testcase_14 | AC | 51 ms
36,832 KB |
testcase_15 | AC | 52 ms
36,928 KB |
testcase_16 | AC | 52 ms
36,508 KB |
testcase_17 | AC | 52 ms
36,836 KB |
testcase_18 | AC | 52 ms
36,508 KB |
testcase_19 | AC | 52 ms
36,504 KB |
testcase_20 | AC | 51 ms
36,508 KB |
testcase_21 | AC | 52 ms
36,856 KB |
testcase_22 | AC | 124 ms
40,556 KB |
testcase_23 | AC | 120 ms
40,264 KB |
testcase_24 | AC | 164 ms
46,452 KB |
testcase_25 | AC | 148 ms
46,516 KB |
testcase_26 | AC | 120 ms
40,484 KB |
testcase_27 | AC | 118 ms
40,464 KB |
testcase_28 | AC | 157 ms
48,116 KB |
testcase_29 | AC | 138 ms
48,148 KB |
testcase_30 | AC | 154 ms
46,272 KB |
testcase_31 | AC | 160 ms
46,520 KB |
testcase_32 | AC | 152 ms
46,780 KB |
testcase_33 | AC | 144 ms
45,292 KB |
testcase_34 | AC | 143 ms
45,264 KB |
testcase_35 | AC | 146 ms
45,592 KB |
testcase_36 | AC | 134 ms
41,392 KB |
testcase_37 | AC | 121 ms
41,600 KB |
testcase_38 | AC | 133 ms
41,336 KB |
testcase_39 | AC | 124 ms
41,780 KB |
testcase_40 | AC | 131 ms
41,160 KB |
ソースコード
package adv2018; 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 Day7 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), m = ni(); char[] s = ns(n); 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); int mod = 1000000007; long[] dp = new long[n]; for(int i = 0;i < n;i++){ if(s[i] == 'P')dp[i] = 1; } for(char c : "DCA".toCharArray()){ long[] ndp = new long[n]; for(int i = 0;i <n;i++){ if(s[i] == c){ for(int e : g[i]){ ndp[i] += dp[e]; } ndp[i] %= mod; } } dp = ndp; } long ans = 0; for(long v : dp)ans += v; out.println(ans%mod); } 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; } 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 Day7().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)); } }