제출 #685410

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
685410		Johann	Teams (CEOI11_tea)	C++14	30 / 100	299 ms	89844 KiB

tea

#include "bits/stdc++.h"
using namespace std;

typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vpii A(n);
    for (int i = 0; i < n; ++i)
        cin >> A[i].first, A[i].second = i;

    sort(all(A), greater<pii>());
    vvi teams;

    int cnt = 0;
    while (cnt < n && A[cnt].first <= n - cnt)
    {
        teams.push_back(vi());
        for (int d = 0; d < A[cnt].first; ++d)
            teams.back().push_back(A[cnt + d].second);
        cnt += A[cnt].first;
    }
    priority_queue<pii, vpii, greater<pii>> q;
    for (int i = 0; i < sz(teams); ++i)
        q.push({sz(teams[i]), i});

    while (cnt < n)
    {
        int size, team;
        tie(size, team) = q.top();
        q.pop();
        teams[team].push_back(A[cnt].second);
        ++size, ++cnt;
        q.push({size, team});
    }

    cout << sz(teams) << "\n";
    for (vi team : teams)
    {
        cout << sz(team);
        for (int p : team)
            cout << " " << p + 1;
        cout << "\n";
    }

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 10 / 10
• Subtask 6: 0 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10