Beecrowd-solutions/Data Structures and Libraries/Cards Distribution.cpp

/* 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;
}

struct player {
    int total;
    list<int> cards;
};

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;
    ll total = 0;

    while (n--) {
        string a;
        cin >> a;
        cards.push_back(act[a]);
        total += cards.back();
    }

    V<player> players(p);
    int lim = cards.size() / p;
    int count = 0;
    size_t now = 0;
    for (size_t i = 0; i < lim * p;) {
        for (size_t j = 0; j < lim; j++, i++) {
            players[now].cards.push_back(cards[i]);
            players[now].total += cards[i];
            count++;
        }
        now++;
    }

    while (count < cards.size()) {
        players[now - 1].cards.push_back(cards[count]);
        players[now - 1].total += cards[count];
        count++;
    }

    size_t i = 1;
    while (i < p) {
        int act = max(players[i].total, players[i - 1].total);
        if (max(players[i - 1].total + players[i].cards.back(), players[i].total - players[i].cards.back()) <= act ||
            max(players[i].total + players[i - 1].cards.front(), players[i - 1].total - players[i - 1].cards.front()) < act) {

            if (players[i].total + players[i - 1].cards.back() < players[i - 1].total + players[i].cards.front()) {
                players[i].total += players[i - 1].cards.back();
                players[i - 1].total -= players[i - 1].cards.back();
                players[i].cards.push_front(players[i - 1].cards.back());
                players[i].cards.pop_back();
            } else {
                players[i - 1].total += players[i].cards.front();
                players[i].total -= players[i].cards.front();
                players[i - 1].cards.push_front(players[i].cards.front());
                players[i - 1].cards.pop_front();
            }
            continue;
        }

        i++;
    }

    int cmax = 0;
    for (auto &i : players) {
        rmax(cmax, i.total);
    }

    int amax = 1;
    int no = 1;
    int val = cards[0];
    for (size_t i = 1; i < cards.size(); i++) {
        if (val + cards[i] > cmax) {
            val = cards[i];
            no = 1;
        } else {
            val += cards[i];
            no++;
        }
        rmax(amax, no);
    }

    cout << amax << ' ' << cmax << '\n';
}