Leimasin

input/code.cpp: In function 'std::__cxx11::string putStamps(std::deque<int>)':
input/code.cpp:14:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < stamp.size(); i++)
                  ~~^~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:28:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i <= target.size() - stamp.size(); i++)
                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:31:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < stamp.size(); j++)
                  ~~^~~~~~~~~~~~~~
input/code.cpp:45:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < target.size() - stamp.size(); i++)
                 ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:51:11: warning: comparison between signed and unsigned integer express...

#include <deque>
#include <iostream>
#include <string>

using namespace std;

string target, stamp;

string putStamps(deque<int> order)
{
	string comp(target.size(), ' ');
	for(int p : order)
	{
		for(int i = 0; i < stamp.size(); i++)
			comp[p+i] = stamp[i];
	}

	return comp;
}


int main()
{
	cin >> target >> stamp;

	deque<int> layer1, layer2, layer3, layer4, layer5;

	for(int i = 0; i <= target.size() - stamp.size(); i++)
	{
		bool flag = true;
		for(int j = 0; j < stamp.size(); j++)
		{
			if(target[i+j] != stamp[j])
			{
				flag = false;
				break;
			}
		}

		if(flag)
			layer1.push_back(i);
	}

	int pl = 0;
	for(int i = 0; i < target.size() - stamp.size(); i++)
	{
		if(target[i] != stamp[0])
			continue;

		int j = 0;
		for(; j < stamp.size() && target[i+j] == stamp[j]; j++);

		if(i+j >= pl)
		{
			layer2.push_back(i);
			pl = i+j;
		}
	}

	pl = target.size() + stamp.size();
	for(int i = target.size() - 1; i >= stamp.size(); i--)
	{
		if(target[i] != stamp[stamp.size() - 1])
			continue; 

		int j = 0;
		for(; j < stamp.size() && target[i-j] == stamp[stamp.size() - j - 1]; j++);

		if(i - stamp.size() + 1 <= pl)
		{
			layer3.push_back(i - stamp.size() + 1);
			pl = i - stamp.size() + 1;
		}
	}

	//deque<int> order;
	//for(int p : layer1) order.push_back(p);
	
	//cout << putStamps(layer1) << endl;
	//cout << putStamps(layer2) << endl;
	//cout << putStamps(layer3) << endl;
	
	deque<int> all;
	for(int i : layer3) all.push_back(i);
	for(int i : layer2) all.push_back(i);
	for(int i : layer1) all.push_back(i);

	string comp = putStamps(all);

	for(int i = 0; i <= target.size() - stamp.size(); i++)
	{
		int p = 0;
		string w;
		for(; comp[i+p] != target[i+p] && p < stamp.size(); p++)
			w += target[i+p];

		if(p)
		{
			int q = 0;
		a:
			for(int j = 0; j + q < stamp.size() && j < w.size(); j++)
			{
				if(stamp[j+q] != w[j])
				{
					q++;
					goto a;
				}
			}

			bool flag = true;
			for(int j = 0; j < p && i + j < comp.size(); j++)
			{
				if(comp[i + j] != ' ')
				{
					flag = false;
					break;
				}
			}

			if(i - q < 0)
				continue;

			(flag ? layer4 : layer5).push_back(i - q);
		}

		i += p;
		
	}

	all.clear();
	for(int i : layer4) all.push_back(i);
	for(int i : layer3) all.push_back(i);
	for(int i : layer5) all.push_back(i);
	for(int i : layer2) all.push_back(i);
	for(int i : layer1) all.push_back(i);

	cout << "4 " << putStamps(layer4) << endl;
	cout << "3 " << putStamps(layer3) << endl;
	cout << "5 " << putStamps(layer5) << endl;
	cout << "2 " << putStamps(layer2) << endl;
	cout << "1 " << putStamps(layer1) << endl;
	cout << "T " << target << endl;

	comp = putStamps(all);
	if(target != comp)
	{
		cout << "-1" << endl;
		cout << "C " << comp << endl;
		return 0;
	}

	cout << all.size() << endl;
	for(int i : all)
		cout << i + 1 << " ";
	cout << endl;

	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 1

Verdict: WRONG ANSWER

Test 7

Group: 1

Verdict: WRONG ANSWER

Test 8

Group: 1

Verdict: WRONG ANSWER

Test 9

Group: 1

Verdict: WRONG ANSWER

Test 10

Group: 1

Verdict: WRONG ANSWER

Test 11

Group: 1

Verdict: WRONG ANSWER

Test 12

Group: 1

Verdict: WRONG ANSWER

Test 13

Group: 1

Verdict: WRONG ANSWER

Test 14

Group: 1

Verdict: WRONG ANSWER

Test 15

Group: 2

Verdict: WRONG ANSWER

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: WRONG ANSWER

Test 18

Group: 2

Verdict: WRONG ANSWER

Test 19

Group: 2

Verdict: WRONG ANSWER

Test 20

Group: 2

Verdict: WRONG ANSWER

Test 21

Group: 2

Verdict: WRONG ANSWER

Test 22

Group: 2

Verdict: WRONG ANSWER

Test 23

Group: 2

Verdict: WRONG ANSWER

Test 24

Group: 2

Verdict: WRONG ANSWER

Test 25

Group: 2

Verdict: WRONG ANSWER

Test 26

Group: 2

Verdict: WRONG ANSWER

Test 27

Group: 2

Verdict: WRONG ANSWER

Test 28

Group: 2

Verdict: WRONG ANSWER

Test 29

Group: 3

Verdict: WRONG ANSWER

Test 30

Group: 3

Verdict: WRONG ANSWER

Test 31

Group: 3

Verdict: WRONG ANSWER

Test 32

Group: 3

Verdict: WRONG ANSWER

Test 33

Group: 3

Verdict: WRONG ANSWER

Test 34

Group: 3

Verdict: WRONG ANSWER

Test 35

Group: 3

Verdict: WRONG ANSWER

Test 36

Group: 3

Verdict: WRONG ANSWER

Test 37

Group: 3

Verdict: WRONG ANSWER

Test 38

Group: 3

Verdict: WRONG ANSWER

Test 39

Group: 3

Verdict: WRONG ANSWER

Test 40

Group: 3

Verdict: WRONG ANSWER

Test 41

Group: 3

Verdict: WRONG ANSWER

Test 42

Group: 3

Verdict: WRONG ANSWER