# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7373 | gs13068 | 지도 색칠하기 (GA3_map) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
int graph[20][20];
int size[20];
int d[20];
bool vis[20];
int q[20];
int qn;
int main()
{
long long ans=0,cnt;
int s,e;
int i,j,k,l,n,m;
scanf("%d%d",&n,&m);
for(i=0;i<m;i++)
{
scanf("%d%d",&s,&e);
graph[s-1][size[s-1]++]=e-1;
graph[e-1][size[e-1]++]=s-1;
}
for(i=0;i<(1<<n-1);i++)
{
for(j=0;j<n;j++)vis[j]=false;
cnt=1;
for(l=0;l<n;l++)
{
if(((1<<l)&i)&&!vis[l])
{