# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88003 | jvalsortav | Geppetto (COCI15_geppetto) | C++14 | 1039 ms | 740 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 <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 mem[1048580];
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 j = 0; j < l; j++){
if (j&(1<<(x-1)) and j&(1<<(y-1))){
/*cout << i << endl;*/
s.insert(i);
}
}
}
if (m != 0) l--;
cout << l - s.size();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |