結果
問題 | No.2277 Honest or Dishonest ? |
ユーザー | magsta |
提出日時 | 2023-04-20 09:31:48 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 155 ms / 2,000 ms |
コード長 | 5,194 bytes |
コンパイル時間 | 1,097 ms |
コンパイル使用メモリ | 75,444 KB |
実行使用メモリ | 21,004 KB |
最終ジャッジ日時 | 2024-04-25 18:47:20 |
合計ジャッジ時間 | 6,408 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 116 ms
15,360 KB |
testcase_04 | AC | 119 ms
18,176 KB |
testcase_05 | AC | 35 ms
12,672 KB |
testcase_06 | AC | 91 ms
11,648 KB |
testcase_07 | AC | 79 ms
12,160 KB |
testcase_08 | AC | 30 ms
13,440 KB |
testcase_09 | AC | 72 ms
13,824 KB |
testcase_10 | AC | 54 ms
8,704 KB |
testcase_11 | AC | 25 ms
6,940 KB |
testcase_12 | AC | 40 ms
6,944 KB |
testcase_13 | AC | 105 ms
13,440 KB |
testcase_14 | AC | 47 ms
6,944 KB |
testcase_15 | AC | 31 ms
11,136 KB |
testcase_16 | AC | 73 ms
11,520 KB |
testcase_17 | AC | 34 ms
7,296 KB |
testcase_18 | AC | 112 ms
17,792 KB |
testcase_19 | AC | 115 ms
17,664 KB |
testcase_20 | AC | 87 ms
14,336 KB |
testcase_21 | AC | 66 ms
8,448 KB |
testcase_22 | AC | 72 ms
12,672 KB |
testcase_23 | AC | 89 ms
8,832 KB |
testcase_24 | AC | 63 ms
12,288 KB |
testcase_25 | AC | 80 ms
15,616 KB |
testcase_26 | AC | 19 ms
12,672 KB |
testcase_27 | AC | 46 ms
7,168 KB |
testcase_28 | AC | 33 ms
10,752 KB |
testcase_29 | AC | 55 ms
13,056 KB |
testcase_30 | AC | 46 ms
8,576 KB |
testcase_31 | AC | 82 ms
12,928 KB |
testcase_32 | AC | 45 ms
12,416 KB |
testcase_33 | AC | 116 ms
17,152 KB |
testcase_34 | AC | 124 ms
16,384 KB |
testcase_35 | AC | 11 ms
8,832 KB |
testcase_36 | AC | 68 ms
11,520 KB |
testcase_37 | AC | 104 ms
11,776 KB |
testcase_38 | AC | 21 ms
6,940 KB |
testcase_39 | AC | 30 ms
6,940 KB |
testcase_40 | AC | 12 ms
7,552 KB |
testcase_41 | AC | 127 ms
16,896 KB |
testcase_42 | AC | 86 ms
13,440 KB |
testcase_43 | AC | 149 ms
20,736 KB |
testcase_44 | AC | 141 ms
21,004 KB |
testcase_45 | AC | 140 ms
20,724 KB |
testcase_46 | AC | 136 ms
20,960 KB |
testcase_47 | AC | 151 ms
20,836 KB |
testcase_48 | AC | 151 ms
20,736 KB |
testcase_49 | AC | 154 ms
20,736 KB |
testcase_50 | AC | 155 ms
20,884 KB |
testcase_51 | AC | 152 ms
20,952 KB |
testcase_52 | AC | 144 ms
20,720 KB |
ソースコード
#include <iostream> #include <vector> using namespace std; using Graph = vector<vector<int>>; // 深さ優先探索 int seen[100010], seen2[100010]; bool dfs(const Graph &G, const Graph &G_, const Graph &G2, const Graph &G2_, int v, bool HonLia) { bool flag = false; //矛盾が生じたか if (HonLia == true) seen[v] = 2; else seen[v] = 1; for (auto next_v : G[v]) { if (seen[next_v] >= 1){ if (HonLia == true && seen[next_v] == 1) flag = true; if (HonLia == false && seen[next_v] == 2) flag = true; continue; } if (HonLia == true) {if (dfs(G, G_, G2, G2_, next_v, true) == true) flag = true;} // 再帰的に探索 else {if (dfs(G, G_, G2, G2_, next_v, false) == true) flag = true;} // 再帰的に探索 } for (auto next_v : G_[v]) { if (seen[next_v] >= 1){ if (HonLia == true && seen[next_v] == 2) flag = true; if (HonLia == false && seen[next_v] == 1) flag = true; continue; } if (HonLia == true) {if (dfs(G, G_, G2, G2_, next_v, false) == true) flag = true;} // 再帰的に探索 else {if (dfs(G, G_, G2, G2_, next_v, true) == true) flag = true;} // 再帰的に探索 } for (auto next_v : G2[v]) { if (seen[next_v] >= 1){ if (HonLia == true && seen[next_v] == 1) flag = true; if (HonLia == false && seen[next_v] == 2) flag = true; continue; } if (HonLia == true) {if (dfs(G, G_, G2, G2_, next_v, true) == true) flag = true;} // 再帰的に探索 else {if (dfs(G, G_, G2, G2_, next_v, false) == true) flag = true;} // 再帰的に探索 } for (auto next_v : G2_[v]) { if (seen[next_v] >= 1){ if (HonLia == true && seen[next_v] == 2) flag = true; if (HonLia == false && seen[next_v] == 1) flag = true; continue; } if (HonLia == true) {if (dfs(G, G_, G2, G2_, next_v, false) == true) flag = true;} // 再帰的に探索 else {if (dfs(G, G_, G2, G2_, next_v, true) == true) flag = true;} // 再帰的に探索 } return flag; } bool dfs2(const Graph &G, const Graph &G_, const Graph &G2, const Graph &G2_, int v, bool HonLia) { bool flag = false; //矛盾が生じたか if (HonLia == true) seen2[v] = 2; else seen2[v] = 1; for (auto next_v : G[v]) { if (seen2[next_v] >= 1){ if (HonLia == true && seen2[next_v] == 1) flag = true; if (HonLia == false && seen2[next_v] == 2) flag = true; continue; } if (HonLia == true) {if (dfs2(G, G_, G2, G2_, next_v, true) == true) flag = true;} // 再帰的に探索 else {if (dfs2(G, G_, G2, G2_, next_v, false) == true) flag = true;} // 再帰的に探索 } for (auto next_v : G_[v]) { if (seen2[next_v] >= 1){ if (HonLia == true && seen2[next_v] == 2) flag = true; if (HonLia == false && seen2[next_v] == 1) flag = true; continue; } if (HonLia == true) {if (dfs2(G, G_, G2, G2_, next_v, false) == true) flag = true;} // 再帰的に探索 else {if (dfs2(G, G_, G2, G2_, next_v, true) == true) flag = true;} // 再帰的に探索 } for (auto next_v : G2[v]) { if (seen2[next_v] >= 1){ if (HonLia == true && seen2[next_v] == 1) flag = true; if (HonLia == false && seen2[next_v] == 2) flag = true; continue; } if (HonLia == true) {if (dfs2(G, G_, G2, G2_, next_v, true) == true) flag = true;} // 再帰的に探索 else {if (dfs2(G, G_, G2, G2_, next_v, false) == true) flag = true;} // 再帰的に探索 } for (auto next_v : G2_[v]) { if (seen2[next_v] >= 1){ if (HonLia == true && seen2[next_v] == 2) flag = true; if (HonLia == false && seen2[next_v] == 1) flag = true; continue; } if (HonLia == true) {if (dfs2(G, G_, G2, G2_, next_v, false) == true) flag = true;} // 再帰的に探索 else {if (dfs2(G, G_, G2, G2_, next_v, true) == true) flag = true;} // 再帰的に探索 } return flag; } int main() { // 頂点数と辺数 int N, Q; cin >> N >> Q; // グラフ入力受取 Graph G(N), G_(N), G2(N), G2_(N); for (int i = 0; i < Q; ++i) { int a, b, c; cin >> a >> b >> c; if (c == 0) G[a - 1].push_back(b - 1); if (c == 1) G_[a - 1].push_back(b - 1); if (c == 0) G2[b - 1].push_back(a - 1); if (c == 1) G2_[b - 1].push_back(a - 1); } // 全頂点が訪問済みになるまで探索 long long ans = 1; for (int i = 0; i < N; i++) seen[i] = seen2[i] = 0; for (int v = 0; v < N; ++v) { if (seen[v] >= 1) continue; // v が探索済みだったらスルー long long count = 0; if (dfs(G, G_, G2, G2_, v, true) == false) count++; // v が未探索なら v を始点とした DFS を行う if (dfs2(G, G_, G2, G2_, v, false) == false) count++; // v が未探索なら v を始点とした DFS を行う ans = (ans * count) % 998244353; } cout << ans << endl; }