암기하자
알고리즘21 :: BOJ_1707_이분그래프
알고리즘21 :: BOJ_1707_이분그래프
2019.02.2712345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697#include #include #include #include #include using namespace std; vector a[20001]; int color[20001]; void dfs(int node, int c){ color[node] = c; for(int i=0; i