oj.uz

Submission #154042

# Submission time Handle Problem Language Result Execution time Memory
154042 2019-09-17T21:57:07 Z jvalsortav Geppetto (COCI15_geppetto) C++14
32 / 80
 1000 ms 48544 KB 
#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;
}

Subtask #1
32.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Execution timed out 1043 ms 47904 KB Time limit exceeded
4 Execution timed out 1075 ms 48112 KB Time limit exceeded
5 Execution timed out 1064 ms 47804 KB Time limit exceeded
6 Execution timed out 1078 ms 48544 KB Time limit exceeded
7 Execution timed out 1070 ms 47432 KB Time limit exceeded
8 Execution timed out 1031 ms 47184 KB Time limit exceeded
9 Correct 877 ms 46232 KB Output is correct
10 Correct 259 ms 28852 KB Output is correct