oj.uz

Submission #13621

# Submission time Handle Problem Language Result Execution time Memory
13621 2015-02-25T13:21:17 Z tncks0121 Round words (IZhO13_rowords) C++14
44 / 100
 418 ms 96292 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 = 3050;

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) ++i;
						else if (j == M) break;
						else if (par[i + 1][j + 1] == 1) ++i, ++j;
						else ++j;
						par[i][j] = 0;
					}
				}
			}

		// 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:97: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
44.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 73208 KB Output is correct
2 Correct 75 ms 73208 KB Output is correct
3 Correct 91 ms 73336 KB Output is correct
4 Correct 77 ms 73476 KB Output is correct
5 Incorrect 77 ms 73636 KB Output isn't correct
6 Correct 106 ms 81912 KB Output is correct
7 Correct 126 ms 89084 KB Output is correct
8 Incorrect 249 ms 89116 KB Output isn't correct
9 Incorrect 220 ms 89036 KB Output isn't correct
10 Incorrect 194 ms 88952 KB Output isn't correct
11 Incorrect 208 ms 90616 KB Output isn't correct
12 Correct 225 ms 92792 KB Output is correct
13 Incorrect 257 ms 92860 KB Output isn't correct
14 Incorrect 221 ms 91320 KB Output isn't correct
15 Incorrect 248 ms 93816 KB Output isn't correct
16 Incorrect 246 ms 90552 KB Output isn't correct
17 Incorrect 233 ms 91304 KB Output isn't correct
18 Correct 289 ms 95452 KB Output is correct
19 Incorrect 189 ms 89080 KB Output isn't correct
20 Incorrect 261 ms 93048 KB Output isn't correct
21 Correct 229 ms 88840 KB Output is correct
22 Correct 286 ms 91152 KB Output is correct
23 Incorrect 292 ms 92540 KB Output isn't correct
24 Correct 358 ms 93560 KB Output is correct
25 Incorrect 418 ms 96292 KB Output isn't correct