Submission #1261460

#	Time	Username	Problem	Language	Result	Execution time	Memory
1261460		ebrambill	Necklace (Subtask 1-3) (BOI19_necklace1)	C++17	85 / 85	370 ms	18096 KiB

necklace

//In the name of GOD

#include <bits/stdc++.h>
using namespace std;

const short int maxN=3e3+5;
short int n, m, lps[maxN][maxN], tmp[maxN<<1]={-1}, ans, Ct, Cs;
string s, t, ts;

void solve(bool rt, bool rs){
	for (short int i=m; i>=1; i--){
		for (short int j=i, cur=j-1; j<=n+m+1; j++, cur=j-1){
			while(ts[tmp[cur-i+1]+i]!=ts[j] and tmp[cur-i+1]>=0) cur=tmp[cur-i+1]+i-1;
			tmp[j-i+1]=tmp[cur-i+1]+1;
			if(j>m+1) lps[i][j-m-1]=tmp[j-i+1];
		}
		for (short int j=1; j<=n; j++){
			short int x=lps[i][j]+lps[i+lps[i][j]][j-lps[i][j]];
			if(x>ans) ans=x, Ct=(!rt ? i-1 : m-i-x+1), Cs=(!rs ? j-x : n-j);
		}
	}
}

int main(){
	cin >>s >>t;
	n=s.size(), m=t.size();
	ts='.'+t+'.'+s;
	solve(false, false);
	reverse(ts.begin()+m+2, ts.end());
	solve(false, true);
	reverse(ts.begin()+1, ts.begin()+m+1);
	solve(true, true);
	reverse(ts.begin()+m+2, ts.end());
	solve(true, false);
	cout <<ans <<endl <<Cs <<' ' <<Ct;
}

• Subtask 1: 25 / 25
• Subtask 2: 20 / 20
• Subtask 3: 40 / 40