CSES - Datatähti 2019 alku - Results
Submission details
Task:Leimasin
Sender:Yytsi
Submission time:2018-10-01 20:40:23 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1details
#20.01 s1details
#30.02 s1details
#40.01 s1details
#50.02 s1details
#60.02 s1details
#70.02 s1details
#80.02 s1details
#90.01 s1details
#100.01 s1details
#11ACCEPTED0.02 s1details
#12ACCEPTED0.01 s1details
#130.02 s1details
#14ACCEPTED0.03 s1details
#150.01 s2details
#160.03 s2details
#170.01 s2details
#180.02 s2details
#190.03 s2details
#200.01 s2details
#210.02 s2details
#220.01 s2details
#230.02 s2details
#240.02 s2details
#25ACCEPTED0.01 s2details
#26ACCEPTED0.01 s2details
#270.02 s2details
#28ACCEPTED0.02 s2details
#290.03 s3details
#300.03 s3details
#310.03 s3details
#320.02 s3details
#330.02 s3details
#340.02 s3details
#350.02 s3details
#360.01 s3details
#370.03 s3details
#380.02 s3details
#39ACCEPTED0.02 s3details
#40ACCEPTED0.02 s3details
#410.03 s3details
#42ACCEPTED0.02 s3details

Compiler report

input/code.cpp: In function 'void hsh(std::__cxx11::string)':
input/code.cpp:3:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define FOR(i, a, b) for (int i=a; i<(b); i++)
                                     ^
