CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:Ilmari2000
Submission time:2018-10-10 15:05:43 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1details
#20.01 s1details
#30.01 s1details
#40.03 s1details
#50.01 s1details
#60.02 s1details
#70.03 s1details
#80.01 s1details
#90.02 s1details
#100.02 s1details
#110.02 s1details
#120.02 s1details
#130.02 s1details
#140.02 s1details
#150.02 s2details
#160.02 s2details
#170.01 s2details
#180.02 s2details
#190.03 s2details
#200.01 s2details
#210.02 s2details
#220.02 s2details
#230.01 s2details
#240.02 s2details
#250.02 s2details
#260.02 s2details
#270.02 s2details
#280.01 s2details
#290.01 s3details
#300.03 s3details
#310.01 s3details
#320.02 s3details
#330.01 s3details
#340.01 s3details
#350.01 s3details
#360.02 s3details
#370.03 s3details
#380.02 s3details
#390.02 s3details
#400.02 s3details
#410.01 s3details
#420.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: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...

Code

#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 details

Test 1

Group: 1

Verdict:

input
BBBBBBBBBB
B

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

user output
4           
3  BBBBBBBBB
5           
2 BBBBBBBBB 
1 BBBBBBBBBB
...

Test 2

Group: 1

Verdict:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
4           
3  ABBABABAB
5           
2 AAB ABAB  
1  AB ABABAB
...

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
4           
3  AABAAAAAA
5           
2 AABAAABAA 
1 AABAAABAA 
...

Test 4

Group: 1

Verdict:

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
4           
3  BAAAAAABB
5           
2 BAAAAAABB 
1 BAAAAAABB 
...

Test 5

Group: 1

Verdict:

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
4           
3           
5           
2           
1 AAABBABBAA
...

Test 6

Group: 1

Verdict:

input
GGGGGGGGGG
G

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

user output
4           
3  GGGGGGGGG
5           
2 GGGGGGGGG 
1 GGGGGGGGGG
...

Test 7

Group: 1

Verdict:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
4           
3  QUQUUQUQU
5           
2 QU QU QU  
1 QU QU QUQU
...

Test 8

Group: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
4           
3      DWXHJ
5           
2 DWXDWXHJ  
1      DWXHJ
...

Test 9

Group: 1

Verdict:

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
4           
3  FSOCRDGQB
5           
2 FSOCRDGQB 
1 FSOCRDGQB 
...

Test 10

Group: 1

Verdict:

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
4           
3           
5           
2           
1 OETMIMPUPD
...

Test 11

Group: 1

Verdict:

input
DOWEUOWUEU
DOWEU

correct output
-1

user output
4           
3    DOWEUEU
5     DOWEU 
2 DOWEU     
1 DOWEU     
...

Test 12

Group: 1

Verdict:

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
4           
3           
5           
2           
1           
...

Test 13

Group: 1

Verdict:

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
4          
3   ABABABA
5          
2 ABABABA  
1 ABABABABA
...

Test 14

Group: 1

Verdict:

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
4           
3           
5           
2           
1           
...

Test 15

Group: 2

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
4                             ...

Test 16

Group: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
4                             ...

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
4                             ...

Test 18

Group: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
4                             ...

Test 19

Group: 2

Verdict:

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
4                             ...

Test 20

Group: 2

Verdict:

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

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

user output
4                             ...

Test 21

Group: 2

Verdict:

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

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

user output
4                             ...

Test 22

Group: 2

Verdict:

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
4                             ...

Test 23

Group: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
4                             ...

Test 24

Group: 2

Verdict:

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
4                             ...

Test 25

Group: 2

Verdict:

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
4                             ...

Test 26

Group: 2

Verdict:

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
4                             ...

Test 27

Group: 2

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
4                             ...

Test 28

Group: 2

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
4                             ...

Test 29

Group: 3

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
4                             ...

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
4                             ...

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
4                             ...

Test 32

Group: 3

Verdict:

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
4                             ...

Test 33

Group: 3

Verdict:

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
4                             ...

Test 34

Group: 3

Verdict:

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

user output
4                             ...

Test 35

Group: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
4                             ...

Test 36

Group: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
4                             ...

Test 37

Group: 3

Verdict:

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
4                             ...

Test 38

Group: 3

Verdict:

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
4                             ...

Test 39

Group: 3

Verdict:

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
4                             ...

Test 40

Group: 3

Verdict:

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
4                             ...

Test 41

Group: 3

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
4                             ...

Test 42

Group: 3

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
4                             ...