結果
問題 | No.762 PDCAパス |
ユーザー | Pump0129 |
提出日時 | 2018-12-11 01:50:27 |
言語 | Java21 (openjdk 21) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,497 bytes |
コンパイル時間 | 3,872 ms |
コンパイル使用メモリ | 81,028 KB |
実行使用メモリ | 90,656 KB |
最終ジャッジ日時 | 2023-10-14 22:21:06 |
合計ジャッジ時間 | 12,737 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 126 ms
60,160 KB |
testcase_01 | AC | 126 ms
55,880 KB |
testcase_02 | AC | 127 ms
55,720 KB |
testcase_03 | AC | 126 ms
55,784 KB |
testcase_04 | AC | 126 ms
55,588 KB |
testcase_05 | AC | 128 ms
55,628 KB |
testcase_06 | AC | 127 ms
55,620 KB |
testcase_07 | AC | 127 ms
56,156 KB |
testcase_08 | AC | 126 ms
55,944 KB |
testcase_09 | AC | 127 ms
55,840 KB |
testcase_10 | AC | 128 ms
55,764 KB |
testcase_11 | AC | 126 ms
55,572 KB |
testcase_12 | AC | 127 ms
55,568 KB |
testcase_13 | AC | 126 ms
55,592 KB |
testcase_14 | AC | 127 ms
55,888 KB |
testcase_15 | AC | 126 ms
55,752 KB |
testcase_16 | AC | 130 ms
56,156 KB |
testcase_17 | AC | 125 ms
55,652 KB |
testcase_18 | AC | 129 ms
55,676 KB |
testcase_19 | AC | 129 ms
56,064 KB |
testcase_20 | AC | 127 ms
55,540 KB |
testcase_21 | AC | 128 ms
56,048 KB |
testcase_22 | AC | 689 ms
66,260 KB |
testcase_23 | AC | 687 ms
63,816 KB |
testcase_24 | TLE | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
testcase_40 | -- | - |
ソースコード
package net.ipipip0129.yukicoder.no762; import java.util.ArrayList; import java.util.List; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(System.in); String[] split_str = scan.nextLine().split(" "); int leaf_num = Integer.parseInt(split_str[0]); int pass_num = Integer.parseInt(split_str[1]); PDCALeaf[] pdcaLeaves = new PDCALeaf[leaf_num]; String pdca_str = scan.nextLine(); for (int i = 0; i < leaf_num; i++) { switch (pdca_str.charAt(i)) { case 'P': pdcaLeaves[i] = new PDCALeaf(PDCA.Plan, 0); break; case 'D': pdcaLeaves[i] = new PDCALeaf(PDCA.Do, 0); break; case 'C': pdcaLeaves[i] = new PDCALeaf(PDCA.Check, 0); break; case 'A': pdcaLeaves[i] = new PDCALeaf(PDCA.Act, 1); break; } } for (int i = 0; i < pass_num; i++) { split_str = scan.nextLine().split(" "); int a_num = Integer.parseInt(split_str[0]) - 1; int b_num = Integer.parseInt(split_str[1]) - 1; PDCA a_type = pdcaLeaves[a_num].getType(); PDCA b_type = pdcaLeaves[b_num].getType(); if ((a_type == PDCA.Act && b_type == PDCA.Check) || (a_type == PDCA.Check && b_type == PDCA.Do) || (a_type == PDCA.Do && b_type == PDCA.Plan)) { pdcaLeaves[b_num].addLeaf(a_num); } else if ((a_type == PDCA.Check && b_type == PDCA.Act) || (a_type == PDCA.Do && b_type == PDCA.Check) || (a_type == PDCA.Plan && b_type == PDCA.Do)) { pdcaLeaves[a_num].addLeaf(b_num); } } PDCA[] check_array = new PDCA[] {PDCA.Check, PDCA.Do, PDCA.Plan}; for (int j = 0; j < 3; j++) { for (int i = 0; i < leaf_num; i++) { if (pdcaLeaves[i].getType() == check_array[j]) { long leaf_weight = pdcaLeaves[i].getWeight(); for (int leaf : pdcaLeaves[i].getLeaf_list()) { leaf_weight += pdcaLeaves[leaf].getWeight(); } pdcaLeaves[i].setWeight(leaf_weight); } } } long ans = 0; for (int i = 0; i < leaf_num; i++) { if (pdcaLeaves[i].getType() == PDCA.Plan) { ans += pdcaLeaves[i].getWeight(); } } System.out.println(ans % 1000000007); scan.close(); } } class PDCALeaf { PDCA type_pdca; long weight; List<Integer> leaf_list; PDCALeaf(PDCA type, int weight) { this.type_pdca = type; this.weight = weight; this.leaf_list = new ArrayList<>(); } void addLeaf(int leaf_num) { leaf_list.add(leaf_num); } PDCA getType() { return type_pdca; } List<Integer> getLeaf_list() { return leaf_list; } long getWeight() { return weight; } public void setWeight(long weight) { this.weight = weight; } } enum PDCA { Plan, Do, Check, Act }