Hi,
I couldn't understand this problem from the editorial
https://mirror.codeforces.com/contest/217/problem/A
Can someone please explain how it's a bipartite graph
Thx
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
Hi,
I couldn't understand this problem from the editorial
https://mirror.codeforces.com/contest/217/problem/A
Can someone please explain how it's a bipartite graph
Thx
Hi,
I was working on this problem: https://mirror.codeforces.com/contest/771/problem/A
By adding a return in front of my recursive call in the function "dfs2," I was able to get AC on this problem. Can anyone please explain why?
Difference:
bool dfs2(int u)
{
if(vis[u])
return false;
vis[u] = 1;
if(adj[u].size() != cur_sz - 1)
return false;
for(int v : adj[u])
if(!vis[v])
dfs2(v);
return true;
}
as opposed to
bool dfs2(int u)
{
if(vis[u])
return false;
vis[u] = 1;
if(adj[u].size() != cur_sz - 1)
return false;
for(int v : adj[u])
if(!vis[v])
return dfs2(v);
return true;
}
WA submission: https://mirror.codeforces.com/contest/771/submission/69394496 AC submission: https://mirror.codeforces.com/contest/771/submission/69395025
Name |
---|