結果
問題 | No.2277 Honest or Dishonest ? |
ユーザー | magsta |
提出日時 | 2023-04-20 19:20:00 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 256 ms / 2,000 ms |
コード長 | 5,396 bytes |
コンパイル時間 | 1,112 ms |
コンパイル使用メモリ | 81,976 KB |
実行使用メモリ | 25,728 KB |
最終ジャッジ日時 | 2024-04-25 18:48:00 |
合計ジャッジ時間 | 9,000 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 181 ms
19,584 KB |
testcase_04 | AC | 181 ms
22,144 KB |
testcase_05 | AC | 47 ms
13,952 KB |
testcase_06 | AC | 138 ms
15,616 KB |
testcase_07 | AC | 108 ms
14,848 KB |
testcase_08 | AC | 36 ms
14,308 KB |
testcase_09 | AC | 96 ms
16,256 KB |
testcase_10 | AC | 75 ms
10,880 KB |
testcase_11 | AC | 35 ms
7,296 KB |
testcase_12 | AC | 67 ms
7,680 KB |
testcase_13 | AC | 170 ms
17,664 KB |
testcase_14 | AC | 83 ms
7,936 KB |
testcase_15 | AC | 38 ms
12,032 KB |
testcase_16 | AC | 107 ms
14,592 KB |
testcase_17 | AC | 49 ms
8,832 KB |
testcase_18 | AC | 162 ms
21,120 KB |
testcase_19 | AC | 169 ms
21,376 KB |
testcase_20 | AC | 126 ms
17,408 KB |
testcase_21 | AC | 103 ms
11,520 KB |
testcase_22 | AC | 99 ms
15,360 KB |
testcase_23 | AC | 150 ms
13,440 KB |
testcase_24 | AC | 91 ms
14,336 KB |
testcase_25 | AC | 114 ms
18,160 KB |
testcase_26 | AC | 21 ms
12,928 KB |
testcase_27 | AC | 67 ms
9,216 KB |
testcase_28 | AC | 41 ms
11,648 KB |
testcase_29 | AC | 72 ms
14,848 KB |
testcase_30 | AC | 62 ms
10,496 KB |
testcase_31 | AC | 123 ms
16,000 KB |
testcase_32 | AC | 63 ms
13,952 KB |
testcase_33 | AC | 168 ms
20,864 KB |
testcase_34 | AC | 185 ms
20,736 KB |
testcase_35 | AC | 14 ms
8,960 KB |
testcase_36 | AC | 102 ms
14,208 KB |
testcase_37 | AC | 166 ms
16,128 KB |
testcase_38 | AC | 32 ms
6,940 KB |
testcase_39 | AC | 46 ms
7,680 KB |
testcase_40 | AC | 14 ms
7,808 KB |
testcase_41 | AC | 206 ms
21,504 KB |
testcase_42 | AC | 129 ms
16,768 KB |
testcase_43 | AC | 228 ms
25,444 KB |
testcase_44 | AC | 239 ms
25,472 KB |
testcase_45 | AC | 256 ms
25,472 KB |
testcase_46 | AC | 251 ms
25,532 KB |
testcase_47 | AC | 249 ms
25,600 KB |
testcase_48 | AC | 234 ms
25,432 KB |
testcase_49 | AC | 227 ms
25,728 KB |
testcase_50 | AC | 233 ms
25,600 KB |
testcase_51 | AC | 230 ms
25,576 KB |
testcase_52 | AC | 235 ms
25,492 KB |
ソースコード
#include <iostream> #include <vector> #include <set> 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; set<pair<int, int>> Set; // グラフ入力受取 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); if (*(Set.lower_bound(make_pair(a, b))) == make_pair(a, b)) cout << -1 << endl; Set.insert(make_pair(a, b)); } // 全頂点が訪問済みになるまで探索 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; }