Submission details
Task:Leimasin
Sender:EA999
Submission time:2018-10-11 18:48:39 +0300
Language:C++
Status:READY
Result:0
Feedback
subtaskverdictscore
#10
#20
#30
Test results
testverdicttimesubtask
#10.02 s1details
#2ACCEPTED0.01 s1details
#30.02 s1details
#40.02 s1details
#5ACCEPTED0.02 s1details
#60.02 s1details
#7ACCEPTED0.01 s1details
#8ACCEPTED0.01 s1details
#9ACCEPTED0.02 s1details
#10ACCEPTED0.03 s1details
#110.03 s1details
#120.01 s1details
#13ACCEPTED0.02 s1details
#140.01 s1details
#150.02 s2details
#160.01 s2details
#170.01 s2details
#180.02 s2details
#19ACCEPTED0.03 s2details
#200.02 s2details
#210.01 s2details
#220.03 s2details
#23ACCEPTED0.02 s2details
#24ACCEPTED0.01 s2details
#250.02 s2details
#260.03 s2details
#27ACCEPTED0.01 s2details
#280.02 s2details
#290.02 s3details
#300.02 s3details
#310.01 s3details
#320.02 s3details
#33ACCEPTED0.02 s3details
#340.01 s3details
#350.01 s3details
#360.01 s3details
#37ACCEPTED0.02 s3details
#38ACCEPTED0.02 s3details
#39ACCEPTED0.01 s3details
#400.01 s3details
#41ACCEPTED0.02 s3details
#420.01 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

Subtask: 1

Verdict:

input
BBBBBBBBBB
B

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

user output

1 10 

Test 2

Subtask: 1

Verdict: ACCEPTED

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output

9 3 1 2 5 7 

Test 3

Subtask: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output

7 5 3 1 

Test 4

Subtask: 1

Verdict:

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output

3 1 

Test 5

Subtask: 1

Verdict: ACCEPTED

input
AAABBABBAA
AAABBABBAA

correct output
1

user output


Test 6

Subtask: 1

Verdict:

input
GGGGGGGGGG
G

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

user output

1 10 

Test 7

Subtask: 1

Verdict: ACCEPTED

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output

9 5 2 1 4 7 

Test 8

Subtask: 1

Verdict: ACCEPTED

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output

1 4 6 

Test 9

Subtask: 1

Verdict: ACCEPTED

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output

2 1 

Test 10

Subtask: 1

Verdict: ACCEPTED

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output


Test 11

Subtask: 1

Verdict:

input
DOWEUOWUEU
DOWEU

correct output
-1

user output

6 4 5 1 

Test 12

Subtask: 1

Verdict:

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output

1 2 0 1 

Test 13

Subtask: 1

Verdict: ACCEPTED

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output

7 5 3 1 

Test 14

Subtask: 1

Verdict:

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output

8 1 

Test 15

Subtask: 2

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output

1 100 

Test 16

Subtask: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
62 
87 86 85 84 83 82 77 76 75 74 ...
Truncated

Test 17

Subtask: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
29 
99 86 85 84 83 82 81 80 76 69 ...

Test 18

Subtask: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
44 
96 95 94 91 90 89 80 79 78 74 ...
Truncated

Test 19

Subtask: 2

Verdict: ACCEPTED

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output


Test 20

Subtask: 2

Verdict:

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

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

user output

1 100 

Test 21

Subtask: 2

Verdict:

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

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

user output
-1

Test 22

Subtask: 2

Verdict:

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output

51 44 1 

Test 23

Subtask: 2

Verdict: ACCEPTED

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output

1 2 

Test 24

Subtask: 2

Verdict: ACCEPTED

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output


Test 25

Subtask: 2

Verdict:

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
22 
91 90 87 86 79 80 78 69 52 34 ...

Test 26

Subtask: 2

Verdict:

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
16 
51 95 92 88 89 91 -16 -17 1 3 ...

Test 27

Subtask: 2

Verdict: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

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

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

Test 28

Subtask: 2

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output

98 1 

Test 29

Subtask: 3

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output

1 1000 

Test 30

Subtask: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
255 
991 984 976 970 958 955 951 94...
Truncated

Test 31

Subtask: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
145 
997 992 994 981 976 978 973 97...
Truncated

Test 32

Subtask: 3

Verdict:

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output

999 1 

Test 33

Subtask: 3

Verdict: ACCEPTED

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output


Test 34

Subtask: 3

Verdict:

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

user output

1 1000 

Test 35

Subtask: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
-1

Test 36

Subtask: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
38 
856 671 678 665 705 690 692 68...
Truncated

Test 37

Subtask: 3

Verdict: ACCEPTED

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output

1 2 

Test 38

Subtask: 3

Verdict: ACCEPTED

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output


Test 39

Subtask: 3

Verdict: ACCEPTED

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
-1

Test 40

Subtask: 3

Verdict:

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
165 
967 982 974 964 979 962 961 97...
Truncated

Test 41

Subtask: 3

Verdict: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

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

user output
499 
997 995 993 991 989 987 985 98...
Truncated

Test 42

Subtask: 3

Verdict:

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output

998 1