提出 #19853457

---

ソースコード 拡げる

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

using ll = long long;

using vb = vector<bool>;
using vi = vector<int>;
using vll = vector<long long>;

using pii = pair<int, int>;
using pll = pair<long long, long long>;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

constexpr long long mod = 1000000007;

#define rep(i, n) for (ll i = 0; i < n; i++)
#define repi(i, a, b) for (ll i = a; i < b; i++)
#define repa(i, a) for (auto i : a)

#define all(x) (x).begin(), (x).end()

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

    int n, m;
    cin >> n >> m;

    vector<pair<int, int>> p, q;
    rep(i, m) {
        int t1, t2;

        cin >> t1 >> t2;
        t1--;
        t2--;
        p.push_back(make_pair(t1, t2));
    }
    int k;
    cin >> k;
    rep(i, k) {
        int t1, t2;

        cin >> t1 >> t2;
        t1--;
        t2--;
        q.push_back(make_pair(t1, t2));
    }

    int ans = 0;

    for (int bit = 0; bit < (1 << k); bit++) {
        vector<bool> dish(n, false);

        rep(i, k) {
            if (bit & (1 << i)) {
                dish[q[i].first] = true;
            } else {
                dish[q[i].second] = true;
            }
        }
        int cnt = 0;
        rep(i, m) {
            if(dish[p[i].first]&&dish[p[i].second]){
                cnt++;
            }
        }

        ans = max(ans, cnt);
    }

    cout<<ans<<endl;
}

提出情報

ジャッジ結果