oj.uz

Submission #43839

# Submission time Handle Problem Language Result Execution time Memory
43839 2018-03-25T09:35:46 Z heon Geppetto (COCI15_geppetto) C++11
80 / 80
 6 ms 552 KB 
#include<bits/stdc++.h>

using namespace std;

int n,m;
vector <int> relation[25];
bool bio[25];

int solve(int a){
	if(a == n) return 1;
	int ret = solve(a+1);
	bool ok = 1;
	for(auto x : relation[a]){
		if(bio[x]) ok = 0;
	}
	if(ok){
		bio[a] = 1;
		ret += solve(a+1);
		bio[a] = 0;
	}
	return ret;
}

int main(){
	cin >> n >> m;
	for(int i = 0; i < m; i++){
		int a,b;
		cin >> a >> b;
		a--,b--;
		relation[a].push_back(b);
		relation[b].push_back(a);
	}
	cout << solve(0);
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 2 ms 552 KB Output is correct
4 Correct 1 ms 552 KB Output is correct
5 Correct 1 ms 552 KB Output is correct
6 Correct 1 ms 552 KB Output is correct
7 Correct 1 ms 552 KB Output is correct
8 Correct 1 ms 552 KB Output is correct
9 Correct 4 ms 552 KB Output is correct
10 Correct 6 ms 552 KB Output is correct