CSES - Datatähti 2019 alku - Results
Submission details
Task:Kolikot
Sender:EA999
Submission time:2018-10-11 18:48:07 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.02 s1details
#20.01 s1details
#30.02 s1details
#40.01 s1details
#50.02 s1details
#60.01 s1details
#70.01 s1details
#80.02 s1details
#90.02 s1details
#100.02 s1details
#110.02 s2details
#120.03 s2details
#130.02 s2details
#140.01 s2details
#150.02 s2details
#160.01 s2details
#170.02 s2details
#180.02 s2details
#190.02 s2details
#200.03 s2details
#210.02 s3details
#220.01 s3details
#230.01 s3details
#240.02 s3details
#250.02 s3details
#260.02 s3details
#270.01 s3details
#280.03 s3details
#290.01 s3details
#300.03 s3details

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:17:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int_fast32_t a = 0;a < teksti.size();a++)
                          ~~^~~~~~~~~~~~~~~
input/code.cpp:32:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for (int_fast32_t b = 2;b < leimasin.size();b++)
                              ~~^~~~~~~~~~~~~~~~~
input/code.cpp:40:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       if (b == leimasin.size() - 1)
           ~~^~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:48:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    else if (next==leimasin.size()-1)
             ~~~~^~~~~~~~~~~~~~~~~~~
input/code.cpp:63:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int_fast32_t b = 2;b < leimasin.size();b++)...

Code

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

int main(int argc, char *argv[])
{
	std::cin.tie(NULL);
	std::ios_base::sync_with_stdio(false);
	std::vector<int_fast32_t> vastaukset;
	std::string teksti, leimasin;
	std::getline(std::cin,teksti);
	std::getline(std::cin, leimasin);
	int_fast32_t next = 0;
	int_fast32_t up = teksti.size() - leimasin.size();
	vastaukset.reserve(teksti.size());
	for (int_fast32_t a = 0;a < teksti.size();a++)
	{
		char q = teksti[a];
		if (q==leimasin[next])
		{
			//käydään läpi merkkijonoa
			if (next==0)
			{
				if ((teksti[a+1]==leimasin[1] && a<up) || a==0)
				{
					vastaukset.emplace_back(a + 1);
					next++;
				}
				else
				{
					for (int_fast32_t b = 2;b < leimasin.size();b++)
					{
						if (q == leimasin[b])
						{
							vastaukset.emplace(vastaukset.begin(), a - b + 1);
							next = b + 1;
							break;
						}
						if (b == leimasin.size() - 1)
						{
							std::printf("%i", -1);
							return 0;
						}
					}
				}
			}
			else if (next==leimasin.size()-1)
			{
				next = 0;
			}
			else
			{
				next++;
			}
			continue;
		}
		else if (q==leimasin[0])
		{
			//kohdasta alkaa uusi leima
			if (teksti[a+1]!=leimasin[1])
			{
				for (int_fast32_t b = 2;b < leimasin.size();b++)
				{
					if (q == leimasin[b])
					{
						vastaukset.emplace(vastaukset.begin(), a - b + 1);
						next = b + 1;
						break;
					}
					if (b == leimasin.size() - 1)
					{
						std::printf("%i", -1);
						return 0;
					}
				}
				continue;
			}
			vastaukset.emplace_back(a+1);
			next = 1;
		}
		else
		{
			for (int_fast32_t b = 1;b < leimasin.size();b++)
			{
				if (q == leimasin[b])
				{
					vastaukset.emplace(vastaukset.begin(),a - b + 1);
					next = b + 1;
					break;
				}
				if (b == leimasin.size() - 1)
				{
					std::printf("%i", -1);
					return 0;
				}
			}
		}
	}
	std::unique(vastaukset.begin(), vastaukset.end());
	std::printf("%li \n", vastaukset.size());
	for (int_fast32_t v : vastaukset)
	{
		std::printf("%li ", v);
	}
	std::cin >> next;
	return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
1

correct output
1

user output

Test 2

Group: 1

Verdict:

input
2

correct output
1

user output

Test 3

Group: 1

Verdict:

input
3

correct output
2
1 2 

user output

Test 4

Group: 1

Verdict:

input
4

correct output
2
1 3 

user output

Test 5

Group: 1

Verdict:

input
5

correct output
2
1 4 

user output

Test 6

Group: 1

Verdict:

input
6

correct output
3
1 2 3 

user output

Test 7

Group: 1

Verdict:

input
7

correct output
3
1 2 4 

user output

Test 8

Group: 1

Verdict:

input
8

correct output
3
1 2 5 

user output

Test 9

Group: 1

Verdict:

input
9

correct output
3
1 2 6 

user output

Test 10

Group: 1

Verdict:

input
10

correct output
4
1 2 3 4 

user output

Test 11

Group: 2

Verdict:

input
11

correct output
4
1 2 3 5 

user output

Test 12

Group: 2

Verdict:

input
54

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

user output

Test 13

Group: 2

Verdict:

input
55

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

user output

Test 14

Group: 2

Verdict:

input
56

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

user output

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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