Submission #3818111


Source Code Expand

#include<iostream>
#include<algorithm>
using namespace std;

int maxnum = 0;
void dfs(int person[12], int i, int mask, int n, int num);

int main() {
	int n, m, x, y, person[12] = {0};
	cin >> n >> m;
	for(int i = 0; i < m; i++){
		cin >> x >> y;
		person[x-1] = person[x-1] | (1 << (y-1));
		person[y-1] = person[y-1] | (1 << (x-1));
	}
	dfs(person, 0, 0, n, 0);
	cout << maxnum << endl;
	return 0;
}

void dfs(int person[12], int i, int mask, int n, int num){
	if(i == n-1){
		maxnum = num > maxnum ? num:maxnum;
		return;
	}
	bool flag = true;
	for(int j = 0; j < i; j++){
		if((mask >> j) & 1){
			if((person[i] >> j) & 1)	continue;
			else	flag = false;
		}
	}
	if(flag)	dfs(person, i+1, mask|(1 << i), n, num + 1);
	dfs(person, i+1, mask, n, num);
	return;
}

Submission Info

Submission Time
Task D - 派閥
User waewae96
Language C++14 (GCC 5.4.1)
Score 0
Code Size 799 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

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