제출 #796348

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
796348		Johann	Cookies (JOI23_cookies)	C++14	0 / 100	0 ms	212 KiB

cookies

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

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

const int INF = 1 << 30;
int N, M;
vpii A;
vi B;
vi dp;
vi used;

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

    cin >> N;
    A.resize(N);
    int maxi = 0, sum = 0;
    for (int i = 0; i < N; ++i)
    {
        cin >> A[i].first;
        maxi = max(maxi, A[i].first);
        sum += A[i].first;
        A[i].second = i;
    }

    cin >> M;
    B.resize(M);
    for (int i = 0; i < M; ++i)
        cin >> B[i];

    // sort(all(A));

    if (sum % B[0] != 0 || maxi * B[0] > sum)
    {
        cout << -1 << "\n";
    }
    else
    {
        vvi stuff(sum / B[0]);
        int idx = 0;
        for (int i = 0; i < N; ++i)
            for (int j = 0; j < A[i].first; ++j)
                stuff[(idx++) % sz(stuff)].push_back(i);
        cout << sz(stuff) << "\n";
        for (int i = 0; i < sz(stuff); ++i)
        {
            cout << sz(stuff[i]);
            for (int x : stuff[i])
                cout << " " << x;
            cout << "\n";
        }
    }

    return 0;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 45
• Subtask 5: 0 / 15
• Subtask 6: 0 / 15