oj.uz

답안 #100177

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
100177 2019-03-09T18:25:34 Z pamaj Rima (COCI17_rima) C++14
14 / 140
 95 ms 41524 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxn = 5e5;

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 = 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";
}

Subtask #1
14.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 4 ms 2304 KB Output isn't correct
2 Correct 4 ms 2304 KB Output is correct
3 Incorrect 0 ms 2304 KB Output isn't correct
4 Incorrect 95 ms 41524 KB Output isn't correct
5 Incorrect 18 ms 5376 KB Output isn't correct
6 Incorrect 7 ms 3184 KB Output isn't correct
7 Incorrect 6 ms 2936 KB Output isn't correct
8 Incorrect 6 ms 2872 KB Output isn't correct
9 Incorrect 20 ms 6772 KB Output isn't correct
10 Incorrect 6 ms 2908 KB Output isn't correct