Submission #5379752

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int main() {
    int N, M;
    cin >> N >> M;
    vector<int> x(M);
    vector<int> y(M);
    for (int i = 0; i < M; i++) {
        cin >> x.at(i) >> y.at(i);
        x.at(i)--;
        y.at(i)--;
    }
    
    vector<vector<bool>> kankei(N, vector<bool>(N));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            bool tmp = false;
            for (int k = 0; k < M; k++) {
                if (x.at(k) == i && y.at(k) == j) tmp = true;
                if (y.at(k) == i && x.at(k) == j) tmp = true;
              	if (i == j) tmp = true;
            }
            kankei.at(i).at(j) = tmp;
        }
    }
    
    
    int ans = 1;
    for (int bit = 0; bit < (1<<N); ++bit) {
        bool habatsu = true;
        vector<int> member;
        for (int i = 0; i < N; i++) {
            if (bit & (1<<i)) {
                member.push_back(i);
            }
        }
        
        int ninzuu = member.size();
      	for (int i = 0; i < ninzuu; i++) {
            for (int j = 0; j < ninzuu; j++) {
                if (!(kankei.at(member.at(i)).at(member.at(j)))) habatsu = false;
            }
        }
      	if (habatsu) ans = max(ans, ninzuu);
    }
    
    cout << ans << endl;
    
}

Submission Info

Judge Result