제출 #1200311

#제출 시각아이디문제언어결과실행 시간메모리
1200311brover29Hiperkocka (COCI21_hiperkocka)C++17
110 / 110
26 ms8264 KiB
#include <bits/stdc++.h> //qwerty47924692 using namespace std; using ll = long long; const ll N=2e5+29; const string br="617283"; #define sz(a)(ll)a.size() #define f first #define s second ll n,num[N]; vector<pair<ll,ll>>g[N]; void dfs(ll v,ll pr=0,ll x=0){ num[v]=x; for(auto [to,i]:g[v]){ if(to==pr)continue; dfs(to,v,x^(1ll<<(i-1))); } } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin>>n; for(ll i=1;i<=n;i++){ ll v,u; cin>>v>>u; g[v].push_back({u,i}); g[u].push_back({v,i}); }dfs(0); cout<<(1ll<<(n-1))<<'\n'; for(ll i=0;i<=(1ll<<n)-1;i++){ if(__builtin_popcountll(i)&1)continue; for(ll j=0;j<=n;j++)cout<<(num[j]^i)<<' '; cout<<'\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...