Submission #154042

#TimeUsernameProblemLanguageResultExecution timeMemory
154042jvalsortavGeppetto (COCI15_geppetto)C++14
32 / 80
1078 ms48544 KiB
#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() { 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;*/ s.insert(i); } } } cout << l - s.size(); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...