Submission #4342769


Source Code Expand

Copy
#include <bits/stdc++.h>
#include <bitset>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef vector<vector<int> > vvi;
typedef vector<int> vi;
typedef vector<string> vst;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
 
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};


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


    int n,m;
    cin >> n >> m;
    vvi tmp(n,vi(n,0));
    REP(i,m) {
        int x,y;
        cin >> x >> y;
        x--;y--;
        tmp[x][y] = tmp[y][x] = 1;
    }
    REP(i,n)tmp[i][i] = 1;

    int maxi=0;

    REP(i,1<<n){
        vi id;
        REP(j,n) if(i & (1<<j)) id.pb(j);

        bool f=true;
        REP(j,id.size()){
            REP(k,id.size()){
                if(tmp[id[j]][id[k]]==0) f=false;
            }
        }
        if(f)maxi=max(maxi,(int)id.size());
    }

    cout << maxi << endl;
    
    return 0;
}

Submission Info

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

Judge Result

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