# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88652 | 2018-12-07T08:52:03 Z | asifthegreat | Geppetto (COCI15_geppetto) | C++14 | 231 ms | 524 KB |
#include <bits/stdc++.h> using namespace std; int ans; int n,m; vector<int>subset; vector<int>v[100]; int mp[2000000]; 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(find(v[subset[i]].begin(),v[subset[i]].end(),subset[j]) != v[subset[i]].end()){ 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); //set<pair<int,int>>st; for(int i = 1; i <= m;i++){ scanf("%d%d",&a,&b); v[a].push_back(b); v[b].push_back(a); } go(1); cout << ans << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 476 KB | Output is correct |
3 | Correct | 20 ms | 500 KB | Output is correct |
4 | Correct | 21 ms | 500 KB | Output is correct |
5 | Correct | 23 ms | 500 KB | Output is correct |
6 | Correct | 32 ms | 500 KB | Output is correct |
7 | Correct | 36 ms | 500 KB | Output is correct |
8 | Correct | 42 ms | 516 KB | Output is correct |
9 | Correct | 106 ms | 516 KB | Output is correct |
10 | Correct | 231 ms | 524 KB | Output is correct |