# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1022325 | vjudge1 | Hiperkocka (COCI21_hiperkocka) | C++17 | 63 ms | 3684 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;
const int M = 17;
vector<int> nei[M];
int path[M],x;
void dfs(int u,int p=-1)
{
for (int i:nei[u])
if (i!=p)
{
path[i]=path[u]^(1<<x++);
dfs(i,u);
}
}
int main()
{
int n;
cin>>n;
for (int i=0;i<n;i++)
{
int u,v;
cin>>u>>v;
nei[u].push_back(v);
nei[v].push_back(u);
}
dfs(0);
cout<<(1<<n-1)<<'\n';
for (int i=0;i<(1<<n);i++)
{
if (__builtin_popcount(i) & 1)
continue;
for (int u=0;u<=n;u++)
cout<<(i^path[u])<<' ';
cout<<'\n';
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |