CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:Yytsi
Submission time:2018-10-02 11:53:00 +0300
Language:C++
Status:READY
Result:29
Feedback
groupverdictscore
#1ACCEPTED29
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1details
#2ACCEPTED0.01 s1details
#3ACCEPTED0.02 s1details
#4ACCEPTED0.02 s1details
#5ACCEPTED0.02 s1details
#6ACCEPTED0.01 s1details
#7ACCEPTED0.03 s1details
#8ACCEPTED0.01 s1details
#9ACCEPTED0.02 s1details
#10ACCEPTED0.02 s1details
#11ACCEPTED0.03 s1details
#12ACCEPTED0.02 s1details
#13ACCEPTED0.02 s1details
#14ACCEPTED0.02 s1details
#15ACCEPTED0.02 s2details
#160.01 s2details
#170.01 s2details
#18ACCEPTED0.01 s2details
#19ACCEPTED0.02 s2details
#20ACCEPTED0.01 s2details
#210.01 s2details
#22ACCEPTED0.02 s2details
#23ACCEPTED0.02 s2details
#24ACCEPTED0.01 s2details
#25ACCEPTED0.01 s2details
#26ACCEPTED0.02 s2details
#27ACCEPTED0.01 s2details
#28ACCEPTED0.01 s2details
#29ACCEPTED0.01 s3details
#300.03 s3details
#310.02 s3details
#32ACCEPTED0.02 s3details
#33ACCEPTED0.02 s3details
#34ACCEPTED0.02 s3details
#350.02 s3details
#360.01 s3details
#37ACCEPTED0.01 s3details
#38ACCEPTED0.01 s3details
#39ACCEPTED0.02 s3details
#40ACCEPTED0.02 s3details
#41ACCEPTED0.03 s3details
#42ACCEPTED0.01 s3details

Code

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define IO ios_base::sync_with_stdio(0); cin.tie(0)
#define ff first
#define ss second
#define pb push_back
#define INF 2147483647
#define LINF (1LL<<61LL)
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

string s, L;
int n, m;
vector<int> full, pres, suff;

void fail() {
	cout<<"-1\n"; exit(0);
}

// 0-indexed
void stamp(string& x, int idx) {
	FOR(j,0,m) x[j+idx] = L[j];
}

void checkTriv() {
	if ((s[0] != L[0]) || (s[n-1] != L[m-1])) fail();
	
	set<char> cc;
	FOR(j,0,m) cc.insert(L[j]);
	FOR(i,0,n) if (cc.find(s[i]) == cc.end()) fail();
}

int main() {
	IO; cin>>s; cin>>L;
	n = s.size();
	m = L.size();
	
	checkTriv();
	
	string w = "";
	FOR(j,0,n) w+="?";
	
	
	FOR(p,0,n-m+1) {
		stamp(w,p);
		
		int same = 0;
		FOR(j,p,p+m) {
			if (w[j] == s[j]) same++;
			else break;
		}
		if (same == m) {
			full.pb(p+1);
			continue;
		}
		if (same == 0) {
			// maybe the patch covers a suffix?
			for (int j=p+m-1; j>=p; j--) {
				if (w[j] == s[j]) same++;
				else break;
			}
			if (same == 0) continue;
			else suff.pb(p+1);
		} else {
			pres.pb(p+1);
		}
		// same > 0
		
	}
	
	FOR(j,0,n) w[j] = '?';
	reverse(suff.begin(), suff.end());
	int sz = suff.size()+pres.size()+full.size();
	for (int pr : pres) stamp(w, pr-1);
	for (int sf : suff) stamp(w, sf-1);
	for (int f : full) stamp(w, f-1);
	
	if (w != s) fail();
	
	cout<<sz<<"\n";
	for (int pr : pres) cout<<pr<<" ";
	for (int sf : suff) cout<<sf<<" ";
	for (int f : full) cout<<f<<" ";
}












Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
BBBBBBBBBB
B

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

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

Test 2

Group: 1

Verdict: ACCEPTED

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
6
1 3 2 5 7 9 

Test 3

Group: 1

Verdict: ACCEPTED

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
5
2 4 6 1 5 

Test 4

Group: 1

Verdict: ACCEPTED

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
2
2 1 

Test 5

Group: 1

Verdict: ACCEPTED

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
1

Test 6

Group: 1

Verdict: ACCEPTED

input
GGGGGGGGGG
G

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

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

Test 7

Group: 1

Verdict: ACCEPTED

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
6
5 2 1 4 7 9 

Test 8

Group: 1

Verdict: ACCEPTED

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
3
1 4 6 

Test 9

Group: 1

Verdict: ACCEPTED

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
2
2 1 

Test 10

Group: 1

Verdict: ACCEPTED

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
1

Test 11

Group: 1

Verdict: ACCEPTED

input
DOWEUOWUEU
DOWEU

correct output
-1

user output
-1

Test 12

Group: 1

Verdict: ACCEPTED

input
JQZYVSIWTE
JQZVYSIWTE

correct output
-1

user output
-1

Test 13

Group: 1

Verdict: ACCEPTED

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
4
1 3 5 7 

Test 14

Group: 1

Verdict: ACCEPTED

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
-1

Test 15

Group: 2

Verdict: ACCEPTED

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

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

Test 16

Group: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
-1

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
-1

Test 18

Group: 2

Verdict: ACCEPTED

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
2
1 2 

Test 19

Group: 2

Verdict: ACCEPTED

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
1

Test 20

Group: 2

Verdict: ACCEPTED

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

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

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

Test 21

Group: 2

Verdict:

input
NNNININIMNIMKLMXCNIMKLMXCDEIMK...

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

user output
-1

Test 22

Group: 2

Verdict: ACCEPTED

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
8
8 23 50 24 9 2 1 51 

Test 23

Group: 2

Verdict: ACCEPTED

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
2
1 2 

Test 24

Group: 2

Verdict: ACCEPTED

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
1

Test 25

Group: 2

Verdict: ACCEPTED

input
LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...

correct output
-1

user output
-1

Test 26

Group: 2

Verdict: ACCEPTED

input
IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...

correct output
-1

user output
-1

Test 27

Group: 2

Verdict: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

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

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

Test 28

Group: 2

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1

Test 29

Group: 3

Verdict: ACCEPTED

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

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

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
-1

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
-1

Test 32

Group: 3

Verdict: ACCEPTED

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
2
2 1 

Test 33

Group: 3

Verdict: ACCEPTED

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
1

Test 34

Group: 3

Verdict: ACCEPTED

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

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

Test 35

Group: 3

Verdict:

input
KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...

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

user output
-1

Test 36

Group: 3

Verdict:

input
ILYLILYLVJILYLVJZCCQDLFRLSXZDM...

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

user output
-1

Test 37

Group: 3

Verdict: ACCEPTED

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
2
1 2 

Test 38

Group: 3

Verdict: ACCEPTED

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
1

Test 39

Group: 3

Verdict: ACCEPTED

input
AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...

correct output
-1

user output
-1

Test 40

Group: 3

Verdict: ACCEPTED

input
QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...

correct output
-1

user output
-1

Test 41

Group: 3

Verdict: ACCEPTED

input
ABABABABABABABABABABABABABABAB...

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

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

Test 42

Group: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1