CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:Ilmari2000
Submission time:2018-10-11 11:47:56 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.03 s1details
#20.03 s1details
#30.03 s1details
#40.02 s1details
#50.01 s1details
#60.01 s1details
#70.02 s1details
#80.02 s1details
#90.01 s1details
#100.01 s1details
#110.03 s1details
#12ACCEPTED0.02 s1details
#130.02 s1details
#14ACCEPTED0.01 s1details
#150.01 s2details
#160.02 s2details
#170.01 s2details
#180.02 s2details
#190.02 s2details
#200.02 s2details
#210.02 s2details
#220.01 s2details
#230.01 s2details
#240.02 s2details
#250.02 s2details
#26ACCEPTED0.01 s2details
#270.01 s2details
#28ACCEPTED0.02 s2details
#290.03 s3details
#300.01 s3details
#310.01 s3details
#320.02 s3details
#330.02 s3details
#340.02 s3details
#350.02 s3details
#360.01 s3details
#370.02 s3details
#380.01 s3details
#390.01 s3details
#400.02 s3details
#410.03 s3details
#42ACCEPTED0.01 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: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 <...

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

Test 1

Group: 1

Verdict:

input
BBBBBBBBBB
B

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

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

Test 2

Group: 1

Verdict:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
 AB ABABAB
ABAB      
6
2 0 1 4 6 8 

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
AABAAABAA 
    AABAAA
4
5 4 0 4 

Test 4

Group: 1

Verdict:

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
BAAAAAABB 
 BAAAAAABB
2
1 0 

Test 5

Group: 1

Verdict:

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
AAABBABBAA
          
1

Test 6

Group: 1

Verdict:

input
GGGGGGGGGG
G

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

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

Test 7

Group: 1

Verdict:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
QU QU QUQU
 QU QU    
6
4 1 0 3 6 8 

Test 8

Group: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
     DWXHJ
DWXDWXHJ  
3
0 3 5 

Test 9

Group: 1

Verdict:

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
FSOCRDGQB 
 FSOCRDGQB
2
1 0 

Test 10

Group: 1

Verdict:

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
OETMIMPUPD
          
1

Test 11

Group: 1

Verdict:

input
DOWEUOWUEU
DOWEU

correct output
-1

user output
DOWEU     
   DDOWEUU
-1

Test 12

Group: 1

Verdict: ACCEPTED

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
-1

Test 13

Group: 1

Verdict:

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
ABABABABA
  ABABABA
7
6 4 2 0 2 4 6 

Test 14

Group: 1

Verdict: ACCEPTED

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
-1

Test 15

Group: 2

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

Test 16

Group: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
  BABAAAAAAA                  ...

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
ABABAAAAABABBBBAAAABBBBAABBBBB...

Test 18

Group: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
 AABABAAAABBBBBABABBAABBABABBA...

Error:
double free or corruption (out)

Test 19

Group: 2

Verdict:

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
AABABBBBBBAABBABABBBBBBAABBAAA...

Test 20

Group: 2

Verdict:

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

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

user output
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

Test 21

Group: 2

Verdict:

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

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

user output
                 NIMKLMXCDE   ...

Test 22

Group: 2

Verdict:

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

Test 23

Group: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
 ISNROLHLOJIWPTVFHFLUQRIROVLYP...

Test 24

Group: 2

Verdict:

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

Test 25

Group: 2

Verdict:

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
LNSBGZAWFJ                   L...

Test 26

Group: 2

Verdict: ACCEPTED

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
-1

Test 27

Group: 2

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
ABABABABABABABABABABABABABABAB...

Test 28

Group: 2

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1

Test 29

Group: 3

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
                       BBBBAAB...

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
AABBBABAABABAAABBAAAAAAABBBAAB...

Test 32

Group: 3

Verdict:

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
ABBAAABAAABAAAAABBABABBABBABBB...

Test 33

Group: 3

Verdict:

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
BAAABBABBBAAAABAAAABBBBABAABAA...

Test 34

Group: 3

Verdict:

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

user output
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

Test 35

Group: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
                 KSBMRZXBDA   ...

Test 36

Group: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
          ILYLVJZCCQDLFRLSXZDM...

Test 37

Group: 3

Verdict:

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
 ZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

Test 38

Group: 3

Verdict:

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

Test 39

Group: 3

Verdict:

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
                              ...

Test 40

Group: 3

Verdict:

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

Test 41

Group: 3

Verdict:

input
ABABABABABABABABABABABABABABAB...

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

user output
ABABABABABABABABABABABABABABAB...

Test 42

Group: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1