10542022-02-27 18:30:29vandrasBlokk eliminációcpp14Time limit exceeded 16/50344ms5352 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, dp;

		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();
		dp.resize(n, 0);
		debug() << exp(v);

		dp[0] = v[0];

		for(int i = 1; i < n; ++i){
			for(int j = i; j >= 0; j-=2){
				//seg from j to i

				int ok = v[(i+j)/2];
				ok &= (dp[j] || (j>0 ? dp[j-1] : 1));
				dp[i] = ok;
				if(dp[i]) break;
			}
		}

		cout << (dp[n-1] ? "IGEN\n" : "NEM\n");
	}

	return 0;
}
SubtaskSumTestVerdictTimeMemory
base16/50
1Accepted0/02ms1820 KiB
2Time limit exceeded0/0337ms2772 KiB
3Accepted2/21ms2260 KiB
4Accepted2/21ms2256 KiB
5Accepted2/21ms2260 KiB
6Accepted2/21ms2264 KiB
7Accepted2/21ms2276 KiB
8Accepted2/21ms2276 KiB
9Wrong answer0/21ms2288 KiB
10Accepted2/21ms2284 KiB
11Wrong answer0/27ms2352 KiB
12Wrong answer0/26ms2364 KiB
13Accepted2/24ms2372 KiB
14Time limit exceeded0/2307ms1736 KiB
15Time limit exceeded0/3316ms1820 KiB
16Time limit exceeded0/3312ms1928 KiB
17Time limit exceeded0/3344ms3440 KiB
18Time limit exceeded0/3310ms4028 KiB
19Time limit exceeded0/3316ms4388 KiB
20Time limit exceeded0/3305ms4620 KiB
21Time limit exceeded0/4305ms5084 KiB
22Time limit exceeded0/4319ms5352 KiB