#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;
set <int> s;
int main() {
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;*/
s.insert(i);
}
}
}
cout << l - s.size();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
376 KB |
Output is correct |
2 |
Correct |
4 ms |
380 KB |
Output is correct |
3 |
Execution timed out |
1069 ms |
47968 KB |
Time limit exceeded |
4 |
Execution timed out |
1069 ms |
47968 KB |
Time limit exceeded |
5 |
Execution timed out |
1055 ms |
47968 KB |
Time limit exceeded |
6 |
Execution timed out |
1006 ms |
48244 KB |
Time limit exceeded |
7 |
Execution timed out |
1035 ms |
48244 KB |
Time limit exceeded |
8 |
Execution timed out |
1036 ms |
48244 KB |
Time limit exceeded |
9 |
Correct |
853 ms |
48244 KB |
Output is correct |
10 |
Correct |
247 ms |
48244 KB |
Output is correct |