제출 #41626

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
41626		cheater2k	Gift (IZhO18_nicegift)	C++14	100 / 100	1227 ms	110188 KiB

nicegift

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

const int N = 1000005;

int n, k;
long long a[N];
long long sum;
long long mx;
priority_queue < pair<long long, int> > pq;

vector < vector <int> > vres;
vector <long long> vX;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i], sum += a[i]; mx = max(mx, a[i]);
    }
    if (sum % k != 0 || mx > sum / k) return printf("-1\n"), 0;

    for (int i = 1; i <= n; ++i) {
        pq.push(make_pair(a[i], i));
    }    

    long long average = sum / k;

    while(!pq.empty()) {
        int taken = 0;
        vector<int> cur;
        while(!pq.empty() && taken < k) {
            ++taken;
            int pos = pq.top().second; pq.pop();
            cur.push_back(pos);
        }
        //assert(taken == k);

        long long last = 0;
        if (!pq.empty()) last = pq.top().first;
        
        long long X = min(average - last, a[cur.back()]);

        vX.push_back(X);
        vres.push_back(cur);
        average -= X;

        for (int &pos : cur) {
            a[pos] -= X;
            if (a[pos] > 0) pq.push(make_pair(a[pos], pos));
        }
    }

    printf("%d\n", vres.size());
    for (int i = 0; i < vres.size(); ++i) {
        printf("%lld ", vX[i]);
        for (int &j : vres[i]) printf("%d ", j); printf("\n");
    }
}

컴파일 시 표준 에러 (stderr) 메시지

nicegift.cpp: In function 'int main()':
nicegift.cpp:54:31: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<std::vector<int> >::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d\n", vres.size());
                               ^
nicegift.cpp:55:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < vres.size(); ++i) {
                       ^

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 19 / 19
• Subtask 5: 51 / 51