oj.uz

Submission #88003

# Submission time Handle Problem Language Result Execution time Memory
88003 2018-12-03T11:11:10 Z jvalsortav Geppetto (COCI15_geppetto) C++14
0 / 80
 1000 ms 740 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 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;
}

Subtask #1
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 420 KB Output isn't correct
2 Incorrect 3 ms 420 KB Output isn't correct
3 Execution timed out 1039 ms 596 KB Time limit exceeded
4 Incorrect 881 ms 740 KB Output isn't correct
5 Incorrect 629 ms 740 KB Output isn't correct
6 Incorrect 222 ms 740 KB Output isn't correct
7 Incorrect 142 ms 740 KB Output isn't correct
8 Incorrect 142 ms 740 KB Output isn't correct
9 Incorrect 33 ms 740 KB Output isn't correct
10 Incorrect 8 ms 740 KB Output isn't correct