Submission #7376

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
7376	2014-08-04 15:35:14	gs13068	지도 색칠하기 (GA3_map)	C++98	120 / 120	860 ms	1088 KiB

map

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
int graph[20][20];
int size[20];
int d[20];
bool vis[20];
int q[20];
int qn;
long long NumberOfMaps(int n,int m,int s[],int e[])
{
  long long ans=0,cnt;
  int i,j,k,l;
  for(i=0;i<m;i++)
  {
    graph[s[i]-1][size[s[i]-1]++]=e[i]-1;
    graph[e[i]-1][size[e[i]-1]++]=s[i]-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])
      {
        qn=0;
        d[l]=0;
        q[qn++]=l;
        vis[l]=true;
        for(j=0;j<qn;j++)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 30 / 30
• Subtask 5: 35 / 35