1230. [S/W 문제해결 기본] 8일차 - 암호문3

#include <iostream>
#include <cstdio>
#include <algorithm>

#include <list>

using namespace std;

int main()
{
	int idx = 1;
	int N = 0;

	for(int id=0; id<10; id++)
	{				
		int pwd;
		list <int> lst;
		scanf("%d", &N);
		for (int i = 0; i < N; i++)
		{
			cin >> pwd;
			lst.push_back(pwd);
			pwd = 0;
		}
		int M = 0;
		scanf("%d", &M);
		for (int j = 0; j < M; j++)
		{
			char odr;
			cin >> odr;
			if (odr == 'I')// insert
			{
				list <int> lst_I;
				int x = 0, y = 0;
				int s;
				scanf("%d %d", &x, &y);
				for (int k = 0; k < y; k++)
				{
					cin >> s;
					lst_I.push_back(s);
					s = 0;
				}
				auto it = lst.begin();
				advance(it, x);
				lst.splice(it, lst_I);
			}
			else if (odr == 'D')//delete
			{
				int x = 0, y = 0;
				scanf("%d %d", &x, &y);
				auto it = lst.begin();
				auto it2 = lst.begin();
				advance(it, x);
				advance(it2, x + y);
				lst.erase(it, it2);
			}
			else if (odr == 'A')// add
			{
				int y = 0;
				scanf("%d", &y);
				int s;
				for (int k = 0; k < y; k++)
				{
					cin >> s;
					lst.push_back(s);
					s = 0;
				}
			}
			else
				j--;
		}
		printf("#%d ", idx++);
		list<int>::iterator it;
		it = lst.begin();

		for (int i = 0; i < 10; i++, it++) {
			printf("%d ", *it);
		}
		printf("\n");
		N = 0;
	}
	return 0;
}