CSES - Datatähti 2019 alku

CSES - Datatähti 2019 alku - Results

Submission details
Task:	Leimasin
Sender:	Ilmari2000
Submission time:	2018-10-13 20:01:05 +0300
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	29
#2	ACCEPTED	31
#3	ACCEPTED	40

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	1	details
#2	ACCEPTED	0.01 s	1	details
#3	ACCEPTED	0.01 s	1	details
#4	ACCEPTED	0.03 s	1	details
#5	ACCEPTED	0.02 s	1	details
#6	ACCEPTED	0.02 s	1	details
#7	ACCEPTED	0.01 s	1	details
#8	ACCEPTED	0.02 s	1	details
#9	ACCEPTED	0.02 s	1	details
#10	ACCEPTED	0.02 s	1	details
#11	ACCEPTED	0.01 s	1	details
#12	ACCEPTED	0.04 s	1	details
#13	ACCEPTED	0.02 s	1	details
#14	ACCEPTED	0.03 s	1	details
#15	ACCEPTED	0.02 s	2	details
#16	ACCEPTED	0.03 s	2	details
#17	ACCEPTED	0.02 s	2	details
#18	ACCEPTED	0.02 s	2	details
#19	ACCEPTED	0.01 s	2	details
#20	ACCEPTED	0.01 s	2	details
#21	ACCEPTED	0.01 s	2	details
#22	ACCEPTED	0.02 s	2	details
#23	ACCEPTED	0.03 s	2	details
#24	ACCEPTED	0.01 s	2	details
#25	ACCEPTED	0.01 s	2	details
#26	ACCEPTED	0.01 s	2	details
#27	ACCEPTED	0.02 s	2	details
#28	ACCEPTED	0.02 s	2	details
#29	ACCEPTED	0.02 s	3	details
#30	ACCEPTED	0.02 s	3	details
#31	ACCEPTED	0.02 s	3	details
#32	ACCEPTED	0.02 s	3	details
#33	ACCEPTED	0.02 s	3	details
#34	ACCEPTED	0.02 s	3	details
#35	ACCEPTED	0.02 s	3	details
#36	ACCEPTED	0.02 s	3	details
#37	ACCEPTED	0.01 s	3	details
#38	ACCEPTED	0.03 s	3	details
#39	ACCEPTED	0.02 s	3	details
#40	ACCEPTED	0.01 s	3	details
#41	ACCEPTED	0.01 s	3	details
#42	ACCEPTED	0.02 s	3	details

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:52:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < target.size(); i++)
                 ~~^~~~~~~~~~~~~~~
