Submission #111567

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pLl;
typedef pair<ull,ull> pUll;

#define FOR(i,fi,co) for(int i=fi;i<co;i++)
#define rep(i,co) FOR(i,0,co)
#ifndef _DEBUG
	#define repI(x,a) for(__typeof(a.begin()) x=a.begin();x!=a.end();x++)
#else
	#define repI(x,a) for(decltype(a.begin()) x=a.begin();x!=a.end();x++)
#endif
#define all(a) (a).begin(), (a).end()
#define mp(a,b) make_pair((a),(b))
#define F first
#define S second
#define zero(a) memset(a,0,sizeof(a))
void _fillInt(int* p,int val,int rep){rep(i,rep)p[i]=val;}
#define fillInt(a,val) _fillInt((int*)a,val,sizeof(a)/sizeof(int))

template <class T>T sqr(T val){return val*val;}

#define _usescanf

int n,m;

set<int> Product(set<int>& rsettA, set<int>&rsettB) {
    set<int> settProduct;
    for (set<int>::iterator itt = rsettB.begin(); itt != rsettB.end(); itt++) {
        if (rsettA.find(*itt) != rsettA.end()) {
            settProduct.insert(*itt);
        }
    }
    return settProduct;
}



void answer(){
	cin >> n >> m;
	map<int,set<int> > ttka;
	rep(i,m){
		int a,b;
		cin >> a>> b;
		ttka[a-1].insert(b-1);
		ttka[b-1].insert(a-1);
	}
	rep(i,n){
		ttka[i].insert(i);
	}
	int ans = 0;
	rep(i,n){
		set<int> tmp;
		tmp = ttka[i];
		repI(x,ttka[i]){
			tmp = Product(ttka[*x],tmp);
		}
		ans = (ans< tmp.size())?tmp.size():ans;
	}
	if(ans == 0){
		ans = 1;
	}
	
	cout << ans << "\n" ;
}


int main(int argc,char**arcv){
#ifdef _DEBUG
	freopen("in.txt","r",stdin);
	freopen("answer.txt","w",stdout);
	ios::sync_with_stdio(false);
	int n;
#ifdef usescanf
	scanf("%d",&n);
#else
	cin >> n;
#endif
	rep(i,n){
		answer();
		cout << '\n';
	}
	fclose(stdin);
	fclose(stdout);
#else
	ios::sync_with_stdio(false);
	answer();
#endif
	return 0;
}

Submission Info

Judge Result