# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
603947 | inksamurai | Geppetto (COCI15_geppetto) | C++17 | 23 ms | 4436 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=(c);i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3aFGabX ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
signed main(){
_3aFGabX;
int n,m;
cin>>n>>m;
vi dp(1<<n);
rep(i,m){
int u,v;
cin>>u>>v;
u-=1,v-=1;
dp[(1<<u)|(1<<v)]=1;
}
rep(j,n){
rep(msk,(1<<n)){
if(msk>>j&1){
dp[msk]+=dp[msk^(1<<j)];
}
}
}
int res=0;
rep(msk,(1<<n)){
res+=(dp[msk]==0);
}
print(res);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |