Submission #2131875
Source Code Expand
/** * File : D.cpp * Author : Kazune Takahashi * Created : 2018-2-24 22:16:49 * Powered by Visual Studio Code */ #include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> #include <random> // random_device rd; mt19937 mt(rd()); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. typedef long long ll; // const int dx[4] = {1, 0, -1, 0}; // const int dy[4] = {0, 1, 0, -1}; // const int C = 1e6+10; // const ll M = 1000000007; int dp[400][400]; int lcs(string s, string t) { fill(&dp[0][0], &dp[0][0] + 400 * 400, 0); int N = s.size(); int M = t.size(); for (auto i = 0; i < N; i++) { for (auto j = 0; j < M; j++) { if (s[i] == t[j]) { dp[i + 1][j + 1] = dp[i][j] + 1; } else { dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]); } } } return dp[N][M]; } string S; int K; int main() { cin >> S >> K; string T = S; reverse(T.begin(), T.end()); if (K == 0) { cout << lcs(S, T) << endl; } else { cout << min(lcs(S, T) + 2 * K, (int)S.size()) << endl; } }
Submission Info
Submission Time | |
---|---|
Task | D - Reversed LCS |
User | kazunetakahashi |
Language | C++14 (Clang 3.8.0) |
Score | 0 |
Code Size | 1564 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 896 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 900 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 2 ms | 896 KB |
02.txt | AC | 2 ms | 896 KB |
03.txt | WA | 2 ms | 896 KB |
04.txt | AC | 2 ms | 896 KB |
05.txt | WA | 2 ms | 896 KB |
06.txt | AC | 2 ms | 896 KB |
07.txt | AC | 2 ms | 896 KB |
08.txt | AC | 2 ms | 896 KB |
09.txt | AC | 2 ms | 896 KB |
10.txt | AC | 2 ms | 896 KB |
11.txt | WA | 2 ms | 896 KB |
12.txt | WA | 2 ms | 896 KB |
13.txt | AC | 2 ms | 896 KB |
14.txt | AC | 2 ms | 896 KB |
15.txt | WA | 2 ms | 896 KB |
16.txt | AC | 2 ms | 896 KB |
17.txt | WA | 2 ms | 896 KB |
18.txt | WA | 2 ms | 896 KB |
19.txt | WA | 2 ms | 896 KB |
20.txt | AC | 2 ms | 896 KB |
21.txt | AC | 2 ms | 896 KB |
22.txt | WA | 2 ms | 896 KB |
23.txt | AC | 2 ms | 896 KB |
24.txt | AC | 2 ms | 896 KB |
25.txt | WA | 2 ms | 896 KB |
26.txt | AC | 2 ms | 896 KB |
27.txt | AC | 2 ms | 896 KB |
28.txt | AC | 2 ms | 896 KB |
29.txt | AC | 2 ms | 896 KB |
30.txt | AC | 2 ms | 896 KB |
31.txt | WA | 2 ms | 896 KB |
32.txt | WA | 2 ms | 896 KB |
33.txt | AC | 2 ms | 896 KB |
34.txt | AC | 2 ms | 896 KB |
35.txt | AC | 2 ms | 896 KB |
36.txt | WA | 2 ms | 896 KB |
37.txt | AC | 2 ms | 896 KB |
38.txt | AC | 2 ms | 896 KB |
39.txt | AC | 2 ms | 896 KB |
40.txt | AC | 2 ms | 896 KB |
41.txt | AC | 1 ms | 896 KB |
42.txt | AC | 1 ms | 896 KB |
43.txt | AC | 2 ms | 896 KB |
44.txt | AC | 2 ms | 896 KB |
45.txt | AC | 2 ms | 896 KB |
46.txt | AC | 1 ms | 896 KB |
47.txt | AC | 1 ms | 896 KB |
s1.txt | AC | 1 ms | 896 KB |
s2.txt | AC | 2 ms | 896 KB |