QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #533636 | #8544. Colorful Graph 2 | rotcar07 | WA | 157ms | 8936kb | C++14 | 611b | 2024-08-26 09:38:20 | 2024-08-26 09:38:21 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
constexpr int maxn=2e5+5;
vector<int> e[maxn];
int col[maxn];
void dfs(int p,int co){
if(!~col[p]) col[p]=co;
else return;
for(auto x:e[p]) dfs(x,co^1);
}
inline void solve(){
int n,m;cin>>n>>m;
for(int i=1;i<=n;i++) e[i].clear(),col[i]=-1;
for(int i=1,u,v;i<=m;i++) cin>>u>>v,u++,v++,e[u].push_back(v),e[v].push_back(u);
for(int i=1;i<=n;i++) e[i].push_back(i%n+1),e[i%n+1].push_back(i);
dfs(1,0);
for(int i=1;i<=n;i++) cout<<"BR"[col[i]];cout<<'\n';
}
int main(){
int t;cin>>t;
while(t--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 8936kb
input:
3 3 0 4 1 1 3 6 3 0 2 2 4 4 0
output:
BRB BRRB BBRRBR
result:
ok ok (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 157ms
memory: 8444kb
input:
100000 9 6 2 0 4 6 3 6 0 6 0 7 2 6 3 0 5 2 2 4 2 0 6 3 1 5 4 1 2 4 9 6 3 1 6 4 8 1 3 6 1 6 8 6 3 0 7 4 3 0 4 0 6 4 3 1 7 4 5 1 5 0 3 1 1 4 4 1 1 3 6 3 2 4 4 0 2 0 6 3 3 0 1 3 5 3 7 4 0 5 2 5 5 1 3 5 8 5 4 1 5 1 5 0 1 3 5 7 3 0 8 5 0 2 4 6 0 6 0 3 4 0 8 5 5 1 1 4 5 0 3 1 5 7 3 0 10 7 0 2 9 2 5 8 3 9 ...
output:
BBRBRBBRB BRB BBRRB BRBRRB BRRBBRRRB BRB BBRRBBR BBBRBRB BRRB BRBRRB BBRRRB BRBRBRB BBRBRRRB BRB BBRBRRBR BBRBRRRB BRB BBRRBBRBRB BRBRBRRB BRRBBRRBRB BRBBBRRRRB BBRBRRBBRR BRB BRBRRBB BRBRBR BBRRBRBR BRRB BBRRRBB BRRRBRRBRB BRRRBBB BRBRRBBR BRRBRB BBRRBR BRB BRB BRRBRBRBR BRBRRRB BBRRB BRRBRBBBRR BB...
result:
wrong answer cycle detected (test case 19)