# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81638 | xiaowuc1 | Geppetto (COCI15_geppetto) | C++14 | 64 ms | 652 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>
/*
unsigned seed1 = std::chrono::system_clock::now().time_since_epoch().count();
mt19937 g1.seed(seed1);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
*/
using namespace std;
const double PI = 2 * acos(0);
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<int, ll> pill;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<vector<ll>> matrix;
int adj[25];
int main() {
int n, m;
scanf("%d%d", &n, &m);
while(m--) {
int a, b;
scanf("%d%d", &a, &b);
a--;
b--;
adj[a] |= 1 << b;
adj[b] |= 1 << a;
}
int r = 0;
for(int mask = 0; mask < (1<<n); mask++) {
bool bad = false;
for(int i = 0; i < n && !bad; i++) {
bad |= (mask&(1<<i)) && (mask&adj[i]);
}
if(!bad) {
r++;
}
}
printf("%d\n", r);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |