Submission #6901126


Source Code Expand

Copy
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <stdlib.h>
#include <string.h>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <stdio.h>
#include <tuple>
#include <bitset>
#include <cfloat>
#include <fstream>
#include <limits.h>
#include <list>
#include <math.h>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <numeric>
#include <utility>
// *テンプレート*
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
const long long MOD = 1000000007;
const long long INF = 0x3f3f3f3f;
using namespace std;
typedef long long ll;
map<int, int> mp;
using Graph = vector<vector<int>>; 
//最大公約数
ll gcd(ll a, ll b) {
	if (a < b)swap(a, b);
	if (b == 0) return a;
	return gcd(b, a % b);
}
//最小公倍数
ll lcm(ll a, ll b) {
	ll g = gcd(a, b);
	return a / g * b;
}

// *テンプレートここまで*

// pair -> vector<pair<int,int>> 
//		   AandB.push_back(make_pair(a[i],b[i]))

int n, m, f[12][12] = { 0 }, ans = 0;
void dfs(vector<int>v, int k = 0) {
	if (k == n) {
		for (int i = 0; i < v.size(); i++) {
			for (int j = i + 1; j < v.size(); j++) {
				if (f[v[i]][v[j]] == 0) {
					return;
				}
			}
		}
		ans = max(ans, (int)v.size());
	}
	else {
		dfs(v, k + 1);
		v.push_back(k);
		dfs(v, k + 1);
		v.pop_back();
	}
}
signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 0; i < m; i++) {
		int x, y; cin >> x >> y;
		x--; y--;
		f[x][y] = f[y][x] = 1;
	}
	vector<int>v;
	dfs(v);
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task D - 派閥
User Example
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2023 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 2 ms 256 KB
00_sample_02.txt 2 ms 256 KB
00_sample_03.txt 2 ms 256 KB
00_sample_04.txt 2 ms 256 KB
test_01.txt 2 ms 256 KB
test_02.txt 2 ms 256 KB
test_03.txt 2 ms 256 KB
test_04.txt 2 ms 256 KB
test_05.txt 2 ms 256 KB
test_06.txt 2 ms 256 KB
test_07.txt 2 ms 256 KB
test_08.txt 2 ms 256 KB
test_09.txt 2 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 2 ms 256 KB
test_14.txt 2 ms 256 KB
test_15.txt 2 ms 256 KB
test_16.txt 2 ms 256 KB
test_17.txt 2 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 2 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 2 ms 256 KB
test_26.txt 2 ms 256 KB
test_27.txt 2 ms 256 KB
test_28.txt 2 ms 256 KB
test_29.txt 2 ms 256 KB
test_30.txt 2 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 2 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