Submission #1022325

#TimeUsernameProblemLanguageResultExecution timeMemory
1022325vjudge1Hiperkocka (COCI21_hiperkocka)C++17
110 / 110
63 ms3684 KiB
#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)

Main.cpp: In function 'int main()':
Main.cpp:32:13: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   32 |  cout<<(1<<n-1)<<'\n';
      |            ~^~
#Verdict Execution timeMemoryGrader output
Fetching results...