提出 #70229082
ソースコード 拡げる
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define int long long
#define ALL(x) (x).begin(), (x).end()
#define MAX(x) *max_element(ALL(x))
#define MIN(x) *min_element(ALL(x))
typedef pair<int, int> PI;
typedef pair<int, pair<int, int>> PII;
static const int INF = 1010000000000000017LL;
static const double eps = 1e-12;
static const double pi = 3.14159265358979323846;
static const int dx[4] = {1, -1, 0, 0};
static const int dy[4] = {0, 0, 1, -1};
static const int ddx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
static const int ddy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
template <class T>
inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int N, K;
string S;
signed main() {
cin >> N >> K;
cin >> S;
map<string, int> mp;
for (int i = 0; i < N - K + 1; ++i) {
string sub = S.substr(i, K);
mp[sub]++;
}
int cnt = 0;
for (auto [key, value] : mp) {
chmax(cnt, value);
}
vector<string> ans;
for (auto [key, value] : mp) {
if (value == cnt) {
ans.push_back(key);
}
}
sort(ans.begin(), ans.end());
cout << cnt << endl;
for (auto s : ans) {
cout << s << " ";
}
cout << endl;
}
提出情報
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
200 / 200 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt |
| All |
00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| 00-sample-01.txt |
AC |
1 ms |
3732 KiB |
| 00-sample-02.txt |
AC |
1 ms |
3460 KiB |
| 00-sample-03.txt |
AC |
1 ms |
3592 KiB |
| 01-01.txt |
AC |
1 ms |
3600 KiB |
| 01-02.txt |
AC |
1 ms |
3596 KiB |
| 01-03.txt |
AC |
1 ms |
3744 KiB |
| 01-04.txt |
AC |
1 ms |
3664 KiB |
| 01-05.txt |
AC |
1 ms |
3580 KiB |
| 01-06.txt |
AC |
1 ms |
3548 KiB |
| 01-07.txt |
AC |
1 ms |
3588 KiB |
| 01-08.txt |
AC |
1 ms |
3664 KiB |
| 01-09.txt |
AC |
1 ms |
3596 KiB |
| 01-10.txt |
AC |
1 ms |
3736 KiB |
| 01-11.txt |
AC |
1 ms |
3536 KiB |
| 01-12.txt |
AC |
1 ms |
3596 KiB |
| 01-13.txt |
AC |
1 ms |
3600 KiB |
| 01-14.txt |
AC |
1 ms |
3588 KiB |
| 01-15.txt |
AC |
1 ms |
3600 KiB |
| 01-16.txt |
AC |
1 ms |
3736 KiB |
| 01-17.txt |
AC |
1 ms |
3472 KiB |
| 01-18.txt |
AC |
1 ms |
3508 KiB |
| 01-19.txt |
AC |
1 ms |
3580 KiB |