QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #379731 | #8029. Traveling Merchant | comeintocalm# | TL | 158ms | 3804kb | C++17 | 969b | 2024-04-06 18:36:43 | 2024-04-06 18:36:44 |
Judging History
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);
auto dfs = [&] (auto dfs, const int u) -> void {
vis[u] = true;
for (auto &v: ver[u]) {
if (cl[u] == cl[v] && vis[v]) {
ans = true;
}
if (cl[u] != cl[v] && !vis[v]) {
dfs(dfs, v);
}
}
vis[u] = false;
};
dfs(dfs, 0);
std::cout << (ans ? "yes" : "no") << '\n';
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3804kb
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: 0
Accepted
time: 158ms
memory: 3748kb
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:
ok 12385 lines
Test #3:
score: -100
Time Limit Exceeded
input:
4627 11 51 LLHLLLHHLHL 0 2 0 9 10 0 4 8 3 5 4 7 6 1 1 2 2 6 5 8 5 0 7 3 4 0 2 9 2 3 6 0 8 1 5 2 6 9 0 1 10 1 1 7 5 6 1 5 1 9 4 3 9 3 3 10 6 3 10 6 0 8 7 2 8 6 4 10 8 3 7 9 10 2 8 10 8 2 1 3 5 7 3 0 7 6 0 7 10 9 9 5 1 4 5 4 10 5 9 4 7 8 15 97 LLLLLHHHHLHHLHH 8 6 13 7 10 1 7 1 4 3 8 12 14 2 14 8 14 12...
output:
yes