結果

問題 No.2277 Honest or Dishonest ?
ユーザー magsta
提出日時 2023-04-20 19:32:48
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 278 ms / 2,000 ms
コード長 5,741 bytes
コンパイル時間 7,493 ms
コンパイル使用メモリ 231,916 KB
実行使用メモリ 31,188 KB
最終ジャッジ日時 2024-11-08 06:21:45
合計ジャッジ時間 16,784 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <vector>
#include <set>
#include "testlib.h"
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() {
registerValidation();
//
int N = inf.readInt(2, 100000, "N");
inf.readSpace();
int Q = inf.readInt(1, 100000, "Q");
inf.readEoln();
set<pair<int, int>> Set;
//
Graph G(N), G_(N), G2(N), G2_(N);
for (int i = 0; i < Q; ++i) {
int a = inf.readInt(1, N, "a");
inf.readSpace();
int b = inf.readInt(1, N, "b");
inf.readSpace();
int c = inf.readInt(0, 1, "c");
if (a == b) cout << -1 << endl;
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));
inf.readEoln();
}
inf.readEof();
//
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;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0