Submission #7135508

---

Source Code Expand

#include <string>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <bitset>
using namespace std;
 
int main()
{
    int n, m;
    cin >> n >> m;
    bitset<12> *giin = new bitset<12>[n];
    for (int i = 0; i < n; i++)
    {
        giin[i][i] = 1;
    }
    
    for (int i = 0; i < m; i++)
    {
        int x, y;
        cin >> x >> y;
        x--; y--;
        giin[x][y] = 1;
        giin[y][x] = 1;
    }
    // cout << giin[0] << endl;
    // cout << giin[1] << endl;
    // cout << giin[2] << endl;

    int max = 0;
    // 集合全パターン
    for (int set = 1; set < 1 << n; set++)
    {
        bitset<12> set_bin(set);
        bool ok = true;

        // (x, y)はすべての二人組
        for (int x = 0; x < n; x++)
        {
            for (int y = 0; y < n; y++)
            {
                // x, yが集合に含まれている
                if (set_bin[x] && set_bin[y])
                {
                    if (!giin[x][y]) ok = false;
                }
            }
        }

        int count = set_bin.count();
        if (ok && count > max) max = count;
    }
        
    cout << max << endl;
    return 0;    
}

Submission Info

Judge Result