oj.uz

답안 #26902

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
26902 2017-07-07T06:02:31 Z gs14004 원형 문자열 (IZhO13_rowords) C++14
100 / 100
 275 ms 46584 KB 
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <complex>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
typedef complex<double> pnt;
 
string s1, s2;
 
int dp[4005][2005];
int nxt[4005][2005];
int n, m;
 
void reroot(int px){
	int py = 1;
	while(py <= m && nxt[px][py] != 2) py++;
	nxt[px][py] = 1;
	while(px < 2 * n && py < m){
		if(nxt[px+1][py] == 3){
			px++;
			nxt[px][py] = 1;
		}
		else if(nxt[px+1][py+1] == 2){
			px++;
			py++;
			nxt[px][py] = 1;
		}
		else py++;
	}
	while(px < 2 * n && nxt[px+1][py] == 3){
		px++;
		nxt[px][py] = 1;
	}
}
 
int track(int x, int y, int e){
	int ret = 0;
	while(y != 0 && x != e){
		if(nxt[x][y] == 1) y--;
		else if(nxt[x][y] == 2) ret += (s1[x] == s2[y]), x--, y--;
		else if(nxt[x][y] == 3) x--;
	}
	return ret;
}
 
int solve(string a, string b){
	n = a.size(), m = b.size();
	s1 = "#" + a + a;
	s2 = '#' + b;
	for(int i=0; i<=2*n; i++){
		for(int j=0; j<=m; j++){
			if(j == 0){
				nxt[i][j] = 3;
				continue;
			}
			if(i == 0){
				nxt[i][j] = 1;
				continue;
			}
			dp[i][j] = -1;
			if(dp[i][j] < dp[i][j-1]){
				dp[i][j] = dp[i][j-1];
				nxt[i][j] = 1;
			}
			if(dp[i][j] < dp[i-1][j-1] + (s1[i] == s2[j])){
				dp[i][j] = dp[i-1][j-1] + (s1[i] == s2[j]);
				nxt[i][j] = 2;
			}
			if(dp[i][j] < dp[i-1][j]){
				dp[i][j] = dp[i-1][j];
				nxt[i][j] = 3;
			}
		}
	}
	int ret = dp[n][m];
	for(int i=1; i<n; i++){
		reroot(i);
		ret = max(ret, track(n+i, m, i));
	}
	return ret;
}
 
int main(){
	string a, b;
	cin >> a >> b;
	int ret = solve(a, b);
	reverse(b.begin(), b.end());
	ret = max(ret, solve(a, b));
	cout << ret;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 632 KB Output is correct
4 Correct 3 ms 1016 KB Output is correct
5 Correct 3 ms 1016 KB Output is correct
6 Correct 34 ms 17912 KB Output is correct
7 Correct 54 ms 31736 KB Output is correct
8 Correct 119 ms 31864 KB Output is correct
9 Correct 119 ms 31736 KB Output is correct
10 Correct 110 ms 31776 KB Output is correct
11 Correct 129 ms 34996 KB Output is correct
12 Correct 95 ms 38088 KB Output is correct
13 Correct 157 ms 38108 KB Output is correct
14 Correct 133 ms 36088 KB Output is correct
15 Correct 150 ms 39132 KB Output is correct
16 Correct 132 ms 34168 KB Output is correct
17 Correct 148 ms 36680 KB Output is correct
18 Correct 186 ms 44852 KB Output is correct
19 Correct 102 ms 31708 KB Output is correct
20 Correct 180 ms 40040 KB Output is correct
21 Correct 152 ms 31736 KB Output is correct
22 Correct 190 ms 36304 KB Output is correct
23 Correct 200 ms 39288 KB Output is correct
24 Correct 238 ms 41212 KB Output is correct
25 Correct 275 ms 46584 KB Output is correct