Merkkijono

/*
	Written by, Tuukka Yildirim.
	
	input: s.
	
	The algorithm for this challenge is very trivial, since <s> contains at most, 1000 characters.
	We find sequences, that contain over one consecutive characters, and delete them accordingly.

*/


#include <iostream>
#include <vector>

using namespace std;

int main() 
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	string inp;
	getline(cin, inp);
	
	int len = static_cast<int>(inp.size());
	
	vector<char> chars(inp.begin(), inp.end());
	
	int index = 0;
	
	while (index < (len - 1))
	{
		// 012345
		// CAACCB => B
		// ABCDDCBA => null
		char currentChar = chars[index];
		char nextChar = chars[index + 1];
		
		//cout << "Index: " << index << "\n";
		//cout << "Current and next == (" << currentChar << ", " << nextChar << ")\n";
		
		if (currentChar == nextChar)
		{
			int seqEndIndex = index + 1;
			for (int seqI = index + 1; seqI < len; seqI++)
			{
				if (chars[seqI] == currentChar) seqEndIndex = max(seqEndIndex, seqI);
				else break;
			}
			
			len -= seqEndIndex - index + 1;
			chars.erase(chars.begin() + index, chars.begin() + seqEndIndex + 1);
			if ((index - 1) >= 0) index--;
		}
		else
		{
			index++;
		}
	}
	
	
	for (size_t i = 0; i < chars.size(); i++)
		cout << chars[i];
	
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED