Submission #3819634


Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;

#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())
#define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;}
#define pq_pair_tB priority_queue <pair<ll,ll>, vector<pair<ll,ll> > , greater<pair<ll,ll> > > 
#define pq_pair_ts priority_queue <pair<ll,ll> > //第二成分の大きさが関係ない
template<typename X> bool exist(vector<X> vec, X item){return find(all(vec), item)!=vec.end();}
ll gcd(ll a, ll b){if(b==0)return a;return gcd(b,a%b);}
ll lcm(ll a, ll b){return a/gcd(a,b)*b;}

bool rela[15][15];

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N , M ;
    cin >> N >> M ;
    
    rep(i,N){rela[i][i] = true;}
    
    rep(i,M){
        ll x, y;
        cin >> x >> y ;
        x--;
        y--;
        rela[x][y] = true;
        rela[y][x] = true;
    }
    
    ll ans = 0;
    rep(i, 1<<N){
        vector<ll> r;
        rep(j, N){
            if(i&1<<j) r.pb(j);
        }
        
        bool flag = true;
        rep(j, r.size())rep(k, r.size()){
            if(!rela[r[j]][r[k]]){
                flag = false;
                j = r.size();
                k = r.size();
                break;
            }
        }
        if(flag) ans = max(ans, (ll)r.size());
    }
    
    cout << ans << endl;
    
    //cout << fixed << setprecision(16) << ans << endl;
    return 0;
}

Submission Info

Submission Time
Task D - 派閥
User ukohank517
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1951 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 74
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt, test_65.txt, test_66.txt, test_67.txt, test_68.txt, test_69.txt, test_70.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
00_sample_04.txt AC 2 ms 256 KB
test_01.txt AC 1 ms 256 KB
test_02.txt AC 1 ms 256 KB
test_03.txt AC 1 ms 256 KB
test_04.txt AC 1 ms 256 KB
test_05.txt AC 1 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 1 ms 256 KB
test_10.txt AC 2 ms 256 KB
test_11.txt AC 2 ms 256 KB
test_12.txt AC 2 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 1 ms 256 KB
test_15.txt AC 1 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 2 ms 256 KB
test_18.txt AC 2 ms 256 KB
test_19.txt AC 2 ms 256 KB
test_20.txt AC 2 ms 256 KB
test_21.txt AC 1 ms 256 KB
test_22.txt AC 2 ms 256 KB
test_23.txt AC 2 ms 256 KB
test_24.txt AC 2 ms 256 KB
test_25.txt AC 1 ms 256 KB
test_26.txt AC 2 ms 256 KB
test_27.txt AC 2 ms 256 KB
test_28.txt AC 1 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 2 ms 256 KB
test_31.txt AC 2 ms 256 KB
test_32.txt AC 2 ms 256 KB
test_33.txt AC 2 ms 256 KB
test_34.txt AC 2 ms 256 KB
test_35.txt AC 2 ms 256 KB
test_36.txt AC 2 ms 256 KB
test_37.txt AC 2 ms 256 KB
test_38.txt AC 2 ms 256 KB
test_39.txt AC 2 ms 256 KB
test_40.txt AC 2 ms 256 KB
test_41.txt AC 2 ms 256 KB
test_42.txt AC 2 ms 256 KB
test_43.txt AC 2 ms 256 KB
test_44.txt AC 2 ms 256 KB
test_45.txt AC 2 ms 256 KB
test_46.txt AC 2 ms 256 KB
test_47.txt AC 2 ms 256 KB
test_48.txt AC 2 ms 256 KB
test_49.txt AC 2 ms 256 KB
test_50.txt AC 2 ms 256 KB
test_51.txt AC 2 ms 256 KB
test_52.txt AC 2 ms 256 KB
test_53.txt AC 2 ms 256 KB
test_54.txt AC 2 ms 256 KB
test_55.txt AC 2 ms 256 KB
test_56.txt AC 2 ms 256 KB
test_57.txt AC 2 ms 256 KB
test_58.txt AC 2 ms 256 KB
test_59.txt AC 2 ms 256 KB
test_60.txt AC 2 ms 256 KB
test_61.txt AC 2 ms 256 KB
test_62.txt AC 1 ms 256 KB
test_63.txt AC 2 ms 256 KB
test_64.txt AC 2 ms 256 KB
test_65.txt AC 2 ms 256 KB
test_66.txt AC 2 ms 256 KB
test_67.txt AC 2 ms 256 KB
test_68.txt AC 2 ms 256 KB
test_69.txt AC 2 ms 256 KB
test_70.txt AC 2 ms 256 KB