input/code.cpp:55: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;
	bool ended = true;
	for(int i = 0; i < target.size(); i++)
	{
		//cout << ended << endl;
		if(p < layer1.size() && i >= layer1[p])
		{
			//cout << "i: " << i << ", lp: " << layer1[p] << ", p: " << p << endl;
			i = layer1[p] + stamp.size() - 1;
			p++;
			ended = true;
			continue;
		}
 
		bool counting = false;
		int j = 0, longest = 0, longestBegin = -1, begin = -1;
		bool pended = ended;
		for(; j < stamp.size(); j++)
		{
			//cout << endl << j << " ";
 
			while(j < stamp.size() && (target[i] != stamp[j] || i + stamp.size() - j - 1 >= target.size())) j++;
 
			if(j == stamp.size())
				break;
 
			begin = j;
			int length = 0;
 
 
			if(i - begin < 0 || i - begin > target.size() - stamp.size())
				continue;
 
			bool bflag = !ended && j == 0;
 
			
			while(i+length < target.size() && j+length < stamp.size() && target[i+length] == stamp[j+length])
			{
				length++;
 
				if(length > longest || (pended && j + length == stamp.size()))
				//if((ended && j == 0) || (length > longest || (length == longest && j + length == stamp.size())))
				{
					longest = length;
					longestBegin = begin;
					ended = j + longest == stamp.size();
				}
			}
 
			if(bflag)
				break;
 
			//cout << "i: " << i << ", j: " << j << ", begin: " << begin << ", length: " << length << ", longestBegin: " << longestBegin << ", longest: " << longest << endl;
		}
		//cout << endl;
		
		if(longestBegin > -1)
		{
			bool flag = false;
			for(int j = 0; j < longestBegin; j++)
			{
				if(target[i - longestBegin + j] != stamp[j])
				{
					flag = true;
					break;
				}
			}
 
 
			if(longestBegin && flag)
				layer2.push_front(i - longestBegin);
			else
				layer2.push_back(i - longestBegin);
 
			//cout << i << ", " << i - longestBegin << endl;
 
			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);
 
	string comp = putStamps(fin);
	if(comp != target)
	{
		//cout << "-1" << endl;
 
		for(int i = 0; i < target.size(); i++)
		{
			if(target[i] != comp[i])
			{
				int j = i;
				while(target[j] != comp[j] && j < target.size() - 1)
					j++;
 
				if(target[j] == comp[j])
					j--;
 
				//cout << i << ", " << j << endl;
 
				int p = 0;
				bool pflag = true;
				for(int k = 0; k < fin.size(); k++)
				{
					if(pflag && fin[k] > j)
					{
						p = k;
						pflag = false;
					}
 
					if(fin[k] < fin[p])
						pflag = true;
				}
 
				int k = 0, ks = 0;
				while(i - ks + k < target.size() && k < stamp.size() && i - ks + k <= j)
				{
					if(target[i - ks + k] == stamp[k])
					{
						k++;
					}
					else
					{
						ks++;
						k = 0;
					}
				}
 
				if(i - ks > 0)
					fin.insert(fin.begin() + p, i - ks);
			}
		}
		//return 0;
	}
 
	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: ACCEPTED

input
`BBBBBBBBBB B` view save

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

user output
`10 1 2 3 4 5 6 7 8 9 10` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`AABBABABAB AB` view save

correct output
`6 1 9 7 5 3 2` view save

user output
`6 3 1 2 5 7 9` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`AABAAABAAA AABAA` view save

correct output
`4 6 5 2 1` view save

user output
`3 6 1 5` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`BAAAAAABBB BAAAAAABB` view save

correct output
`2 2 1` view save

user output
`2 2 1` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`AAABBABBAA AAABBABBAA` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`GGGGGGGGGG G` view save

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

user output
`10 1 2 3 4 5 6 7 8 9 10` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`QUUQUUQUQU QU` view save

correct output
`6 9 7 5 4 2 1` view save

user output
`6 5 2 1 4 7 9` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`DWXDWDWXHJ DWXHJ` view save

correct output
`3 1 4 6` view save

user output
`3 1 4 6` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`FSOCRDGQBB FSOCRDGQB` view save

correct output
`2 2 1` view save

user output
`2 2 1` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`OETMIMPUPD OETMIMPUPD` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 11

Group: 1

Verdict: ACCEPTED

input
`DOWEUOWUEU DOWEU` view save

correct output
`-1` view save

user output
`-1` view save

Test 12

Group: 1

Verdict: ACCEPTED

input
`JQZYVSIWTE JQZVYSIWTE` view save

correct output
`-1` view save

user output
`-1` view save

Test 13

Group: 1

Verdict: ACCEPTED

input
`ABABABABA ABA` view save

correct output
`4 7 5 3 1` view save

user output
`4 1 3 5 7` view save

Test 14

Group: 1

Verdict: ACCEPTED

input
`AAAAAAAAAA AAAAAAAAAB` view save

correct output
`-1` view save

user output
`-1` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...` view save

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

user output
`100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` Truncated

Test 16

Group: 2

Verdict: ACCEPTED

input
`BABABAAAAAAAAAAAAAAAAAABABAAAA...` view save

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

user output
`36 69 68 67 66 65 64 53 52 51 50 ...` Truncated

Test 17

Group: 2

Verdict: ACCEPTED

input
`ABABAAAAABABBBBAAAABBBBAABBBBB...` view save

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

user output
`22 51 50 43 41 31 28 26 24 21 20 ...` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`AAABABAAAABBBBBABABBAABBABABBA...` view save

correct output
`2 1 2` view save

user output
`2 1 2` view save

Test 19

Group: 2

Verdict: ACCEPTED

input
`AABABBBBBBAABBABABBBBBBAABBAAA...` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 20

Group: 2

Verdict: ACCEPTED

input
`SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...` view save

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

user output
`100 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` Truncated

Test 21

Group: 2

Verdict: ACCEPTED

input
`NNNININIMNIMKLMXCNIMKLMXCDEIMK...` view save

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

user output
`18 74 58 27 1 2 3 5 7 10 37 64 79...` view save

Test 22

Group: 2

Verdict: ACCEPTED

input
`VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...` view save

correct output
`3 51 2 1` view save

user output
`2 1 51` view save

Test 23

Group: 2

Verdict: ACCEPTED

input
`IISNROLHLOJIWPTVFHFLUQRIROVLYP...` view save

correct output
`2 1 2` view save

user output
`2 1 2` view save

Test 24

Group: 2

Verdict: ACCEPTED

input
`WPMEMERJXXADLKONUZPUUFTPSXDHIV...` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 25

Group: 2

Verdict: ACCEPTED

input
`LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...` view save

correct output
`-1` view save

user output
`-1` view save

Test 26

Group: 2

Verdict: ACCEPTED

input
`IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...` view save

correct output
`-1` view save

user output
`-1` view save

Test 27

Group: 2

Verdict: ACCEPTED

input
`ABABABABABABABABABABABABABABAB...` view save

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

user output
`49 1 3 5 7 9 11 13 15 17 19 21 23...` Truncated

Test 28

Group: 2

Verdict: ACCEPTED

input
`AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` view save

correct output
`-1` view save

user output
`-1` view save

Test 29

Group: 3

Verdict: ACCEPTED

input
`BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...` view save

correct output
`1000 1000 999 998 997 996 995 994 9...` view save

user output
`1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` Truncated

Test 30

Group: 3

Verdict: ACCEPTED

input
`BBBBBBBBAABBBBBBBBAABBBBBBBAAB...` view save

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

user output
`229 971 954 953 950 946 926 924 90...` Truncated

Test 31

Group: 3

Verdict: ACCEPTED

input
`AABBBABAABABAAABBAAAAAAABBBAAB...` view save

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

user output
`55 901 900 897 896 895 885 884 88...` Truncated

Test 32

Group: 3

Verdict: ACCEPTED

input
`ABBAAABAAABAAAAABBABABBABBABBB...` view save

correct output
`2 2 1` view save

user output
`2 2 1` view save

Test 33

Group: 3

Verdict: ACCEPTED

input
`BAAABBABBBAAAABAAAABBBBABAABAA...` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 34

Group: 3

Verdict: ACCEPTED

input
`UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...` view save

correct output
`1000 1000 999 998 997 996 995 994 9...` view save

user output
`1000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` Truncated

Test 35

Group: 3

Verdict: ACCEPTED

input
`KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...` view save

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

user output
`178 991 985 979 977 976 965 960 95...` Truncated

Test 36

Group: 3

Verdict: ACCEPTED

input
`ILYLILYLVJILYLVJZCCQDLFRLSXZDM...` view save

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

user output
`21 856 671 608 504 413 257 216 54...` view save

Test 37

Group: 3

Verdict: ACCEPTED

input
`ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...` view save

correct output
`2 1 2` view save

user output
`2 1 2` view save

Test 38

Group: 3

Verdict: ACCEPTED

input
`FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 39

Group: 3

Verdict: ACCEPTED

input
`AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...` view save

correct output
`-1` view save

user output
`-1` view save

Test 40

Group: 3

Verdict: ACCEPTED

input
`QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...` view save

correct output
`-1` view save

user output
`-1` view save

Test 41

Group: 3

Verdict: ACCEPTED

input
`ABABABABABABABABABABABABABABAB...` view save

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

user output
`499 1 3 5 7 9 11 13 15 17 19 21 23...` Truncated

Test 42

Group: 3

Verdict: ACCEPTED

input
`AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` view save

correct output
`-1` view save

user output
`-1` view save

Datatähti 2019 alku

Leimasin

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Tasks

Submissions (Ilmari2000)