Submission #88003

#TimeUsernameProblemLanguageResultExecution timeMemory
88003jvalsortavGeppetto (COCI15_geppetto)C++14
0 / 80
1039 ms740 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 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 timeMemoryGrader output
Fetching results...