2018牛客多校第一场 Two Graphs(图的同构+全排列映射)

链接：https://www.nowcoder.com/acm/contest/139/D
来源：牛客网

时间限制：C/C++ 1秒，其他语言2秒
空间限制：C/C++ 524288K，其他语言1048576K
64bit IO Format: %lld

题目描述

Two undirected simple graphs and where are isomorphic when there exists a bijection on V satisfying  if and only if {x, y} ∈ E ₂.
Given two graphs and , count the number of graphs satisfying the following condition:
* .
* G ₁ and G are isomorphic.

输入描述:

The input consists of several test cases and is terminated by end-of-file.
The first line of each test case contains three integers n, m

₁

 and m

₂

 where |E

₁

| = m

₁

 and |E

₂

| = m

₂

.
The i-th of the following m

₁

 lines contains 2 integers a

_i

 and b

_i

 which denote {a

_i

, b

_i

} ∈ E

₁

.
The i-th of the last m

₂

 lines contains 2 integers a

_i

 and b

_i

 which denote {a

_i

, b

_i

} ∈ E

₂

.

输出描述:

For each test case, print an integer which denotes the result.

示例1

输入

复制

3 1 2
1 3
1 2
2 3
4 2 3
1 2
1 3
4 1
4 2
4 3

输出

复制

2
3

备注:

* 1 ≤ n ≤ 8
* 

* 1 ≤ a

_i

, b

_i

 ≤ n
* The number of test cases does not exceed 50.


图的同构的概念: 离散数学:图的同构
因为n的范围较小,所以直接全排列枚举映射,对图中的每一条边映射一个值,这样的一组集合就能代表一种图的同构

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> p;
typedef long long ll;
map<p,int>mp1;
map<p,int>mp2;
map<int,int>mp;
set<int>se;
const int mod=1e6+7;
const int N=1e6+10;
int a[10];
int main(){
    int n,m1,m2,x,y;
    while(~scanf("%d%d%d",&n,&m1,&m2)){
        mp1.clear();mp2.clear();mp.clear();se.clear();
        for(int i=1;i<=m1;i++){
            scanf("%d%d",&x,&y);mp1[{x,y}]=i;se.insert(x);se.insert(y);
        }
        for(int i=1;i<=m2;i++){
            scanf("%d%d",&x,&y);mp2[{x,y}]=i;
        }  
        int ans=0;
        for(int i=1;i<=n;i++) a[i]=i;
        set<ll>ss;ss.clear();
        do{
            mp.clear(); int flag=1;
            for(int i=1;i<=n;i++) mp[i]=a[i];ll tmp=0;
            for(auto it=mp1.begin();it!=mp1.end();it++){
                p a=it->first;p b1={mp[a.first],mp[a.second]};
                p b2={mp[a.second],mp[a.first]};
                if(mp2[b1]!=0){ tmp+=(1<<mp2[b1]);}
                else if(mp2[b2]!=0){tmp+=(1<<mp2[b2]);}
                else flag=0;
            }
            if(flag) ss.insert(tmp);
        }while(next_permutation(a+1,a+n+1));
        printf("%d\n",ss.size());
    }
    return 0;
}

View Code

转载于:https://www.cnblogs.com/vainglory/p/9674626.html