Submission #19788917

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//uniform_int_distribution<int>(1000,10000)(rng)

ll binpow(ll a, ll b)
{
    ll res = 1;
    while (b > 0)
    {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

ll gcd(ll a,ll b)
{
    if (b==0) return a;
    return gcd(b,a%b);
}

string to_upper(string a)
{
    for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
    return a;
}
 
string to_lower(string a)
{
    for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
    return a;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n,m,k,ans=0,cur;
    cin>>n>>m;
    int a[m][2],b[n+1];
    for (int i=0;i<m;++i)
        cin>>a[i][0]>>a[i][1];
    cin>>k;
    int c[k][2];
    for (int i=0;i<k;++i)
        cin>>c[i][0]>>c[i][1];
    for (int i=0;i<(1<<k);++i)
    {
        for (int j=1;j<=n;++j)
            b[j]=0;
        for (int j=0;j<k;++j)
        {
            if (i&(1<<j))
                ++b[c[j][0]];
            else
                ++b[c[j][1]];
        }
        cur=0;
        for (int j=0;j<m;++j)
            if (b[a[j][0]]&&b[a[j][1]])
                ++cur;
        ans=max(ans,cur);
    }
    cout<<ans;
    return 0;
}

Submission Info

Judge Result