Submission #1046290
Source Code Expand
#include <algorithm> #include <iostream> #include <string> #include <cstring> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> #include <deque> #include <iomanip> #include <limits> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <iterator> #include <queue> #include <stack> #include <vector> #include <utility> #define FOR(i,k,n) for(int (i) = (k); (i) < (n); ++(i)) #define rep(i,n) FOR(i,0,n) #define pb push_back #define mp make_pair #define fst first #define snd second #define all(v) begin(v), end(v) #define debug(x) cerr << #x << ": " << x << endl #define debug2(x,y) cerr << #x << ": " << x << ", " << #y << ": " << y << endl using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> i_i; typedef pair<i_i, int> p_i; typedef vector<int> vi; typedef vector< vector<int> > vvi; template<class T> using vv=vector< vector<T> >; typedef deque<int> di; typedef deque< deque<int> > ddi; int main() { int N, M; while(cin >> N >> M) { vvi mat = vvi(N, vi(N, 0)); rep(i,M) { int x, y; cin >> x >> y; mat[x-1][y-1] = 1; mat[y-1][x-1] = 1; } int m = 1; FOR(i, 1, 1<<N) { bool flag = false; int count = 0; rep(j,N) { FOR(k,j+1,N) { if((i & (1 << j)) && (i & (1 << k))) { if(!mat[j][k]) { flag = true; count = 0; break; } } } if(i & (1 << j)) count++; if(flag) { break; } } if(!flag) { m = max(m,count); } } cout << m << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 派閥 |
User | tottotetotem |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 2001 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 932 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 | 19 ms | 720 KB |
00_sample_02.txt | AC | 16 ms | 676 KB |
00_sample_03.txt | AC | 18 ms | 804 KB |
00_sample_04.txt | AC | 16 ms | 800 KB |
test_01.txt | AC | 18 ms | 740 KB |
test_02.txt | AC | 19 ms | 800 KB |
test_03.txt | AC | 17 ms | 932 KB |
test_04.txt | AC | 16 ms | 800 KB |
test_05.txt | AC | 18 ms | 928 KB |
test_06.txt | AC | 18 ms | 800 KB |
test_07.txt | AC | 16 ms | 804 KB |
test_08.txt | AC | 18 ms | 800 KB |
test_09.txt | AC | 17 ms | 804 KB |
test_10.txt | AC | 16 ms | 800 KB |
test_11.txt | AC | 18 ms | 676 KB |
test_12.txt | AC | 18 ms | 804 KB |
test_13.txt | AC | 18 ms | 720 KB |
test_14.txt | AC | 17 ms | 800 KB |
test_15.txt | AC | 18 ms | 676 KB |
test_16.txt | AC | 18 ms | 800 KB |
test_17.txt | AC | 18 ms | 804 KB |
test_18.txt | AC | 18 ms | 804 KB |
test_19.txt | AC | 18 ms | 804 KB |
test_20.txt | AC | 19 ms | 804 KB |
test_21.txt | AC | 18 ms | 804 KB |
test_22.txt | AC | 18 ms | 800 KB |
test_23.txt | AC | 19 ms | 796 KB |
test_24.txt | AC | 19 ms | 804 KB |
test_25.txt | AC | 18 ms | 800 KB |
test_26.txt | AC | 18 ms | 672 KB |
test_27.txt | AC | 18 ms | 676 KB |
test_28.txt | AC | 18 ms | 800 KB |
test_29.txt | AC | 18 ms | 712 KB |
test_30.txt | AC | 18 ms | 804 KB |
test_31.txt | AC | 19 ms | 796 KB |
test_32.txt | AC | 19 ms | 676 KB |
test_33.txt | AC | 19 ms | 804 KB |
test_34.txt | AC | 18 ms | 804 KB |
test_35.txt | AC | 18 ms | 932 KB |
test_36.txt | AC | 19 ms | 676 KB |
test_37.txt | AC | 18 ms | 796 KB |
test_38.txt | AC | 19 ms | 800 KB |
test_39.txt | AC | 18 ms | 672 KB |
test_40.txt | AC | 18 ms | 800 KB |
test_41.txt | AC | 19 ms | 804 KB |
test_42.txt | AC | 19 ms | 804 KB |
test_43.txt | AC | 19 ms | 804 KB |
test_44.txt | AC | 18 ms | 800 KB |
test_45.txt | AC | 18 ms | 800 KB |
test_46.txt | AC | 19 ms | 800 KB |
test_47.txt | AC | 19 ms | 800 KB |
test_48.txt | AC | 19 ms | 800 KB |
test_49.txt | AC | 19 ms | 804 KB |
test_50.txt | AC | 18 ms | 676 KB |
test_51.txt | AC | 18 ms | 804 KB |
test_52.txt | AC | 18 ms | 672 KB |
test_53.txt | AC | 18 ms | 928 KB |
test_54.txt | AC | 18 ms | 800 KB |
test_55.txt | AC | 18 ms | 804 KB |
test_56.txt | AC | 18 ms | 932 KB |
test_57.txt | AC | 18 ms | 932 KB |
test_58.txt | AC | 19 ms | 676 KB |
test_59.txt | AC | 18 ms | 800 KB |
test_60.txt | AC | 17 ms | 796 KB |
test_61.txt | AC | 19 ms | 844 KB |
test_62.txt | AC | 16 ms | 804 KB |
test_63.txt | AC | 18 ms | 800 KB |
test_64.txt | AC | 16 ms | 804 KB |
test_65.txt | AC | 18 ms | 804 KB |
test_66.txt | AC | 18 ms | 804 KB |
test_67.txt | AC | 19 ms | 924 KB |
test_68.txt | AC | 18 ms | 800 KB |
test_69.txt | AC | 18 ms | 804 KB |
test_70.txt | AC | 18 ms | 804 KB |