Hi,
I couldn't understand this problem from the editorial
https://codeforces.com/contest/217/problem/A
Can someone please explain how it's a bipartite graph
Thx
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | Benq | 3783 |
3 | Radewoosh | 3602 |
4 | Um_nik | 3541 |
5 | fantasy | 3526 |
6 | maroonrk | 3504 |
7 | ko_osaga | 3500 |
8 | jiangly | 3465 |
9 | orzdevinwang | 3460 |
10 | cnnfls_csy | 3427 |
# | User | Contrib. |
---|---|---|
1 | awoo | 180 |
2 | -is-this-fft- | 177 |
3 | nor | 169 |
4 | Um_nik | 168 |
5 | SecondThread | 164 |
6 | maroonrk | 163 |
7 | adamant | 161 |
8 | kostka | 160 |
9 | YouKn0wWho | 158 |
10 | tourist | 154 |
Hi,
I couldn't understand this problem from the editorial
https://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://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://codeforces.com/contest/771/submission/69394496 AC submission: https://codeforces.com/contest/771/submission/69395025
Name |
---|