# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88634 | 2018-12-07T08:13:42 Z | asifthegreat | Geppetto (COCI15_geppetto) | C++14 | 2 ms | 540 KB |
#include <bits/stdc++.h> using namespace std; int ans; int n,m; vector<int>subset; bitset<2000000>vis; int parent[2000000]; map<pair<int,int>,int>mp; void go(int i) { if(i == n+1){ int size = subset.size(); for(int i = 0; i < size;i++){ for(int j = 0; j < size;j++){ if(i == j)continue; if(mp[{subset[i],subset[j]}]){ ans--;return; } } } return; } if(i > 10000){ cout << "sed lyf\n";exit(0); } go(i+1); subset.push_back(i); go(i+1); subset.pop_back(); } int main() { scanf("%d%d",&n,&m); for(int i = 0; i <= n;i++)parent[i] = i; int a,b; ans = 1<<(n-1); //set<pair<int,int>>st; for(int i = 1; i <= m;i++){ scanf("%d%d",&a,&b); mp[{a,b}]++; } cout << ans << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Incorrect | 2 ms | 472 KB | Output isn't correct |
3 | Incorrect | 2 ms | 472 KB | Output isn't correct |
4 | Incorrect | 2 ms | 536 KB | Output isn't correct |
5 | Incorrect | 2 ms | 540 KB | Output isn't correct |
6 | Incorrect | 2 ms | 540 KB | Output isn't correct |
7 | Incorrect | 2 ms | 540 KB | Output isn't correct |
8 | Incorrect | 2 ms | 540 KB | Output isn't correct |
9 | Incorrect | 2 ms | 540 KB | Output isn't correct |
10 | Incorrect | 2 ms | 540 KB | Output isn't correct |