CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:Ilmari2000
Submission time:2018-10-13 20:01:05 +0300
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED29
#2ACCEPTED31
#3ACCEPTED40
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1details
#2ACCEPTED0.01 s1details
#3ACCEPTED0.01 s1details
#4ACCEPTED0.03 s1details
#5ACCEPTED0.02 s1details
#6ACCEPTED0.02 s1details
#7ACCEPTED0.01 s1details
#8ACCEPTED0.02 s1details
#9ACCEPTED0.02 s1details
#10ACCEPTED0.02 s1details
#11ACCEPTED0.01 s1details
#12ACCEPTED0.04 s1details
#13ACCEPTED0.02 s1details
#14ACCEPTED0.03 s1details
#15ACCEPTED0.02 s2details
#16ACCEPTED0.03 s2details
#17ACCEPTED0.02 s2details
#18ACCEPTED0.02 s2details
#19ACCEPTED0.01 s2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.02 s2details
#23ACCEPTED0.03 s2details
#24ACCEPTED0.01 s2details
#25ACCEPTED0.01 s2details
#26ACCEPTED0.01 s2details
#27ACCEPTED0.02 s2details
#28ACCEPTED0.02 s2details
#29ACCEPTED0.02 s3details
#30ACCEPTED0.02 s3details
#31ACCEPTED0.02 s3details
#32ACCEPTED0.02 s3details
#33ACCEPTED0.02 s3details
#34ACCEPTED0.02 s3details
#35ACCEPTED0.02 s3details
#36ACCEPTED0.02 s3details
#37ACCEPTED0.01 s3details
#38ACCEPTED0.03 s3details
#39ACCEPTED0.02 s3details
#40ACCEPTED0.01 s3details
#41ACCEPTED0.01 s3details
#42ACCEPTED0.02 s3details

Compiler report

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

Code

