QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #387030 | #8029. Traveling Merchant | 15owzLy1 | WA | 70ms | 3868kb | C++20 | 2.9kb | 2024-04-11 23:42:53 | 2024-04-11 23:42:53 |
Judging History
answer
#include <bits/stdc++.h>
const int N = 2e5 + 5;
int main() {
// freopen("in", "r", stdin);
int ttt;
std::cin >> ttt;
while (ttt--) {
int n, m;
std::cin >> n >> m;
std::vector<int> fa(n + 1), dsu(n + 1);
int dfn_tot = 0, bel_tot = 0;
std::vector<int> dfn(n + 1), low(n + 1), dep(n + 1), bel(n + 1);
std::vector<std::vector<int>> ver(n + 1), diff(n + 1);
std::vector<bool> vis(n + 1);
std::string c;
std::cin >> c;
for (int i = 0, u, v; i < m; ++i) {
std::cin >> u >> v; ++u, ++v;
if (c[u - 1] == c[v - 1]) {
diff[u].emplace_back(v);
diff[v].emplace_back(u);
} else {
ver[u].emplace_back(v);
ver[v].emplace_back(u);
}
}
auto tarjan = [&] (auto self, const int u) -> void {
dfn[u] = low[u] = ++dfn_tot;
vis[u] = true;
for (auto &&v: ver[u]) {
if (!dfn[v]) {
fa[v] = u;
self(self, v);
low[u] = std::min(low[u], low[v]);
} else if (vis[v]) {
low[u] = std::min(low[u], dfn[v]);
}
}
vis[u] = false;
};
auto shrink = [&] (auto self, const int u) -> void {
bel[u] = bel_tot;
for (auto &&v: ver[u]) {
if (bel[v] == 0 && low[v] <= dfn[u]) {
self(self, v);
}
}
};
tarjan(tarjan, 1);
for (int i = 1; i <= n; ++i) {
if (dfn[i] != 0 && bel[i] == 0) {
++bel_tot;
shrink(shrink, i);
}
}
bool flag{false};
for (int i = 1; i <= n; ++i)
dsu[i] = i;
auto GetFa = [&] (auto self, const int u) -> int {
return dsu[u] == u ? u : dsu[u] = self(self, dsu[u]);
};
auto dfs = [&] (auto self, const int u) -> void {
vis[u] = true;
for (auto &&v: diff[u]) {
if (vis[v]) {
int w = GetFa(GetFa, v);
if (dfn[u] == 0 || dfn[v] == 0) {
continue;
}
if (u == w || v == w) {
flag = true;
}
if (bel[fa[w]] == bel[u] || bel[fa[w]] == bel[v]) {
flag = true;
}
}
}
for (auto &&v: ver[u]) {
if (!vis[v]) {
self(self, v);
}
}
dsu[u] = fa[u];
};
dfs(dfs, 1);
puts(flag ? "yes" : "no");
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3636kb
input:
2 4 4 LHLH 0 1 1 2 1 3 2 3 3 3 LHH 0 1 0 2 1 2
output:
yes no
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 70ms
memory: 3868kb
input:
12385 9 29 LHLLHLHLH 0 7 1 4 4 6 2 0 4 2 6 5 8 4 7 1 2 6 7 3 7 2 8 7 1 3 5 3 0 8 4 0 0 5 8 1 8 6 3 2 0 1 1 2 6 3 2 5 6 0 3 0 5 4 4 3 7 5 7 15 LLLLLHL 5 2 6 3 3 0 0 6 4 5 1 4 6 1 0 5 3 4 5 6 1 0 2 6 0 2 4 2 0 4 6 6 LHHHHH 5 0 0 4 2 5 1 4 1 3 3 4 9 8 LHLHLLHLL 5 7 5 4 7 4 7 8 1 5 0 1 1 8 1 2 5 4 LHHHH...
output:
yes yes no no no yes yes yes no yes yes no yes yes yes yes yes yes yes yes no no no yes no no yes yes no no yes no no yes yes yes yes yes yes no no yes yes yes yes yes yes yes yes yes yes yes yes yes yes no yes yes yes yes yes yes no yes yes no yes yes yes yes yes yes no no no yes yes yes no yes yes...
result:
wrong answer 244th lines differ - expected: 'no', found: 'yes'