10792022-02-28 07:45:13vandrasBlokk eliminációcpp14Wrong answer 9/5021ms12608 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();
		vector<int> v;

		int len = 1;
		for(int i = 1; i < n; ++i){
			if(s[i] != s[i-1]){
				v.pb((len>1));
				len = 1;
			}else ++len;
		}
		v.pb((len>1));
		n = v.size();
		bool ok = 0;

		int mxl = -1, mnr = n+1;
		for(int i = 0; i < n; ++i){
			if(i%2==0 && v[i/2]) mnr = min(mnr, i);
			if(i%2==!(n%2) && v[(n-1+i)/2]) mxl = max(mxl, i);
		}

		if(mxl > mnr){
			int lside = mnr/2, rside = (n-1+mxl)/2;
			int dist = mxl-mnr-1;
			for(int i = lside+1; i < rside; ++i){
				//left side : mnr
				//right side mxl

				if(!v[i]) continue;

				int l, r, dl = (i-lside), dr=(rside-i);	

				if(dl > dr) swap(dl, dr);
				//dl <= dr
				if(2*dl >= dist) ok = 1;
			}
		}else if(n%2==1 && mnr != n+1 && mxl != -1) ok = 1;

		cout << (ok ? "IGEN\n" : "NEM\n");
	}

	return 0;
}
SubtaskSumTestVerdictTimeMemory
base9/50
1Accepted0/02ms1756 KiB
2Wrong answer0/017ms6356 KiB
3Accepted2/21ms2848 KiB
4Accepted2/21ms2848 KiB
5Wrong answer0/21ms2852 KiB
6Wrong answer0/21ms2852 KiB
7Wrong answer0/21ms2860 KiB
8Wrong answer0/21ms2864 KiB
9Wrong answer0/21ms2868 KiB
10Accepted2/21ms2876 KiB
11Wrong answer0/21ms2896 KiB
12Wrong answer0/21ms2912 KiB
13Wrong answer0/21ms2924 KiB
14Wrong answer0/23ms3424 KiB
15Wrong answer0/32ms3476 KiB
16Wrong answer0/33ms3516 KiB
17Wrong answer0/321ms8136 KiB
18Wrong answer0/316ms8852 KiB
19Wrong answer0/317ms9660 KiB
20Accepted3/317ms11036 KiB
21Wrong answer0/414ms11796 KiB
22Wrong answer0/417ms12608 KiB