QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#379741	#8029. Traveling Merchant	comeintocalm^#	WA	52ms	3772kb	C++17	1007b	2024-04-06 18:43:37	2024-04-06 18:43:37

Judging History

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

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

[2024-04-06 18:43:37]
评测

测评结果：WA
用时：52ms
内存：3772kb

查看

[2024-04-06 18:43:37]
提交

answer

#include <bits/stdc++.h>

int main() {
    // freopen("in", "r", stdin);
    int ttt;
    std::cin >> ttt;
    while (ttt--) {
        int n, m;
        std::cin >> n >> m;
        std::string cl;
        std::cin >> cl;
        std::vector<std::vector<int>> ver(n);
        for (int i = 0; i < m; ++i) {
            int u, v;
            std::cin >> u >> v;
            ver[u].emplace_back(v);
            ver[v].emplace_back(u);
        }

        bool ans = false;
        std::vector<bool> vis(n), used(n);
        auto dfs = [&] (auto dfs, const int u) -> void {
            vis[u] = true;
            used[u] = true;
            for (auto &v: ver[u]) {
                if (cl[u] == cl[v] && vis[v]) {
                    ans = true;
                }
                if (cl[u] != cl[v] && !used[v]) {
                    dfs(dfs, v);
                }
            }
            vis[u] = false;
        };

        dfs(dfs, 0);

        std::cout << (ans ? "yes" : "no") << '\n';
    }
    return 0;
}

源文件, 语言: C++17

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 3772kb

input:

output:

yes
no

result:

ok 2 lines

Test #2:

score: -100

Wrong Answer

time: 52ms

memory: 3752kb

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 568th lines differ - expected: 'yes', found: 'no'