Submission #2703004
Source Code Expand
#include<bits/stdc++.h> #define fr(i,n) for(int i=0;i<(n);++i) #define foor(i,a,b) for(int i=(a);i<=(b);++i) #define rf(i,n) for(int i=(n);i--;) #define roof(i,b,a) for(int i=(b);i>=(a);--i) #define all(x) x.begin(),x.end() #define Sort(x) sort(all(x)) #define Reverse(x) reverse(all(x)) #define PQ priority_queue #define print(x) cout<<(x)<<endl using namespace std; typedef vector<int> vi; typedef long long ll; typedef vector< ll> vl; typedef unsigned long long ull; typedef vector<ull> vu; typedef double dbl; typedef vector<dbl> vd; typedef pair<int,int>pii; typedef vector<pii>vpii; typedef map<int,int>mii; typedef pair< ll, ll>pll; typedef vector<pll>vpll; typedef map< ll, ll>mll; typedef pair<dbl,dbl>pdd; typedef vector<pdd>vpdd; typedef map<dbl,dbl>mdd; typedef pair< ll,int>pli; typedef vector<pli>vpli; typedef map< ll,int>mli; typedef pair<dbl,int>pdi; typedef vector<pdi>vpdi; typedef map<dbl,int>mdi; template<typename T>vector<T>&operator<<(vector<T>&v,const T t){v.push_back(t);return v;} template<typename T>multiset<T>&operator<<(multiset<T>&m,const T t){m.insert(t);return m;} template<typename T>set<T>&operator<<(set<T>&s,const T t){s.insert(t);return s;} template<typename T,typename U>PQ<T,vector<T>,U>&operator<<(PQ<T,vector<T>,U>&q,const T t){q.push(t);return q;} template<typename T,typename U>istream&operator>>(istream&s,pair<T,U>&p){return s>>p.first>>p.second;} template<typename T>istream&operator>>(istream&s,vector<T>&v){fr(i,v.size()){s>>v[i];}return s;} template<typename T,typename U>ostream&operator<<(ostream&s,const pair<T,U>p){return s<<p.first<<" "<<p.second;} template<typename T>ostream&operator<<(ostream&s,const vector<T>v){for(auto a:v){s<<a<<endl;}return s;} const int MD=1e9+7; vpli dijkstra(const int N,const vpli E[],const int s,const ll inf){vpli d;fr(i,N)d<<pli{inf,i};d[s].first=0;PQ<pli,vpli,greater<pli>>pq;pq<<(d[s]=pli{0,s});while(pq.size()){pli a=pq.top();pq.pop();int v=a.second;if(d[v].first>=a.first){for(pli e:E[v]){if(d[v].first+e.first<d[e.second].first){d[e.second]=pli{d[v].first+e.first,v};pq<<pli{d[v].first+e.first,e.second};}}}}return d;} ll gcd(const ll a,const ll b){return a?gcd(b%a,a):b;} ll pow(const ll a,const ll n,const int m){ll t;return n?(n&1?a>=0?a%m:~-m+~a%m:1)*((t=pow(a,n>>1,m))*t%m)%m:1;} ll C2(const int n){return(ll)n*~-n/2;} int E[12][12]; main(){cin.tie(0);ios::sync_with_stdio(false); int N,M; cin>>N>>M; fr(i,M){ int x,y; cin>>x>>y; --x;--y; E[x][y]=E[y][x]=1; } int z=1; fr(i,1<<N){ vi v; fr(j,N){ if(i>>j&1)v<<j; } int f=1; fr(a,v.size()){ foor(b,a+1,v.size()-1){ f&=E[v[a]][v[b]]; } } if(f)z=max(z,(int)v.size()); } print(z); }
Submission Info
Submission Time | |
---|---|
Task | D - 派閥 |
User | x20 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2796 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
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 | 1 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 | 1 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 | 1 ms | 256 KB |
test_28.txt | AC | 1 ms | 256 KB |
test_29.txt | AC | 1 ms | 256 KB |
test_30.txt | AC | 1 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 | 1 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 |