Submission #1419496

---

Source Code Expand

#include <bits/stdc++.h>


using namespace std;


// Powered by caide (code generator, tester, and library code inliner)


class Solution {
public:
  int n, m;
  bitset<12> bs[12] = {};
  int dfs(int now, bitset<12> b)
  {
    if(now == n) {
      return b.count();
    }
    bitset<12> bits = b;
    bits &= bs[now];
    if(b == bits) {
      bits[now] = true;
      return max(dfs(now + 1, b), dfs(now + 1, bits));
    } else {
      return dfs(now + 1, b);
    }
  }

  void solve(std::istream& in, std::ostream& out)
  {
    in >> n >> m;
    for (int i = 0; i < n; i++) {
      bs[i][i] = true;
    }
    for (int i = 0; i < m; i++) {
      int x, y;
      in >> x >> y;
      x--;
      y--;
      bs[x][y] = bs[y][x] = true;
    }
    out << max(dfs(0, 0), 1) << "\n";
  }
};

void solve(std::istream& in, std::ostream& out)
{
  out << std::setprecision(12);
  Solution solution;
  solution.solve(in, out);
}


#include <fstream>
#include <iostream>


int main() {
  
  ios_base::sync_with_stdio(0);
  cin.tie(0);


  istream& in = cin;


  ostream& out = cout;

  solve(in, out);
  return 0;
}

Submission Info

Judge Result