Submission #13602

#TimeUsernameProblemLanguageResultExecution timeMemory
13602tncks0121Round words (IZhO13_rowords)C++14
32 / 100
282 ms113348 KiB
#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], 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; int main() { scanf("%s%s", S + 1, T + 1); N = strlen(S + 1); M = strlen(T + 1); 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; } } for (int r = 1; r <= N; r++) { /* drop the r-th row */ { int i = r; int j; for (j = 1; j <= M && par[r][j] != 1; j++); if (j > M) continue; 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); } } printf("%d\n", ans); return 0; }

Compilation message (stderr)

rowords.cpp: In function 'int main()':
rowords.cpp:45: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);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...