#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;
	bool ended = true;
	for(int i = 0; i < target.size(); i++)
	{
		//cout << ended << endl;
		if(p < layer1.size() && i >= layer1[p])
		{
			//cout << "i: " << i << ", lp: " << layer1[p] << ", p: " << p << endl;
			i = layer1[p] + stamp.size() - 1;
			p++;
			ended = true;
			continue;
		}

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

			while(j < stamp.size() && (target[i] != stamp[j] || i + stamp.size() - j - 1 >= target.size())) j++;

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

			begin = j;
			int length = 0;


			if(i - begin < 0 || i - begin > target.size() - stamp.size())
				continue;

			bool bflag = !ended && j == 0;

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

				if(length > longest || (pended && j + length == stamp.size()))
				//if((ended && j == 0) || (length > longest || (length == longest && j + length == stamp.size())))
				{
					longest = length;
					longestBegin = begin;
					ended = j + longest == stamp.size();
				}
			}

			if(bflag)
				break;

			//cout << "i: " << i << ", j: " << j << ", begin: " << begin << ", length: " << length << ", longestBegin: " << longestBegin << ", longest: " << longest << endl;
		}
		//cout << endl;
		
		if(longestBegin > -1)
		{
			bool flag = false;
			for(int j = 0; j < longestBegin; j++)
			{
				if(target[i - longestBegin + j] != stamp[j])
				{
					flag = true;
					break;
				}
			}


			if(longestBegin && flag)
				layer2.push_front(i - longestBegin);
			else
				layer2.push_back(i - longestBegin);

			//cout << i << ", " << i - longestBegin << endl;

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

	string comp = putStamps(fin);
	if(comp != target)
	{
		//cout << "-1" << endl;

		for(int i = 0; i < target.size(); i++)
		{
			if(target[i] != comp[i])
			{
				int j = i;
				while(target[j] != comp[j] && j < target.size() - 1)
					j++;

				if(target[j] == comp[j])
					j--;

				//cout << i << ", " << j << endl;

				int p = 0;
				bool pflag = true;
				for(int k = 0; k < fin.size(); k++)
				{
					if(pflag && fin[k] > j)
					{
						p = k;
						pflag = false;
					}

					if(fin[k] < fin[p])
						pflag = true;
				}

				int k = 0, ks = 0;
				while(i - ks + k < target.size() && k < stamp.size() && i - ks + k <= j)
				{
					if(target[i - ks + k] == stamp[k])
					{
						k++;
					}
					else
					{
						ks++;
						k = 0;
					}
				}

				if(i - ks > 0)
					fin.insert(fin.begin() + p, i - ks);
			}
		}
		//return 0;
	}

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

	cout << fin.size() << endl;
	for(int i : fin)
		cout << i+1 << " ";
	cout << endl;
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
BBBBBBBBBB
B

correct output
10
10 9 8 7 6 5 4 3 2 1 

user output
10
1 2 3 4 5 6 7 8 9 10 

Test 2

Group: 1

Verdict: ACCEPTED

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
6
3 1 2 5 7 9 

Test 3

Group: 1

Verdict: ACCEPTED

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
3
6 1 5 

Test 4

Group: 1

Verdict: ACCEPTED

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
2
2 1 

Test 5

Group: 1

Verdict: ACCEPTED

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
1

Test 6

Group: 1

Verdict: ACCEPTED

input
GGGGGGGGGG
G

correct output
10
10 9 8 7 6 5 4 3 2 1 

user output
10
1 2 3 4 5 6 7 8 9 10 

Test 7

Group: 1

Verdict: ACCEPTED

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
6
5 2 1 4 7 9 

Test 8

Group: 1

Verdict: ACCEPTED

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
3
1 4 6 

Test 9

Group: 1

Verdict: ACCEPTED

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
2
2 1 

Test 10

Group: 1

Verdict: ACCEPTED

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
1

Test 11

Group: 1

Verdict: ACCEPTED

input
DOWEUOWUEU
DOWEU

correct output
-1

user output
-1

Test 12

Group: 1

Verdict: ACCEPTED

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
-1

Test 13

Group: 1

Verdict: ACCEPTED

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
4
1 3 5 7 

Test 14

Group: 1

Verdict: ACCEPTED

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
-1

Test 15

Group: 2

Verdict: ACCEPTED

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

correct output
100
100 99 98 97 96 95 94 93 92 91...

user output
100
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 16

Group: 2

Verdict: ACCEPTED

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

correct output
36
87 43 24 1 91 79 69 68 67 66 6...

user output
36
69 68 67 66 65 64 53 52 51 50 ...

Test 17

Group: 2

Verdict: ACCEPTED

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

correct output
22
51 50 43 41 31 28 26 24 21 20 ...

user output
22
51 50 43 41 31 28 26 24 21 20 ...

Test 18

Group: 2

Verdict: ACCEPTED

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
2
1 2 

Test 19

Group: 2

Verdict: ACCEPTED

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
1

Test 20

Group: 2

Verdict: ACCEPTED

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

correct output
100
100 99 98 97 96 95 94 93 92 91...

user output
100
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 21

Group: 2

Verdict: ACCEPTED

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

correct output
18
1 2 3 74 5 79 58 7 84 64 37 10...

user output
18
74 58 27 1 2 3 5 7 10 37 64 79...

Test 22

Group: 2

Verdict: ACCEPTED

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
2
1 51 

Test 23

Group: 2

Verdict: ACCEPTED

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
2
1 2 

Test 24

Group: 2

Verdict: ACCEPTED

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
1

Test 25

Group: 2

Verdict: ACCEPTED

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
-1

Test 26

Group: 2

Verdict: ACCEPTED

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
-1

Test 27

Group: 2

Verdict: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

correct output
49
97 95 93 91 89 87 85 83 81 79 ...

user output
49
1 3 5 7 9 11 13 15 17 19 21 23...

Test 28

Group: 2

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1

Test 29

Group: 3

Verdict: ACCEPTED

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

correct output
1000
1000 999 998 997 996 995 994 9...

user output
1000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 30

Group: 3

Verdict: ACCEPTED

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

correct output
218
1 626 607 519 415 5 975 957 92...

user output
229
971 954 953 950 946 926 924 90...

Test 31

Group: 3

Verdict: ACCEPTED

input
AABBBABAABABAAABBAAAAAAABBBAAB...

correct output
55
569 639 403 761 663 437 172 90...

user output
55
901 900 897 896 895 885 884 88...

Test 32

Group: 3

Verdict: ACCEPTED

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
2
2 1 

Test 33

Group: 3

Verdict: ACCEPTED

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
1

Test 34

Group: 3

Verdict: ACCEPTED

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

correct output
1000
1000 999 998 997 996 995 994 9...

user output
1000
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

Test 35

Group: 3

Verdict: ACCEPTED

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

correct output
178
723 731 1 935 857 820 760 735 ...

user output
178
991 985 979 977 976 965 960 95...

Test 36

Group: 3

Verdict: ACCEPTED

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

correct output
21
671 54 747 504 113 1 856 764 5...

user output
21
856 671 608 504 413 257 216 54...

Test 37

Group: 3

Verdict: ACCEPTED

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
2
1 2 

Test 38

Group: 3

Verdict: ACCEPTED

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
1

Test 39

Group: 3

Verdict: ACCEPTED

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
-1

Test 40

Group: 3

Verdict: ACCEPTED

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
-1

Test 41

Group: 3

Verdict: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

correct output
499
997 995 993 991 989 987 985 98...

user output
499
1 3 5 7 9 11 13 15 17 19 21 23...

Test 42

Group: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1