백준 3111번 : 검열 - deque 활용 코드 C++

https://www.acmicpc.net/problem/3111

3111번: 검열

 

#include <bits/stdc++.h>
using namespace std;

string a, t;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> a >> t;

	int l = 0, r = t.length() - 1, turn = 0;
	deque<char> left, right;

	while (l <= r) {
		if (turn % 2 == 0) {
			left.push_back(t[l++]);

			if (left.size() >= a.length()) {
				bool is_same = true;
				for (int i = 0; i < a.length(); i++) {
					if (a[a.length() - 1 - i] != left[left.size() - 1 - i]) {
						is_same = false;
						break;
					}
				}
				if (is_same) {
					for (int i = 0; i < a.length(); i++)
						left.pop_back();

					turn++;
				}
			}
			
		}
		else {

			right.push_front(t[r--]);
			if (right.size() >= a.length()) {

				bool is_same = true;
				for (int i = 0; i < a.length(); i++) {
					if (a[i] != right[i]) {
						is_same = false;
						break;
					}
				}
				if (is_same) {
					for (int i = 0; i < a.length(); i++)
						right.pop_front();

					turn++;
				}
			}
		}

	}

	while (!right.empty()) {
		left.push_back(right.front());
		right.pop_front();

		if (left.size() >= a.length() && left.back() == a[a.length() - 1]) {
			bool is_same = true;
			for (int i = 0; i < a.length(); i++) {
				if (a[a.length() - 1 - i] != left[left.size() - 1 - i]) {
					is_same = false;
					break;
				}
			}
			if (is_same) {
				for (int i = 0; i < a.length(); i++)
					left.pop_back();
			}
		}
	}

	while (!left.empty()) {
		cout << left.front();
		left.pop_front();
	}
	cout << '\n';

	return 0;
}

백준 3111