// Karol Kosinski 2024 #include <bits/stdc++.h> #define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i) #define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i) #define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i) #define ALL(c) (c).begin(),(c).end() #define SIZE(c) int((c).size()) #define X first #define Y second #define endl '\n' #define NAM(x) #x,'=',x using namespace std; using LL = long long; using ULL = unsigned long long; using PII = pair<int, int>; using TIII = tuple<int, int, int>; template<class...T> void _cout(T...a){(cout<<...<<a);} #ifndef ENABLE_DEBUG #define DEB(k,p,f,x...) #else #define DEB(k,p,f,x...) {if(k)_cout("------",setw(4),__LINE__," : ",__FUNCTION__,endl);if(p)f(x);} #endif #define DEBF(f,x...) DEB(1,1,f,x) #define DEBL DEBF(void,0) #define DEBC(p,x...) DEB(0,p,_cout,x) #define DEBUG(x...) DEBC(1,x) constexpr int NX = 37; constexpr int MX = 1'005; PII E[MX]; int n, m, S[NX], Sol[NX], Res[NX]; void print_sol(int ones) { cout << "(" << ones << "): "; FOR(i,0,n) cout << Sol[i]; cout << endl; } void compute(int ones) { DEBF( print_sol, ones ); FOR(i,0,n) S[i] = Sol[i]; FOR(i,0,m) { auto& [a, b] = E[i]; if ( S[a] and not S[b] ) swap( S[a], S[b] ); } int c = S[0]; FOR(i,1,n) if ( S[ i - 1 ] != S[i] ) ++ c; if ( c < 3 ) ++ Res[ones]; } void solve(int ind, int ones) { if ( ind == n ) { compute(ones); return; } solve( ind + 1, ones ); Sol[ind] = 1; solve( ind + 1, ones + 1 ); Sol[ind] = 0; } void testcase() { cin >> n >> m; FOR(i,0,m) { int a, b; cin >> a >> b; E[i] = PII( a - 1, b - 1 ); } solve(0, 0); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); testcase(); DEBL; FR_(i,1,n) cout << ( Res[i] & 1 ) << ' '; cout << endl; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 | // Karol Kosinski 2024 #include <bits/stdc++.h> #define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i) #define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i) #define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i) #define ALL(c) (c).begin(),(c).end() #define SIZE(c) int((c).size()) #define X first #define Y second #define endl '\n' #define NAM(x) #x,'=',x using namespace std; using LL = long long; using ULL = unsigned long long; using PII = pair<int, int>; using TIII = tuple<int, int, int>; template<class...T> void _cout(T...a){(cout<<...<<a);} #ifndef ENABLE_DEBUG #define DEB(k,p,f,x...) #else #define DEB(k,p,f,x...) {if(k)_cout("------",setw(4),__LINE__," : ",__FUNCTION__,endl);if(p)f(x);} #endif #define DEBF(f,x...) DEB(1,1,f,x) #define DEBL DEBF(void,0) #define DEBC(p,x...) DEB(0,p,_cout,x) #define DEBUG(x...) DEBC(1,x) constexpr int NX = 37; constexpr int MX = 1'005; PII E[MX]; int n, m, S[NX], Sol[NX], Res[NX]; void print_sol(int ones) { cout << "(" << ones << "): "; FOR(i,0,n) cout << Sol[i]; cout << endl; } void compute(int ones) { DEBF( print_sol, ones ); FOR(i,0,n) S[i] = Sol[i]; FOR(i,0,m) { auto& [a, b] = E[i]; if ( S[a] and not S[b] ) swap( S[a], S[b] ); } int c = S[0]; FOR(i,1,n) if ( S[ i - 1 ] != S[i] ) ++ c; if ( c < 3 ) ++ Res[ones]; } void solve(int ind, int ones) { if ( ind == n ) { compute(ones); return; } solve( ind + 1, ones ); Sol[ind] = 1; solve( ind + 1, ones + 1 ); Sol[ind] = 0; } void testcase() { cin >> n >> m; FOR(i,0,m) { int a, b; cin >> a >> b; E[i] = PII( a - 1, b - 1 ); } solve(0, 0); } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); testcase(); DEBL; FR_(i,1,n) cout << ( Res[i] & 1 ) << ' '; cout << endl; return 0; } |