#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cctype>
#include <ctime>
#include <set>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <utility>
#include <string>
#include <map>
using namespace std;
int n, b, x, y, m, l, v;
int s[1048580];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
l = (1<<n);
b = l;
/*cout << s.size();*/
cin >> m;
for (int i = 0; i < m; i++){
cin >> x >> y;
for (int i = 0; i < l; i++){
if (i&(1<<(x-1)) and i&(1<<(y-1))){
/*cout << i << endl;*/
if (!s[i]) v++;
s[i]++;
}
}
}
cout << l - v;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
627 ms |
4572 KB |
Output is correct |
4 |
Correct |
346 ms |
4472 KB |
Output is correct |
5 |
Correct |
293 ms |
4480 KB |
Output is correct |
6 |
Correct |
115 ms |
4472 KB |
Output is correct |
7 |
Correct |
76 ms |
4472 KB |
Output is correct |
8 |
Correct |
93 ms |
4472 KB |
Output is correct |
9 |
Correct |
32 ms |
4472 KB |
Output is correct |
10 |
Correct |
12 ms |
3704 KB |
Output is correct |