답안 #994076

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

rima

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int mod = 1LL<<36;
const int M = 3e6;

int pw[M];

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(NULL),cout.tie(NULL);
	vector<int> hashes={256,149,369,(int)1e6+1,7369,8369};
	srand(time(NULL));
	int h=hashes[rand()%6];
	
	pw[0]=1;
	for (int i=1;i<M;i++)
		pw[i]=pw[i-1]*h%mod;
	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<int,int> ans;
	while (!v.empty())
	{
		string s=v.back();
		v.pop_back();
		int hs=0,m=s.size();
		for (int i=1;i<m;i++)
			hs=hs*h+s[i],hs%=mod;
		int mx;
		if (ans.find(hs)!=ans.end())
			mx=ans[hs]+1;
		else
			mx=1;
		vector<int> wht;
		int p;
		for (int c='a';c<='z';c++)
		{
			p=hs;
			p+=pw[m-1]*c%mod;
			p%=mod;
			if (ans.find(p)!=ans.end())
				mx=max(mx,ans[p]+1),wht.push_back(p);
			else if(c==s[0])
				wht.push_back(p);
				
		}
		for (int i:wht)
			ans[i]=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	18 ms	23900 KB	Output is correct
2	Correct	16 ms	23900 KB	Output is correct
3	Correct	20 ms	23900 KB	Output is correct
4	Execution timed out	1099 ms	78748 KB	Time limit exceeded
5	Correct	36 ms	30040 KB	Output is correct
6	Incorrect	20 ms	26052 KB	Output isn't correct
7	Incorrect	24 ms	25684 KB	Output isn't correct
8	Incorrect	21 ms	25492 KB	Output isn't correct
9	Incorrect	47 ms	31880 KB	Output isn't correct
10	Incorrect	20 ms	25400 KB	Output isn't correct