136 lines
2.7 KiB
C++
136 lines
2.7 KiB
C++
/* Problem URL: https://judge.beecrowd.com/en/problems/view/2821 */
|
|
|
|
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
#define V vector
|
|
|
|
#define rmin(a, b) a = min(a, b)
|
|
#define rmax(a, b) a = max(a, b)
|
|
|
|
#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
|
|
#define nrep(i, s, lim) for (size_t i = s; i < (lim); i++)
|
|
|
|
#define repv(i, v) for (auto &i : (v))
|
|
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
|
|
#define sortv(v) sort(v.begin(), v.end())
|
|
#define all(v) (v).begin(), (v).end()
|
|
|
|
using vi = vector<int>;
|
|
using vvi = vector<vi>;
|
|
using vvvi = vector<vvi>;
|
|
using vvvvi = vector<vvvi>;
|
|
|
|
using ll = long long;
|
|
|
|
using vl = vector<ll>;
|
|
using vvl = vector<vl>;
|
|
using vvvl = vector<vvl>;
|
|
using vvvvl = vector<vvvl>;
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
|
|
os << vec[0];
|
|
for (size_t i = 1; i < vec.size(); i++) {
|
|
os << ' ' << vec[i];
|
|
}
|
|
os << '\n';
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<v> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
is >> i;
|
|
}
|
|
return is;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
|
|
for (auto &i : vec) {
|
|
os << i[0];
|
|
for (size_t j = 1; j < i.size(); j++) {
|
|
os << ' ' << i[j];
|
|
}
|
|
os << '\n';
|
|
}
|
|
return os;
|
|
}
|
|
|
|
template<class v>
|
|
auto operator>>(istream &is, vector<vector<v>> &vec)->istream& {
|
|
for (auto &i : vec) {
|
|
for (auto &j : i) {
|
|
is >> j;
|
|
}
|
|
}
|
|
return is;
|
|
}
|
|
|
|
int main()
|
|
{
|
|
ios::sync_with_stdio(false);
|
|
cin.tie(nullptr);
|
|
|
|
int n, p;
|
|
cin >> n >> p;
|
|
|
|
map<string, int> act;
|
|
act["A"] = 1;
|
|
act["J"] = 11;
|
|
act["Q"] = 12;
|
|
act["K"] = 13;
|
|
for (size_t i = 2; i <= 10; i++) {
|
|
act[to_string(i)] = i;
|
|
}
|
|
|
|
vi cards;
|
|
int total = 0;
|
|
|
|
while (n--) {
|
|
string a;
|
|
cin >> a;
|
|
cards.push_back(act[a]);
|
|
total += cards.back();
|
|
}
|
|
|
|
int amax = 0;
|
|
int cmax = 1;
|
|
bool keep = true;
|
|
for (cmax = 1; keep; cmax++) {
|
|
amax = 0;
|
|
size_t pi = 0;
|
|
size_t i = 0;
|
|
int now = 0;
|
|
int count = 0;
|
|
for (; i < cards.size() && pi < p; i++) {
|
|
if (now + cards[i] > cmax) {
|
|
if (now == 0) {
|
|
pi = p;
|
|
continue;
|
|
}
|
|
|
|
rmax(amax, count);
|
|
now = 0;
|
|
count = 0;
|
|
pi++;
|
|
i--;
|
|
continue;
|
|
}
|
|
|
|
now += cards[i];
|
|
count++;
|
|
}
|
|
|
|
if (i < cards.size()) {
|
|
continue;
|
|
}
|
|
rmax(amax, count);
|
|
keep = false;
|
|
}
|
|
|
|
cout << amax << ' ' << cmax - 1 << '\n';
|
|
}
|