# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
88651 | 2018-12-07T08:43:50 Z | asifthegreat | Geppetto (COCI15_geppetto) | C++14 | 1000 ms | 720 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]}]){ //cout << "ailo to :hmm: \n"; 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); mp[{a,b}]++; } go(1); cout << ans << endl; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 380 KB | Output is correct |
3 | Correct | 41 ms | 568 KB | Output is correct |
4 | Correct | 47 ms | 568 KB | Output is correct |
5 | Correct | 82 ms | 568 KB | Output is correct |
6 | Correct | 101 ms | 668 KB | Output is correct |
7 | Correct | 157 ms | 676 KB | Output is correct |
8 | Correct | 189 ms | 692 KB | Output is correct |
9 | Correct | 520 ms | 704 KB | Output is correct |
10 | Execution timed out | 1080 ms | 720 KB | Time limit exceeded |