oj.uz

Submission #47569

# Submission time Handle Problem Language Result Execution time Memory
47569 2018-05-05T04:26:44 Z cheater2k Round words (IZhO13_rowords) C++17
28 / 100
 278 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-1][j]){
				dp[i][j] = dp[i-1][j];
				nxt[i][j] = 3;
			}
			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][j-1]){
				dp[i][j] = dp[i][j-1];
				nxt[i][j] = 1;
			}
		}
	}
	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
28.0 / 100.0

# Verdict Execution time Memory 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 1144 KB Output is correct
5 Incorrect 3 ms 1016 KB Output isn't correct
6 Correct 47 ms 17912 KB Output is correct
7 Correct 65 ms 31736 KB Output is correct
8 Incorrect 91 ms 31736 KB Output isn't correct
9 Incorrect 102 ms 31736 KB Output isn't correct
10 Incorrect 110 ms 31796 KB Output isn't correct
11 Incorrect 120 ms 34936 KB Output isn't correct
12 Correct 120 ms 38008 KB Output is correct
13 Incorrect 156 ms 38008 KB Output isn't correct
14 Incorrect 129 ms 36164 KB Output isn't correct
15 Incorrect 157 ms 39092 KB Output isn't correct
16 Incorrect 110 ms 34140 KB Output isn't correct
17 Incorrect 140 ms 36572 KB Output isn't correct
18 Incorrect 190 ms 44880 KB Output isn't correct
19 Incorrect 100 ms 31736 KB Output isn't correct
20 Incorrect 151 ms 40040 KB Output isn't correct
21 Incorrect 142 ms 31608 KB Output isn't correct
22 Incorrect 187 ms 36340 KB Output isn't correct
23 Incorrect 198 ms 39124 KB Output isn't correct
24 Incorrect 226 ms 41336 KB Output isn't correct
25 Incorrect 278 ms 46584 KB Output isn't correct