답안 #994051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
994051	2024-06-07T05:11:13 Z	vjudge1	Rima (COCI17_rima)	C++17	56 / 140	1000 ms	55748 KB

rima

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int h = 727, mod = 1e9 + 7;
const int h1 = 369, mod1 = 998244353;

int power(int a,int b,int md)
{
	int ans=1;
	while (b)
	{
		if (b&1)
			ans=ans*a%md;
		a=a*a%md;
		b>>=1;
	}
	return ans;
}

signed main()
{
	int n;
	cin>>n;
	map<int,vector<string>> mp;
	for (int i=0;i<n;i++)
	{
		string s;
		cin>>s;
		mp[s.size()].push_back(s);
	}
	vector<string> v;
	for (auto i:mp)
		for (auto j:i.second)
			v.push_back(j);
	reverse(v.begin(),v.end());
	map<pair<int,int>,int> ans;
	while (!v.empty())
	{
		string s=v.back();
		v.pop_back();
		int hs=0,hs1=0,m=s.size();
		for (int i=1;i<m;i++)
		{
			hs=hs*h+s[i],hs1=hs1*h1+s[i];
			hs%=mod,hs1%=mod1;
		}
		int mx;
		if (ans.find({hs,hs1})!=ans.end())
			mx=ans[{hs,hs1}]+1;
		else
			mx=1;
		for (int c='a';c<='z';c++)
		{
			pair<int,int> p={hs,hs1};
			p.first+=power(h,m-1,mod)*c%mod;
			p.second+=power(h1,m-1,mod1)*c%mod1;
			p.first%=mod,p.second%=mod1;
			if (ans.find(p)!=ans.end())
				mx=max(mx,ans[p]+1);
		}
		for (int c='a';c<='z';c++)
		{
			pair<int,int> p={hs,hs1};
			p.first+=power(h,m-1,mod)*c%mod;
			p.second+=power(h1,m-1,mod1)*c%mod1;
			p.first%=mod,p.second%=mod1;
			if (ans.find(p)!=ans.end() or c==s[0])
				ans[p]=mx;
		}
	}
	int res=0;
	for (auto i:ans)
		res=max(res,i.second);
	cout<<res<<endl;
	
	return 0;
}

Subtask #1

56.0 / 140.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Execution timed out	1096 ms	55748 KB	Time limit exceeded
5	Correct	73 ms	6512 KB	Output is correct
6	Incorrect	21 ms	2516 KB	Output isn't correct
7	Incorrect	17 ms	2256 KB	Output isn't correct
8	Incorrect	14 ms	1836 KB	Output isn't correct
9	Incorrect	156 ms	8348 KB	Output isn't correct
10	Incorrect	14 ms	1996 KB	Output isn't correct