Submission #7560221

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;
using ll = long long;

constexpr static ll MOD = 1000000007ll;
constexpr static int INF = 1 << 28; // for x <= 10^9
constexpr static ll INFL = 1ll << 60; // for x <= 10^19

bool relation[12 + 1][12 + 1];

bool check(vector<int>& s) {
    for (int j = 0; j < s.size(); j++) {
        for (int k = j + 1; k < s.size(); k++) {
            if (relation[s[j]][s[k]] == false) {
                return false;
            }
        }
    }

    return true;
}
int main() {
    int n, m;
    cin >> n >> m;

    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        relation[x][y] = relation[y][x] = true;
    }

    int ans = 0;
    for (int i = 0; i < (1 << n); i++) {
        vector<int> s;
        for (int j = 0; j < n; j++) {
            if (((i >> j) & 1) == 1) {
                s.push_back(j + 1);
            }
        }

        if (check(s)) {
            int a = s.size();
            ans = max(ans, a);
        }
    }

    cout << ans << endl;
}

Submission Info

Judge Result