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:51:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < target.size(); i++)
                 ~~^~~~~~~~~~~~~~~
input/code.cpp:54:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(p <...

#include <iostream>
#include <deque>
#include <vector>

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;

	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);
	}

	if(!layer1.size())
	{
		cout << "-1" << endl;
		return 0;
	}

	int p = 0;
	for(int i = 0; i < target.size(); i++)
	{
		//cout << i << endl;
		if(p < layer1.size() && i == layer1[p])
		{
			i = layer1[p] + stamp.size() - 1;
			p++;
			continue;
		}

		bool counting = false;
		int j = 0, longest = 0, longestBegin = -1, begin = -1;
		for(; j < stamp.size(); j++)
		{
			//cout << endl << j << " ";

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

			if(j == stamp.size())
				break;

			begin = j;
			length = 0;
			
			while(target[i+length] == stamp[j+length])
			{
				length++;
				if(length > longest)
				{
					longest = length;
					longestBegin = begin;
				}
			}

			//cout << "i: " << i << ", j: " << j << ", begin: " << begin << ", length: " << length << ", longestBegin: " << longestBegin << ", longest: " << longest << endl;
		}
		//cout << endl;

		if(longestBegin > -1)
		{
			if(longestBegin)
				layer2.push_front(i - longestBegin);
			else
				layer2.push_back(i - longestBegin);

			i += longest - 1;
		}

	}

	//cout << putStamps(layer1) << endl;
	//cout << putStamps(layer2) << endl;

	deque<int> fin;
	for(int i : layer2) fin.push_back(i);
	for(int i : layer1) fin.push_back(i);

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

	cout << fin.size() << endl;
	for(int i : fin)
		cout << i << " ";
	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: ACCEPTED

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: WRONG ANSWER

Test 14

Group: 1

Verdict: ACCEPTED

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: RUNTIME ERROR

double free or corruption (out)

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: ACCEPTED

Test 26

Group: 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: WRONG ANSWER

Test 28

Group: 2

Verdict: ACCEPTED

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: ACCEPTED

Test 40

Group: 3

Verdict: ACCEPTED

Test 41

Group: 3

Verdict: WRONG ANSWER

Test 42

Group: 3

Verdict: ACCEPTED