//Sylwia Sapkowska #include <bits/stdc++.h> #pragma GCC optimize("O3", "unroll-loops") using namespace std; void __print(int x) {cerr << x;} void __print(long long x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << "'" << x << "'";} void __print(const char *x) {cerr << '"' << x << '"';} void __print(const string &x) {cerr << '"' << x << '"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef LOCAL #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else #define debug(x...) #endif #define int long long typedef pair<int, int> T; const int oo = 1e18; void solve(){ int n, m; cin >> n >> m; vector<T>what(m); for (auto &[a, b]: what) { cin >> a >> b; --a;--b; } vector<int>ans(n+1); for (int mask = 1; mask < (1ll<<n); mask++){ int on = mask; for (auto &[a, b]: what){ if (on&(1ll<<a) && (!(on&(1ll<<b)))){ on -= (1ll<<a); on += (1ll<<b); } } //sprawdzic czy przedzial int l = oo, r = -oo; for (int i = 0; i<n; i++){ if (on&(1ll<<i)) { l = min(l, i); r = max(r, i); } } int b = __builtin_popcountll(mask); if (r-l+1 == b){ ans[b]^=1; } } for (int i = 1; i<=n; i++) cout << ans[i] << " "; cout << "\n"; } int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); 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 | //Sylwia Sapkowska #include <bits/stdc++.h> #pragma GCC optimize("O3", "unroll-loops") using namespace std; void __print(int x) {cerr << x;} void __print(long long x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << "'" << x << "'";} void __print(const char *x) {cerr << '"' << x << '"';} void __print(const string &x) {cerr << '"' << x << '"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef LOCAL #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else #define debug(x...) #endif #define int long long typedef pair<int, int> T; const int oo = 1e18; void solve(){ int n, m; cin >> n >> m; vector<T>what(m); for (auto &[a, b]: what) { cin >> a >> b; --a;--b; } vector<int>ans(n+1); for (int mask = 1; mask < (1ll<<n); mask++){ int on = mask; for (auto &[a, b]: what){ if (on&(1ll<<a) && (!(on&(1ll<<b)))){ on -= (1ll<<a); on += (1ll<<b); } } //sprawdzic czy przedzial int l = oo, r = -oo; for (int i = 0; i<n; i++){ if (on&(1ll<<i)) { l = min(l, i); r = max(r, i); } } int b = __builtin_popcountll(mask); if (r-l+1 == b){ ans[b]^=1; } } for (int i = 1; i<=n; i++) cout << ans[i] << " "; cout << "\n"; } int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); return 0; } |