oj.uz

Submission #13624

# Submission time Handle Problem Language Result Execution time Memory
13624 2015-02-25T13:32:26 Z tncks0121 Round words (IZhO13_rowords) C++14
100 / 100
 337 ms 56056 KB 
#define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <memory.h>
#include <math.h>
#include <assert.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <deque>
#include <utility>
#include <bitset>
#include <limits.h>
#include <time.h>

using namespace std;
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef unsigned int uint;
typedef long double llf;
typedef pair<int, int> pii;

const int Z = 2050;

int N, M;
char S[Z + Z], T[Z];

const int dx[] = { 0, -1, -1 };
const int dy[] = { -1, -1, 0 };

int tb[Z + Z][Z];
int par[Z + Z][Z];

int ans;

void solve() {
	for (int i = N + 1; i <= N + N; i++) S[i] = S[i - N];

	memset(par, -1, sizeof par);

	for (int i = 1; i <= N + N; i++) par[i][0] = 2;
	for (int j = 1; j <= M; j++) par[0][j] = 0;
	for (int i = 1; i <= N + N; i++) {
		for (int j = 1; j <= M; j++) {
			int cands[] = {
				tb[i][j - 1],
				tb[i - 1][j - 1] + (S[i] == T[j]),
				tb[i - 1][j]
			};
			tb[i][j] = *max_element(cands, cands + 3);
			par[i][j] = max_element(cands, cands + 3) - cands;
		}
	}

	ans = max(ans, tb[N][M]);
	for (int r = 1; r <= N; r++) {
		// drop the first row
		{
			int i = r;
			int j;
			for (j = 1; j <= M && par[r][j] != 1; j++);
			if (j <= M) {
				par[i][j] = 0;

				while (i < N + N && j <= M) {
					if (par[i + 1][j] == 2) par[++i][j] = 0;
					else if (j == M) break;
					else if (par[i + 1][j + 1] == 1) par[++i][++j] = 0;
					else ++j;
				}
			}
		}

		// calc answer
		{
			int ret = 0;
			for (int i = N + r, j = M; i > r && j > 0;) {
				int d = par[i][j];
				if (d == 1) ++ret;
				i += dx[d]; j += dy[d];
			}
			ans = max(ans, ret);
		}


	}
}

int main() {
	scanf("%s%s", S + 1, T + 1);
	N = strlen(S + 1);
	M = strlen(T + 1);

	solve();
	reverse(T + 1, T + M + 1);
	solve();

	printf("%d\n", ans);
	return 0;
}

Compilation message

rowords.cpp: In function 'int main()':
rowords.cpp:98:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s%s", S + 1, T + 1);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 33272 KB Output is correct
2 Correct 35 ms 33272 KB Output is correct
3 Correct 36 ms 33400 KB Output is correct
4 Correct 35 ms 33528 KB Output is correct
5 Correct 36 ms 33592 KB Output is correct
6 Correct 66 ms 41960 KB Output is correct
7 Correct 87 ms 49016 KB Output is correct
8 Correct 158 ms 49016 KB Output is correct
9 Correct 163 ms 49016 KB Output is correct
10 Correct 150 ms 49016 KB Output is correct
11 Correct 205 ms 50652 KB Output is correct
12 Correct 151 ms 52504 KB Output is correct
13 Correct 218 ms 52560 KB Output is correct
14 Correct 176 ms 51320 KB Output is correct
15 Correct 211 ms 53112 KB Output is correct
16 Correct 205 ms 50408 KB Output is correct
17 Correct 212 ms 51192 KB Output is correct
18 Correct 264 ms 55448 KB Output is correct
19 Correct 145 ms 49144 KB Output is correct
20 Correct 231 ms 53212 KB Output is correct
21 Correct 179 ms 49020 KB Output is correct
22 Correct 231 ms 51192 KB Output is correct
23 Correct 258 ms 52700 KB Output is correct
24 Correct 286 ms 53984 KB Output is correct
25 Correct 337 ms 56056 KB Output is correct