//#pragma GCC optimize("O3") //#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #include <bits/stdc++.h> using namespace std; // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // namespace debug { template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> char elo(...); template <class c> auto elo(c* a) -> decltype(cerr << *a, 0); struct stream { ~stream() { cerr << endl; } template <class c> typename enable_if <sizeof elo<c>(0) != 1, stream&>::type operator<<(c i) { cerr << boolalpha << i; return *this; } template <class c> typename enable_if <sizeof elo<c>(0) == 1, stream&>::type operator<<(c i) { return *this << range(begin(i), end(i)); } template <class a, class b> stream& operator<<(pair <a,b> p) { return *this << "(" << p.first << ", " << p.second << ")"; } template <class c> stream& operator<<(rge<c> d) { *this << "["; for (auto it=d.b; it!=d.e; it++) *this << ", " + 2 * (it == d.b) << *it; return *this << "]"; } stream& _dbg(const string& s, int i, int b) { return *this; } template <class c, class ... cs> stream& _dbg(const string& s, int i, int b, c arg, cs ... args) { if (i == s.size()) return (*this << ": " << arg << ""); b += (s[i] == '(') + (s[i] == '[') + (s[i] == '{'); b -= (s[i] == ')') + (s[i] == ']') + (s[i] == '}'); if (s[i] == ',' && b == 0) return (*this << ": " << arg << " ")._dbg(s, i+1, b, args...); return (s[i] == ' ' ? *this : *this << s[i])._dbg(s, i+1, b, arg, args...); } };} #define dout debug::stream() #define dbg(...) ((dout << ">> ")._dbg(#__VA_ARGS__, 0, 0, __VA_ARGS__)) // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // #define f first #define s second #define sc scanf #define pr printf #define mp make_pair #define pb push_back #define all(x) x.begin(),x.end() #define ss(x) ((int)((x).size())) #define rep0(i, b) for(int (i)=(0);i<(b);(i)++) #define rep1(i, b) for(int (i)=(1);i<=(b);(i)++) #define rep(i, a, b) for(int (i)=(a);i<=(b);(i)++) #define per(i, a, b) for(int (i)=(b);i>=(a);(i)--) #define lowb(v, x) (lower_bound(all(v),(x))-(v).begin()) #define uppb(v, x) (upper_bound(all(v),(x))-(v).begin()) #define upgrade ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define erase_duplicates(x) {sort(all(x));(x).resize(distance((x).begin(), unique(all(x))));} template <class p, class q> pair<p,q> operator-(pair<p,q> a, pair<p,q> b) { return mp(a.f-b.f, a.s-b.s); } template <class p, class q> pair<p,q> operator+(pair<p,q> a, pair<p,q> b) { return mp(a.f+b.f, a.s+b.s); } template <class p, class q> void umin(p& a, const q& b) { if (a > b) a = b; } template <class p, class q> void umax(p& a, const q& b) { if (a < b) a = b; } using lf=long double; using ll=long long; using cll=const ll; using cint=const int; using pll=pair<ll,ll>; using pii=pair<int,int>; // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // const int N = 1000005; char s[N]; int main (){ int n; scanf("%d", &n); scanf("%s", s + 1); int bil = 0; int len = strlen(s + 1); assert(len == 8 * n); rep(i, 1, len){ if (s[i] == '0') bil -= 1; if (s[i] == '1') bil += 1; } bil /= 2; string out = ""; while (n--){ if (bil < 0){ out += 'a'; bil += 1; continue; } if (bil == 0){ out += 'c'; continue; } if (bil == 1){ out += 'g'; bil -= 1; continue; } if (bil >= 2){ out += 'o'; bil -= 2; continue; } } if (bil != 0){ printf("NIE\n"); }else{ printf("%s\n", out.c_str()); } 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 91 92 93 94 95 96 97 98 99 100 101 102 103 104 | //#pragma GCC optimize("O3") //#pragma GCC optimize("Ofast") //#pragma GCC optimize("unroll-loops") //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #include <bits/stdc++.h> using namespace std; // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // namespace debug { template <class c> struct rge { c b, e; }; template <class c> rge<c> range(c i, c j) { return rge<c>{i, j}; } template <class c> char elo(...); template <class c> auto elo(c* a) -> decltype(cerr << *a, 0); struct stream { ~stream() { cerr << endl; } template <class c> typename enable_if <sizeof elo<c>(0) != 1, stream&>::type operator<<(c i) { cerr << boolalpha << i; return *this; } template <class c> typename enable_if <sizeof elo<c>(0) == 1, stream&>::type operator<<(c i) { return *this << range(begin(i), end(i)); } template <class a, class b> stream& operator<<(pair <a,b> p) { return *this << "(" << p.first << ", " << p.second << ")"; } template <class c> stream& operator<<(rge<c> d) { *this << "["; for (auto it=d.b; it!=d.e; it++) *this << ", " + 2 * (it == d.b) << *it; return *this << "]"; } stream& _dbg(const string& s, int i, int b) { return *this; } template <class c, class ... cs> stream& _dbg(const string& s, int i, int b, c arg, cs ... args) { if (i == s.size()) return (*this << ": " << arg << ""); b += (s[i] == '(') + (s[i] == '[') + (s[i] == '{'); b -= (s[i] == ')') + (s[i] == ']') + (s[i] == '}'); if (s[i] == ',' && b == 0) return (*this << ": " << arg << " ")._dbg(s, i+1, b, args...); return (s[i] == ' ' ? *this : *this << s[i])._dbg(s, i+1, b, arg, args...); } };} #define dout debug::stream() #define dbg(...) ((dout << ">> ")._dbg(#__VA_ARGS__, 0, 0, __VA_ARGS__)) // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // #define f first #define s second #define sc scanf #define pr printf #define mp make_pair #define pb push_back #define all(x) x.begin(),x.end() #define ss(x) ((int)((x).size())) #define rep0(i, b) for(int (i)=(0);i<(b);(i)++) #define rep1(i, b) for(int (i)=(1);i<=(b);(i)++) #define rep(i, a, b) for(int (i)=(a);i<=(b);(i)++) #define per(i, a, b) for(int (i)=(b);i>=(a);(i)--) #define lowb(v, x) (lower_bound(all(v),(x))-(v).begin()) #define uppb(v, x) (upper_bound(all(v),(x))-(v).begin()) #define upgrade ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define erase_duplicates(x) {sort(all(x));(x).resize(distance((x).begin(), unique(all(x))));} template <class p, class q> pair<p,q> operator-(pair<p,q> a, pair<p,q> b) { return mp(a.f-b.f, a.s-b.s); } template <class p, class q> pair<p,q> operator+(pair<p,q> a, pair<p,q> b) { return mp(a.f+b.f, a.s+b.s); } template <class p, class q> void umin(p& a, const q& b) { if (a > b) a = b; } template <class p, class q> void umax(p& a, const q& b) { if (a < b) a = b; } using lf=long double; using ll=long long; using cll=const ll; using cint=const int; using pll=pair<ll,ll>; using pii=pair<int,int>; // ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ // const int N = 1000005; char s[N]; int main (){ int n; scanf("%d", &n); scanf("%s", s + 1); int bil = 0; int len = strlen(s + 1); assert(len == 8 * n); rep(i, 1, len){ if (s[i] == '0') bil -= 1; if (s[i] == '1') bil += 1; } bil /= 2; string out = ""; while (n--){ if (bil < 0){ out += 'a'; bil += 1; continue; } if (bil == 0){ out += 'c'; continue; } if (bil == 1){ out += 'g'; bil -= 1; continue; } if (bil >= 2){ out += 'o'; bil -= 2; continue; } } if (bil != 0){ printf("NIE\n"); }else{ printf("%s\n", out.c_str()); } return 0; } |