QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#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

你现在查看的是最新测评结果

[2024-08-07 20:25:21]
hack成功，自动添加数据
(/hack/771)

[2024-04-11 23:42:53]
评测

测评结果：WA
用时：70ms
内存：3868kb

查看

[2024-04-11 23:42:53]
提交

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;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3636kb

input:

output:

yes
no

result:

ok 2 lines

Test #2:

score: -100

Wrong Answer

time: 70ms

memory: 3868kb

input:

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'