# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
100178 |
2019-03-09T18:27:40 Z |
pamaj |
Rima (COCI17_rima) |
C++14 |
|
94 ms |
41676 KB |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 10;
int dp[maxn], n;
vector<string> s;
bool rhyme(const string& a, const string& b)
{
int u = (int)a.size() - 1, v = (int)b.size() - 1;
int cont = 0;
while(a[u] == b[v] and u >= 0 and v >= 0)
{
cont++, u--, v--;
}
if(cont >= max((int)a.size(), (int)b.size()) - 1) return true;
return false;
}
int solve(int i, int j)
{
if(dp[i] != -1) return dp[i];
if(i == n) return 0;
int caso1;
if(i == j)
{
caso1 = solve(i + 1, i + 1);
}
else
caso1 = solve(i + 1, j);
int caso2;
if(rhyme(s[i],s[j]))
{
caso2 = solve(i + 1, i) + 1;
}
else
caso2 = 0;
return dp[i] = max(caso1, caso2);
}
int main()
{
ios::sync_with_stdio(false), cin.tie(nullptr);
cin >> n;
for(int i = 0; i < n; i++)
{
string a;
cin >> a;
s.push_back(a);
}
memset(dp, -1, sizeof(dp));
cout << solve(0, 0) << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
4 ms |
2304 KB |
Output isn't correct |
2 |
Incorrect |
3 ms |
2304 KB |
Output isn't correct |
3 |
Incorrect |
4 ms |
2304 KB |
Output isn't correct |
4 |
Incorrect |
94 ms |
41676 KB |
Output isn't correct |
5 |
Incorrect |
14 ms |
5376 KB |
Output isn't correct |
6 |
Incorrect |
6 ms |
3056 KB |
Output isn't correct |
7 |
Incorrect |
6 ms |
2936 KB |
Output isn't correct |
8 |
Incorrect |
5 ms |
2872 KB |
Output isn't correct |
9 |
Incorrect |
20 ms |
6864 KB |
Output isn't correct |
10 |
Incorrect |
5 ms |
2908 KB |
Output isn't correct |