Submission #5486906

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0; i < n; i++)
using namespace std;
using ll = long long;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N, M;
  cin >> N >> M;
  vector<vector<int>> xy(M, vector<int>(2));
  REP(i, M) REP(j, 2) cin >> xy[i][j];
  int ans = 1;
  // i + 1の議員
  for(int bit = 0; bit < (1 << N); bit++) {
    vector<int> a;
    sort(a.begin(), a.end());
    int tmp = -1;
    bool ok = true;
    for(int i = 0; i < N; i++) {
      if(bit & (1 << i)) { a.push_back(i + 1); }
    }
    for(int i = 0; i < a.size() - 1; i++) {
      for(int j = i + 1; j < a.size(); j++) {
        for(int k = 0; k < M; k++) {
          bool x = (a[i] == xy[k][0]);
          bool y = (a[j] == xy[k][1]);
          if(x != y) { ok = false; }
        }
      }
    }
    int size = a.size();
    if(ok) { ans = max(ans, size); }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result