CSES - Datatähti 2019 alku

Submission details
Task:	Leimasin
Sender:	Yytsi
Submission time:	2018-10-02 17:41:42 +0300
Language:	C++
Status:	READY
Result:	0

Feedback
subtask	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

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

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:40:2: note: in expansion of macro 'FOR'
  FOR(i,1,x.size()) {
  ^~~
input/code.cpp: In function 'void makeCompact()':
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:100:2: note: in expansion of macro 'FOR'
  FOR(i,0,temp.size()-1) {
  ^~~

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 = 911382319, B = 972663749;
ll pA[N];
ll H[N], HASH[N];
ll pre[N], suff[N];
int n, m;
vector<int> pres, sufs, full;

// 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;

set<pii> vr;
bool proc[N]; // processed
int pr = 0;

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

void solved() {
	int sz=pres.size()+full.size()+sufs.size();
	reverse(pres.begin(), pres.end());
	reverse(sufs.begin(), sufs.end());
	for (int pr : pres) paint(pr);
	for (int sf : sufs) paint(sf);
	for (int f : full) paint(f);
	
	cout<<sz<<"\n";
	for (int pr : pres) cout<<pr+1<<" ";
	for (int sf : sufs) cout<<sf+1<<" ";
	for (int f : full) cout<<f+1<<" ";
	exit(0);
}

void addProc(int x) {
	if (!proc[x]) pr++;
	proc[x] = true;
	if (pr == n) solved();
}

// inclusive
void process(int a, int b) {
	FOR(j,a,b+1) addProc(j);
}

void makeCompact() {
	set<pii> nw;
	vector<pii> temp;
	for (auto seg : vr) temp.pb(seg), nw.insert(seg);
	FOR(i,0,temp.size()-1) {
		if (temp[i].ss+1 == temp[i+1].ff) {
			// Concatenate
			vr.erase(temp[i]);
			vr.erase(temp[i+1]);
			vr.insert({temp[i].ff, temp[i+1].ss});
			cout<<"("<<temp[i].ff<<","<<temp[i].ss<<") & ";
			cout<<"("<<temp[i+1].ff<<","<<temp[i].ss<<") -> ";
			cout<<"("<<temp[i].ff<<","<<temp[i+1].ss<<")\n";
			temp[i+1] = {temp[i].ff, temp[i+1].ss};
		}
	}
	vr = nw;
}

int main() {
	IO;
	cin>>s; cin>>L;
	n = s.size();
	m = L.size();
	
	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;
	}
	
	FOR(j,0,n) w+="?";
	
	hsh(L);
	ll label = pure(L);
	
	// Find all labels
	FOR(i,0,n-m+1) {
		if (proc[i]) continue;
		// Match for label
		if (rq(i,i+m-1) == label) {
			full.pb(i);
			vr.insert({i,i+m-1});
			process(i,i+m-1);
		}
	}
	
	while (vr.size()) {
		//makeCompact();
		// Try to spread a segment
		bool ext = false;
		auto seg = *vr.begin();
		int a = seg.ff, b = seg.ss;
		
		// Check for any prefix
		for (int l=1; l<=m; l++) {
			int lp = a-l;
			if (lp < 0) continue;
			if (proc[lp]) break;
			if (rq(lp,a-1) == pre[l]) {
				cout<<"found prefix at "<<lp+1<<"\n";
				vr.erase(vr.begin());
				vr.insert({lp, b});
				pres.pb(lp);
				process(lp, a-1);
				ext = true;
				break;
			}
		}
		
		if (ext) continue;
		
		// Check for any suffix, as no prefix was found
		for (int l=1; l<=m; l++) {
			int rp = b+l;
			if (rp >= n) continue;
			if (proc[rp]) break;
			if (rq(b+1,rp) == suff[l]) {
				vr.erase(vr.begin());
				vr.insert({a,rp});
				sufs.pb(rp-m+1);
				process(b+1, rp);
				ext = true;
			}
		}
		
		if (ext) continue;
		
		vr.erase(vr.begin());
	}
	
	cout<<"-1\n";
}

Test details

Test 1

Subtask: 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

Subtask: 1

Verdict: WRONG ANSWER

input
`AABBABABAB AB` view save

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

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

Test 3

Subtask: 1

Verdict: ACCEPTED

input
`AABAAABAAA AABAA` view save

correct output
`4 6 5 2 1` view save

user output
`4 6 5 2 1` view save

Test 4

Subtask: 1

Verdict: ACCEPTED

input
`BAAAAAABBB BAAAAAABB` view save

correct output
`2 2 1` view save

user output
`2 2 1` view save

Test 5

Subtask: 1

Verdict: ACCEPTED

input
`AAABBABBAA AAABBABBAA` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 6

Subtask: 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

Subtask: 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

Subtask: 1

Verdict: WRONG ANSWER

input
`DWXDWDWXHJ DWXHJ` view save

correct output
`3 1 4 6` view save

user output
`found prefix at 4 found prefix at 1 3 1 4 6` view save

Test 9

Subtask: 1

Verdict: ACCEPTED

input
`FSOCRDGQBB FSOCRDGQB` view save

correct output
`2 2 1` view save

user output
`2 2 1` view save

Test 10

Subtask: 1

Verdict: ACCEPTED

input
`OETMIMPUPD OETMIMPUPD` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 11

Subtask: 1

Verdict: ACCEPTED

input
`DOWEUOWUEU DOWEU` view save

correct output
`-1` view save

user output
`-1` view save

Test 12

Subtask: 1

Verdict: ACCEPTED

input
`JQZYVSIWTE JQZVYSIWTE` view save

correct output
`-1` view save

user output
`-1` view save

Test 13

Subtask: 1

Verdict: WRONG ANSWER

input
`ABABABABA ABA` view save

correct output
`4 7 5 3 1` view save

user output
`-1` view save

Test 14

Subtask: 1

Verdict: ACCEPTED

input
`AAAAAAAAAA AAAAAAAAAB` view save

correct output
`-1` view save

user output
`-1` view save

Test 15

Subtask: 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

Subtask: 2

Verdict: WRONG ANSWER

input
`BABABAAAAAAAAAAAAAAAAAABABAAAA...` view save

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

user output
`found prefix at 1 found prefix at 24 found prefix at 45 found prefix at 43 found prefix at ...` Truncated

Test 17

Subtask: 2

Verdict: ACCEPTED

input
`ABABAAAAABABBBBAAAABBBBAABBBBB...` view save

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

user output
`6 51 50 43 41 3 1` view save

Test 18

Subtask: 2

Verdict: WRONG ANSWER

input
`AAABABAAAABBBBBABABBAABBABABBA...` view save

correct output
`2 1 2` view save

user output
`found prefix at 1 2 1 2` view save

Test 19

Subtask: 2

Verdict: ACCEPTED

input
`AABABBBBBBAABBABABBBBBBAABBAAA...` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 20

Subtask: 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

Subtask: 2

Verdict: WRONG ANSWER

input
`NNNININIMNIMKLMXCNIMKLMXCDEIMK...` view save

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

user output
`found prefix at 10 found prefix at 7 found prefix at 5 found prefix at 3 found prefix at 2 ...` Truncated

Test 22

Subtask: 2

Verdict: ACCEPTED

input
`VYQFNHMVTKOEYCXWINLKLHVFMEPQEU...` view save

correct output
`3 51 2 1` view save

user output
`2 1 51` view save

Test 23

Subtask: 2

Verdict: WRONG ANSWER

input
`IISNROLHLOJIWPTVFHFLUQRIROVLYP...` view save

correct output
`2 1 2` view save

user output
`found prefix at 1 2 1 2` view save

Test 24

Subtask: 2

Verdict: ACCEPTED

input
`WPMEMERJXXADLKONUZPUUFTPSXDHIV...` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 25

Subtask: 2

Verdict: WRONG ANSWER

input
`LNSBGZAWFJZAWFJWFJLNSBLNSBGZAL...` view save

correct output
`-1` view save

user output
`found prefix at 23 found prefix at 19 found prefix at 42 found prefix at 59 found prefix a ...` Truncated

Test 26

Subtask: 2

Verdict: ACCEPTED

input
`IPIPYFUMRIPYFUMRLPIIIPYFIPYFUM...` view save

correct output
`-1` view save

user output
`-1` view save

Test 27

Subtask: 2

Verdict: WRONG ANSWER

input
`ABABABABABABABABABABABABABABAB...` view save

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

user output
`-1` view save

Test 28

Subtask: 2

Verdict: ACCEPTED

input
`AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA...` view save

correct output
`-1` view save

user output
`-1` view save

Test 29

Subtask: 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

Subtask: 3

Verdict: WRONG ANSWER

input
`BBBBBBBBAABBBBBBBBAABBBBBBBAAB...` view save

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

user output
`found prefix at 23 found prefix at 22 found prefix at 21 found prefix at 15 found prefix a ...` Truncated

Test 31

Subtask: 3

Verdict: WRONG ANSWER

input
`AABBBABAABABAAABBAAAAAAABBBAAB...` view save

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

user output
`found prefix at 477 found prefix at 476 found prefix at 475 found prefix at 437 found pref ...` Truncated

Test 32

Subtask: 3

Verdict: ACCEPTED

input
`ABBAAABAAABAAAAABBABABBABBABBB...` view save

correct output
`2 2 1` view save

user output
`2 2 1` view save

Test 33

Subtask: 3

Verdict: ACCEPTED

input
`BAAABBABBBAAAABAAAABBBBABAABAA...` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 34

Subtask: 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

Subtask: 3

Verdict: WRONG ANSWER

input
`KSBMRKKSBMRZXBDKSKSBMRZXBDAMRZ...` view save

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

user output
`found prefix at 16 found prefix at 7 found prefix at 6 found prefix at 1 found prefix at 4 ...` Truncated

Test 36

Subtask: 3

Verdict: WRONG ANSWER

input
`ILYLILYLVJILYLVJZCCQDLFRLSXZDM...` view save

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

user output
`found prefix at 5 found prefix at 1 found prefix at 142 found prefix at 113 found prefix a ...` Truncated

Test 37

Subtask: 3

Verdict: WRONG ANSWER

input
`ZZJZNKHDLJBPXIAZNJIIGBEEJFSDAF...` view save

correct output
`2 1 2` view save

user output
`found prefix at 1 2 1 2` view save

Test 38

Subtask: 3

Verdict: ACCEPTED

input
`FIMWTOLSRKOWYDPCOFUJZMXJEJFKSU...` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 39

Subtask: 3

Verdict: WRONG ANSWER

input
`AIVHCGUMKSTIYBRNPONXHRFVBKPYHX...` view save

correct output
`-1` view save

user output
`found prefix at 59 found prefix at 151 found prefix at 332 found prefix at 289 found prefi ...` Truncated

Test 40

Subtask: 3

Verdict: WRONG ANSWER

input
`QPMSLIDCLFLBEXGVVQQNSVKJYXGETC...` view save

correct output
`-1` view save

user output
`found prefix at 530 -1` view save

Test 41

Subtask: 3

Verdict: WRONG ANSWER

input
`ABABABABABABABABABABABABABABAB...` view save

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

user output
`-1` view save

Test 42

Subtask: 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 (Yytsi)