https://www.acmicpc.net/problem/1707 DFS로 노드를 탐색해가면서 마킹표시를 해준다. 이전 노드와 색이 같으면 이분그래프가 아니라고 판정한다. 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869#include #define V 20050#define E 200050 struct NODE{ int node; struct NODE *next;}; NODE HEAD[V],POOL[E*2];int t,n,m,u,v,cnt,ans,visit[V]; void init(int n){ cnt=0; ans=1; f..
https://www.acmicpc.net/problem/2606 메모리풀로 그래프를 만들고 1번에 연결된 컴퓨터의 개수를 세준다. 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152#include #define N 100 struct NODE{ int node; struct NODE *next;}; NODE HEAD[N+1],POOL[N*N];int n,m,u,v,cnt,ans,visit[N+1]; void make(int u,int v){ NODE *node=&POOL[cnt++]; node->node=v; node->next=HEAD[u].next; HEAD[u].next=node..
I started not to eat anything at night. I live near my company during weekdays, so I eat food only at my company. Naturally I don't keep anything to eat at my room. I try to eat every meal regularly. I'll keep this habit for my health.