oj.uz

Submission #133087

# Submission time Handle Problem Language Result Execution time Memory
133087 2019-07-20T07:11:36 Z E869120 Necklace (Subtask 1-3) (BOI19_necklace1) C++14
85 / 85
 485 ms 71416 KB 
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <tuple>
using namespace std;

int N, M, pa[3009][3009], pb[3009][3009];
int EA[6009], EB[6009];

tuple<int, int, int> solve(string S, string T) {
	N = S.size(); M = T.size();
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++) {
			pa[i][j] = 0;
			if (S[i] == T[j]) pa[i][j] = 1;
			if (i >= 1 && j >= 1 && S[i] == T[j]) {
				pa[i][j] = pa[i - 1][j - 1] + 1;
			}
		}
	}
	for (int i = N - 1; i >= 0; i--) {
		for (int j = M - 1; j >= 0; j--) {
			pb[i][j] = 0;
			if (S[i] == T[j]) pb[i][j] = 1;
			if (i < N - 1 && j < M - 1 && S[i] == T[j]) {
				pb[i][j] = pb[i + 1][j + 1] + 1;
			}
		}
	}

	int maxn = 0; pair<int, int> maxid = make_pair(-1, -1);
	for (int i = 0; i <= N; i++) {
		// S における境界が i の場合
		vector<int> A, B;
		for (int j = 0; j < N; j++) {
			if (i == N) A.push_back(0);
			else A.push_back(pb[i][j]);
		}
		for (int j = 0; j < N; j++) {
			if (i == 0) B.push_back(0);
			else B.push_back(pa[i - 1][j]);
		}
		for (int j = 0; j <= N * 2; j++) { EA[j] = (1 << 29); EB[j] = -(1 << 29); }
		for (int j = 0; j < N; j++) {
			EA[A[j] + j] = min(EA[A[j] + j], j);
			EB[max(0, -B[j] + j + 1)] = max(EB[max(0, -B[j] + j + 1)], j);
		}
		
		// ret1 には条件を満たす最も左のインデックスを記録
		int ret1 = -(1 << 29);
		for (int j = 0; j <= N * 2; j++) {
			ret1 = max(ret1, EB[j]);
			int cr = ret1, cl = EA[j];
			if (maxn < cr - cl + 1) {
				maxn = cr - cl + 1;
				maxid = make_pair(i - B[cr], cl);
			}
		}
	}
	return make_tuple(maxn, maxid.first, maxid.second);
}

int main() {
	string A1, B1, B2; cin >> A1 >> B1; B2 = B1; reverse(B2.begin(), B2.end());
	tuple<int, int, int> v1 = solve(A1, B1);
	tuple<int, int, int> v2 = solve(A1, B2);

	cout << max(get<0>(v1), get<0>(v2)) << endl;
	if (get<0>(v1) > get<0>(v2)) cout << get<1>(v1) << " " << get<2>(v1) << endl;
	if (get<0>(v1) <= get<0>(v2)) cout << get<1>(v2) << " " << M - (get<2>(v2) + get<0>(v2)) << endl;
	return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 14 ms 4832 KB Output is correct
7 Correct 15 ms 4732 KB Output is correct
8 Correct 14 ms 4472 KB Output is correct
9 Correct 15 ms 4600 KB Output is correct
10 Correct 14 ms 4728 KB Output is correct
11 Correct 14 ms 4728 KB Output is correct
12 Correct 14 ms 4572 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1016 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 3 ms 1272 KB Output is correct
6 Correct 14 ms 4832 KB Output is correct
7 Correct 15 ms 4732 KB Output is correct
8 Correct 14 ms 4472 KB Output is correct
9 Correct 15 ms 4600 KB Output is correct
10 Correct 14 ms 4728 KB Output is correct
11 Correct 14 ms 4728 KB Output is correct
12 Correct 14 ms 4572 KB Output is correct
13 Correct 485 ms 71152 KB Output is correct
14 Correct 472 ms 71416 KB Output is correct
15 Correct 484 ms 68728 KB Output is correct
16 Correct 478 ms 71004 KB Output is correct
17 Correct 454 ms 70008 KB Output is correct
18 Correct 468 ms 70904 KB Output is correct
19 Correct 467 ms 70904 KB Output is correct
20 Correct 479 ms 69880 KB Output is correct
21 Correct 473 ms 70264 KB Output is correct