Submission #7047898

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

int main(){
    int n, m;
    cin >> n >> m;
    vector<vector<bool>> relation(n, vector<bool>(n, false));
    for (int i = 0; i < n; i++) relation[i][i] = true;
    for (int i = 0; i < m; i++){
        int x, y;
        cin >> x >> y;
        x--; y--;
        relation[x][y] = true;
        relation[y][x] = true;
    }
    int ans = 0;
    for (int i = 0; i < (1 << n); i++){
        vector<int> tmp;
        for (int j = 0; j < n; j++) if ((i >> j) & 1) tmp.push_back(j);
        bool flag = true;
        for (int j = 0; j < tmp.size(); j++){
            for (int k = 0; k < tmp.size(); k++){
                if (!relation[tmp[j]][tmp[k]]) flag = false;
            }
        }
        if (flag) ans = max(ans, (int)tmp.size());
    }
    cout << ans << endl;
}

Submission Info

Judge Result