Counting Cliques（dfs，剪枝）

Counting Cliques

题意

构造一个图，n 个点，m 条边，寻找一共多少个有 s 个点完全图。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<string.h>

using namespace std;
vector<int> Edge[105];
int edgeNum[105];
int edge[105][105];
//点，边，完全图的点数
int n, m, s;
int vis[105];
int h;
int ans;

void dfs(int start, int deep) {
    if (h == s) {
        ans++;
        return;
    }
    if (deep > Edge[start].size() || Edge[start].size() - deep < (s - h)) {
        return;
    }
    bool flag = true;
    for (int i = 0; i < h; i++) {
        if (edge[Edge[start][deep]][vis[i]] == 0) {
            flag = false;
            break;
        }
    }
    if (flag) {
        vis[h++] = Edge[start][deep];
        dfs(start, deep + 1);
        h--;
    }
    dfs(start, deep + 1);
}

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        for (int i = 0; i < 105; i++) {
            Edge[i].clear();
        }
        ans = 0;
        memset(edgeNum, 0, sizeof(edgeNum));
        memset(edge, 0, sizeof(edge));
        scanf("%d%d%d", &n, &m, &s);
        int u, v;
        for (int i = 0; i < m; i++) {
            scanf("%d%d", &u, &v);
            Edge[u].push_back(v);
            Edge[v].push_back(u);
            edge[u][v] = 1;
            edge[v][u] = 1;
            edgeNum[u]++;
            edgeNum[v]++;
        }
        for (int i = 1; i <= n; i++) {
            if (edgeNum[i] < s - 1){
                continue;
            }
            h = 0;
            vis[h++] = i;
            dfs(i, 0);
            for (int j = 1; j <= n; j++) {
                if (edge[i][j]) {
                    edge[i][j] = edge[j][i] = 0;
                    edgeNum[j]--;
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}

下面代码在计蒜客上会 T，但是容易看懂

#include <cstring>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>

using namespace std;
typedef long long ll;
//点，边，完全图的点数
int n, m, s;
int ans;
const int maxn = 110;
bool edge[maxn][maxn];
vector<int> Edge[maxn];
int vis[maxn];

int read() {
    int res = 0;
    char ch = getchar();
    while (!isdigit(ch)) ch = getchar();
    while (isdigit(ch)) {
        res *= 10;
        res += ch - '0';
        ch = getchar();
    }
    return res;
}

void dfs(int deep, int start) {
    if (Edge[start].size() < s - 1) {
        return;
    }
    if (s - deep + start > n) {
        return;
    }
    if (deep == s) {
        ans++;
        return;
    }
    int elen = Edge[start].size();
    for (int i = 0; i < elen; i++) {
        int v = Edge[start][i];
        if (v < start) {
            continue;
        }
        if (Edge[v].size() < deep) {
            continue;
        }
        bool flag = true;
        for (int j = 1; j <= deep; j++) {
            int w = vis[j];
            if (!edge[v][w]) {
                flag = false;
                break;
            }
        }
        if (flag) {
            vis[deep + 1] = v;
            dfs(deep + 1, v);
        }
    }
}

void addEdge(int u, int v) {
    edge[u][v] = edge[v][u] = true;
    Edge[u].push_back(v);
    Edge[v].push_back(u);
}

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        n = read();
        m = read();
        s = read();
        for (int i = 1; i <= n; i++) {
            Edge[i].clear();
            for (int j = 1; j <= n; j++) {
                edge[i][j] = false;
            }
        }
        int u, v;
        for (int i = 1; i <= m; i++) {
            scanf("%d%d", &u, &v);
            addEdge(u, v);
        }
        ans = 0;
        for (int i = 1; i <= n; i++) {
            vis[1] = i;
            dfs(1, i);
        }
        printf("%d\n", ans);
    }
    return 0;
}