Submission #70326674

---

Source Code Expand

// Problem: B - Most Frequent Substrings
// Contest: AtCoder - AtCoder Beginner Contest 428
// URL: https://atcoder.jp/contests/abc428/tasks/abc428_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms

#include<bits/stdc++.h>
using namespace std;
using ll=long long;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll tttt=1;
	//cin>>tttt;
	while(tttt--)
	{
		ll n,k,ma=0;
		cin>>n>>k;
		string s;
		cin>>s;
		map<string,ll>mp;
		string p=s.substr(0,k);
		for(int i=k;i<n;i++)
		{
			mp[p]++;
			ma=max(ma,mp[p]);
			p=p.substr(1,k-1)+s[i];
		}
		mp[p]++;
		ma=max(ma,mp[p]);
		vector<string>ans;
		for(auto [str,tim]:mp)
		{
			if(tim==ma)ans.push_back(str);
			//cout<<str<<' '<<tim<<'\n';
		}
		cout<<ma<<'\n';
		for(auto i:ans)
		{
			cout<<i<<' ';
		}
		cout<<'\n';
	}
	return 0;
}

Submission Info

Judge Result