CSES - Datatähti 2019 alku - Results
Submission details
Task:Kolikot
Sender:Ilmari2000
Submission time:2018-10-11 12:07:53 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.03 s1details
#20.01 s1details
#30.01 s1details
#40.02 s1details
#50.02 s1details
#60.01 s1details
#70.01 s1details
#80.02 s1details
#90.01 s1details
#100.01 s1details
#110.01 s2details
#120.02 s2details
#130.02 s2details
#140.02 s2details
#150.02 s2details
#160.02 s2details
#170.01 s2details
#180.02 s2details
#190.01 s2details
#200.03 s2details
#210.01 s3details
#220.01 s3details
#230.02 s3details
#240.01 s3details
#250.02 s3details
#260.02 s3details
#270.01 s3details
#280.01 s3details
#290.02 s3details
#300.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] || i + stamp.size() - j - 1 >= target.size())) j++;

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

			begin = j;
			length = 0;
			
			while(j+length < stamp.size() && 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+1 << " ";
	cout << endl;
	return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
1

correct output
1

user output
-1
2
1 2 

Test 2

Group: 1

Verdict:

input
2

correct output
1

user output
-1
2
1 2 

Test 3

Group: 1

Verdict:

input
3

correct output
2
1 2 

user output
-1
2
1 2 

Test 4

Group: 1

Verdict:

input
4

correct output
2
1 3 

user output
-1
2
1 2 

Test 5

Group: 1

Verdict:

input
5

correct output
2
1 4 

user output
-1
2
1 2 

Test 6

Group: 1

Verdict:

input
6

correct output
3
1 2 3 

user output
-1
2
1 2 

Test 7

Group: 1

Verdict:

input
7

correct output
3
1 2 4 

user output
-1
2
1 2 

Test 8

Group: 1

Verdict:

input
8

correct output
3
1 2 5 

user output
-1
2
1 2 

Test 9

Group: 1

Verdict:

input
9

correct output
3
1 2 6 

user output
-1
2
1 2 

Test 10

Group: 1

Verdict:

input
10

correct output
4
1 2 3 4 

user output
-1
3
1 2 3 

Test 11

Group: 2

Verdict:

input
11

correct output
4
1 2 3 5 

user output
-1
3
1 2 3 

Test 12

Group: 2

Verdict:

input
54

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

user output
-1
3
1 2 3 

Test 13

Group: 2

Verdict:

input
55

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

user output
-1
3
1 2 3 

Test 14

Group: 2

Verdict:

input
56

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

user output
-1
3
1 2 3 

Test 15

Group: 2

Verdict:

input
123

correct output
15
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1
4
1 2 3 4 

Test 16

Group: 2

Verdict:

input
819

correct output
39
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1
4
1 2 3 4 

Test 17

Group: 2

Verdict:

input
820

correct output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1
4
1 2 3 4 

Test 18

Group: 2

Verdict:

input
821

correct output
40
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1
4
1 2 3 4 

Test 19

Group: 2

Verdict:

input
999

correct output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1
4
1 2 3 4 

Test 20

Group: 2

Verdict:

input
1000

correct output
44
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1
5
1 2 3 4 5 

Test 21

Group: 3

Verdict:

input
1274

correct output
49
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1
5
1 2 3 4 5 

Test 22

Group: 3

Verdict:

input
1275

correct output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1
5
1 2 3 4 5 

Test 23

Group: 3

Verdict:

input
1276

correct output
50
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1
5
1 2 3 4 5 

Test 24

Group: 3

Verdict:

input
12345

correct output
156
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1
6
1 2 3 4 5 6 

Test 25

Group: 3

Verdict:

input
123456

correct output
496
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

user output
-1
7
1 2 3 4 5 6 7 

Test 26

Group: 3

Verdict:

input
10000000

correct output
4471
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

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

Test 27

Group: 3

Verdict:

input
100000000

correct output
14141
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

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

Test 28

Group: 3

Verdict:

input
500000000

correct output
31622
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

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

Test 29

Group: 3

Verdict:

input
999999999

correct output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

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

Test 30

Group: 3

Verdict:

input
1000000000

correct output
44720
1 2 3 4 5 6 7 8 9 10 11 12 13 ...

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