QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #326603 | #8029. Traveling Merchant | C1942huangjiaxu | WA | 20ms | 9952kb | C++14 | 714b | 2024-02-13 16:04:39 | 2024-02-13 16:04:39 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
int T,n,m,in[N],out[N],cnt;
char c[N];
vector<int>e[N];
vector<pair<int,int> >E;
void dfs(int x){
in[x]=++cnt;
for(auto v:e[x])if(!in[v])dfs(v);
out[x]=cnt;
}
void solve(){
scanf("%d%d%s",&n,&m,c+1);
for(int i=1;i<=n;++i)e[i].clear(),in[i]=out[i]=0;
E.clear(),cnt=0;
for(int i=1,x,y;i<=m;++i){
scanf("%d%d",&x,&y);
++x,++y;
if(c[x]==c[y])E.emplace_back(x,y);
else e[x].push_back(y),e[y].push_back(x);
}
dfs(1);
for(auto [x,y]:E)if(in[x]&&in[y]){
if(in[x]>in[y])swap(x,y);
if(out[x]>=in[y])return puts("yes"),void();
}
puts("no");
}
int main(){
scanf("%d",&T);
while(T--)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 9952kb
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: 20ms
memory: 9036kb
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 568th lines differ - expected: 'yes', found: 'no'