10432022-02-27 12:33:20vandrasBlokk eliminációcpp14Wrong answer 4/5028ms10212 KiB
#include <bits/stdc++.h>
using namespace std;

/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

tem T>
string _ARR_(T* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array

const int INF = 1e9+7;

int main(void)
{
	FAST;
	TC{
		string s; cin >> s;
		int n = s.size();
		stack<char> st;
		int len = 1;

		for(int i = 1; i < n; ++i){
			if(s[i] != s[i-1]){
				if(len == 1){
					if(s[i-1] == '1'){
						while(st.size() && st.top() == ')') st.pop();
						if(st.size() && (st.top() == '>' || st.top() == '<')) st.pop();
						else st.push('<');
					}else{
						while(st.size() && st.top() == '>') st.pop();
						if(st.size() && (st.top() == ')' || st.top() == '(') ) st.pop();
						else st.push('(');
					}
				}else{
					while(st.size() && (st.top() == '>' || st.top() == ')')) st.pop();
					if(s[i-1] == '1'){
						if(st.size() && st.top() == '<') st.pop();
						else st.push('>');
					}else{
						if(st.size() && st.top() == '(') st.pop();
						else st.push(')');
					}
				}
				len = 1;
			}else ++len; 
		}

				if(len == 1){
					if(s[n-1] == '1'){
						while(st.size() && st.top() == ')') st.pop();
						if(st.size() && (st.top() == '>' || st.top() == '<')) st.pop();
						else st.push('<');
					}else{
						while(st.size() && st.top() == '>') st.pop();
						if(st.size() && (st.top() == ')' || st.top() == '(') ) st.pop();
						else st.push('(');
					}
				}else{
					while(st.size() && (st.top() == '>' || st.top() == ')')) st.pop();
					if(s[n-1] == '1'){
						if(st.size() && st.top() == '<') st.pop();
						else st.push('>');
					}else{
						if(st.size() && st.top() == '(') st.pop();
						else st.push(')');
					}
				}

		while(st.size() && (st.top() == '>' || st.top() == ')')) st.pop();

		cout << (st.empty() ? "IGEN" : "NEM") << '\n';
	}

	return 0;
}

SubtaskSumTestVerdictTimeMemory
base4/50
1Accepted0/02ms1752 KiB
2Wrong answer0/014ms3884 KiB
3Accepted2/21ms2848 KiB
4Wrong answer0/21ms2844 KiB
5Wrong answer0/21ms2848 KiB
6Wrong answer0/21ms2856 KiB
7Wrong answer0/21ms2860 KiB
8Wrong answer0/21ms2864 KiB
9Wrong answer0/21ms2864 KiB
10Accepted2/21ms2872 KiB
11Wrong answer0/21ms2880 KiB
12Wrong answer0/21ms2896 KiB
13Wrong answer0/21ms2912 KiB
14Wrong answer0/22ms3108 KiB
15Wrong answer0/32ms3204 KiB
16Wrong answer0/32ms3304 KiB
17Wrong answer0/314ms5316 KiB
18Wrong answer0/314ms6372 KiB
19Wrong answer0/328ms7264 KiB
20Wrong answer0/316ms8272 KiB
21Wrong answer0/414ms9328 KiB
22Wrong answer0/417ms10212 KiB