input/code.cpp:43:2: note: in expansion of macro 'FOR'
  FOR(i,1,x.size()) {
  ^~~

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;

#define N 1003
ll A = 911382323, B = 972663749;
ll pA[N];
ll H[N], HASH[N];
ll pre[N], suff[N];
int n, m;
vector<int> pres;
vector<int> sufs;
vector<int> full;
set<int> sfs;

// 0-indexed
ll rq(int a, int b) {
	if (a == 0) return H[b];
	ll h = (H[b]-H[a-1]*pA[b-a+1])%B;
	if (h<0) h+=B;
	return h;
}

ll ran(int a, int b) {
	if (a==0) return HASH[b];
	ll h = (HASH[b]-HASH[a-1]*pA[b-a+1])%B;
	if (h<0) h+=B;
	return h;
}

void hsh(string x) {
	HASH[0] = x[0];
	FOR(i,1,x.size()) {
		HASH[i] = (HASH[i-1]*A+x[i])%B;
	}
	FOR(l,0,m) {
		ll a = ran(0, l);
		ll b = ran(m-1-l,m-1);
		if (a < 0) a += B;
		if (b < 0) b += B;
		pre[l+1] = a;
		suff[l+1] = b;
	}
}

ll pure(const string& x) {
	ll h = 0;
	for (char c:x) h=(h*A+(ll)c)%B;
	return h;
}

string s, L;
string w = "";
void paint(int p) {
	FOR(j,0,m) w[j+p] = L[j]; 
}

int main() {
	IO;
	cin>>s; cin>>L;
	n = s.size();
	m = L.size();
	FOR(j,0,n) w+="?";
	
	pA[0] = 1;
	H[0] = s[0];
	FOR(i,1,n+1) {
		H[i] = (H[i-1]*A+s[i])%B;
		pA[i] = pA[i-1]*A%B;
	}
	
	hsh(L);
	int i = 0;
	for (;i<n;) {
		// Find block length!
		bool found = false;
		for (int l=m; l>0; l--) {
			if (i+l-1 >= n) continue;
			ll slice = rq(i,i+l-1);
			//cout<<"slice: ("<<i<<","<<i+l-1<<")\n";
			
			if (slice == pre[l]) {
				if (i+m-1 < n) {
					if (l!=m) pres.pb(i+1);
					else full.pb(i+1);
					//cout<<"flip on "<<i+1<<"\n";
					i += l;
					found = true;
					break;
				}
			}
			if (slice == suff[l]) {
				int p = i+l-1;
				if (p-m+1 >= 0) {
					int crd = i-(m-l)+1;
					if (l!=m) sufs.pb(crd);
					else full.pb(crd);
					//cout<<"flip on "<<crd<<"\n";
					i += l;
					found = true;
					sfs.insert(crd);
					break;
				}
			}
		}
		
		if (found) continue;
		// not found :(
		cout<<-1<<"\n";
		exit(0);
	}
	
	
	
	reverse(sufs.begin(), sufs.end());
	for (int pr : pres) {
		if (sfs.find(pr) != sfs.end()) {
			cout<<"-1\n";
			exit(0);
		}
	}
	cout<<pres.size()+full.size()+sufs.size()<<"\n";
	for (int pr : pres) cout<<"p"<<pr<<" ", paint(pr-1);
	for (int sf : sufs) cout<<"s"<<sf<<" ", paint(sf-1);
	for (int f : full) cout<<"f"<<f<<" ", paint(f-1);
	//cout<<w<<"\n";
}















Test details

Test 1

Group: 1

Verdict:

input
BBBBBBBBBB
B

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

user output
10
f1 f2 f3 f4 f5 f6 f7 f8 f9 f10...

Test 2

Group: 1

Verdict:

input
AABBABABAB
AB

correct output
6
1 9 7 5 3 2 

user output
6
p1 s3 f2 f5 f7 f9 

Test 3

Group: 1

Verdict:

input
AABAAABAAA
AABAA

correct output
4
6 5 2 1 

user output
3
s6 s5 f1 

Test 4

Group: 1

Verdict:

input
BAAAAAABBB
BAAAAAABB

correct output
2
2 1 

user output
2
s2 f1 

Test 5

Group: 1

Verdict:

input
AAABBABBAA
AAABBABBAA

correct output
1

user output
1
f1 

Test 6

Group: 1

Verdict:

input
GGGGGGGGGG
G

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

user output
10
f1 f2 f3 f4 f5 f6 f7 f8 f9 f10...

Test 7

Group: 1

Verdict:

input
QUUQUUQUQU
QU

correct output
6
9 7 5 4 2 1 

user output
6
s5 s2 f1 f4 f7 f9 

Test 8

Group: 1

Verdict:

input
DWXDWDWXHJ
DWXHJ

correct output
3
1 4 6 

user output
3
p1 p4 f6 

Test 9

Group: 1

Verdict:

input
FSOCRDGQBB
FSOCRDGQB

correct output
2
2 1 

user output
2
s2 f1 

Test 10

Group: 1

Verdict:

input
OETMIMPUPD
OETMIMPUPD

correct output
1

user output
1
f1 

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:

input
ABABABABA
ABA

correct output
4
7 5 3 1 

user output
4
s7 s5 s3 f1 

Test 14

Group: 1

Verdict: ACCEPTED

input
AAAAAAAAAA
AAAAAAAAAB

correct output
-1

user output
-1

Test 15

Group: 2

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
100
f1 f2 f3 f4 f5 f6 f7 f8 f9 f10...

Test 16

Group: 2

Verdict:

input
BABABAAAAAAAAAAAAAAAAAABABAAAA...

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

user output
15
p1 p24 p43 p89 s91 s69 s53 s33...

Test 17

Group: 2

Verdict:

input
ABABAAAAABABBBBAAAABBBBAABBBBB...

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

user output
5
s51 s50 s43 s41 f1 

Test 18

Group: 2

Verdict:

input
AAABABAAAABBBBBABABBAABBABABBA...

correct output
2
1 2 

user output
2
p1 s2 

Test 19

Group: 2

Verdict:

input
AABABBBBBBAABBABABBBBBBAABBAAA...

correct output
1

user output
1
f1 

Test 20

Group: 2

Verdict:

input
SSSSSSSSSSSSSSSSSSSSSSSSSSSSSS...

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

user output
100
f1 f2 f3 f4 f5 f6 f7 f8 f9 f10...

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:

input
VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...

correct output
3
51 2 1 

user output
2
f1 f51 

Test 23

Group: 2

Verdict:

input
IISNROLHLOJIWPTVFHFLUQRIROVLYP...

correct output
2
1 2 

user output
2
p1 f2 

Test 24

Group: 2

Verdict:

input
WPMEMERJXXADLKONUZPUUFTPSXDHIV...

correct output
1

user output
1
f1 

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:

input
ABABABABABABABABABABABABABABAB...

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

user output
49
s97 s95 s93 s91 s89 s87 s85 s8...

Test 28

Group: 2

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1

Test 29

Group: 3

Verdict:

input
BBBBBBBBBBBBBBBBBBBBBBBBBBBBBB...

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

user output
1000
f1 f2 f3 f4 f5 f6 f7 f8 f9 f10...

Test 30

Group: 3

Verdict:

input
BBBBBBBBAABBBBBBBBAABBBBBBBAAB...

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

user output
203
p1 p5 p14 p21 p36 p48 p68 p87 ...

Test 31

Group: 3

Verdict:

input
AABBBABAABABAAABBAAAAAAABBBAAB...

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

user output
116
p255 p408 p410 p413 p415 p420 ...

Test 32

Group: 3

Verdict:

input
ABBAAABAAABAAAAABBABABBABBABBB...

correct output
2
2 1 

user output
2
s2 f1 

Test 33

Group: 3

Verdict:

input
BAAABBABBBAAAABAAAABBBBABAABAA...

correct output
1

user output
1
f1 

Test 34

Group: 3

Verdict:

input
UUUUUUUUUUUUUUUUUUUUUUUUUUUUUU...

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

user output
1000
f1 f2 f3 f4 f5 f6 f7 f8 f9 f10...

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:

input
ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...

correct output
2
1 2 

user output
2
p1 f2 

Test 38

Group: 3

Verdict:

input
FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...

correct output
1

user output
1
f1 

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:

input
ABABABABABABABABABABABABABABAB...

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

user output
499
s997 s995 s993 s991 s989 s987 ...

Test 42

Group: 3

Verdict: ACCEPTED

input
AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...

correct output
-1

user output
-1