| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 919508 | TIN | Geppetto (COCI15_geppetto) | C++17 | 3 ms | 600 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define FNAME "test"
const int N = 21;
int n, m;
int res = 0;
bool ok[N];
vector<int> bad[N];
void Task() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cout << fixed << setprecision(9);
	if (fopen(FNAME".inp","r")) {
		freopen(FNAME".inp","r",stdin);
		freopen(FNAME".out","w",stdout);
	}
}
void sinh(int i, int p = 0) {
	res++;
	if (i == n + 1) {
		return;
	}
	for (int idx = p + 1; idx <= n; idx++) {
		if (ok[idx]) {
			for (int v : bad[idx]) ok[v] = false;
			sinh(i + 1, idx);
			for (int v : bad[idx]) ok[v] = true;
		}
	}
}
void Solve() {
	//Your Code
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int u, v;
		cin >> u >> v;
		bad[u].push_back(v);
		bad[v].push_back(u);
	}
	memset(ok, true, sizeof(ok));
	sinh(1);
	cout << res << '\n';
}
int main() {
	Task();
	Solve();
	cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms";
	return 37^37;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
