제출 #997050

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
997050		MilosMilutinovic	Gift (IZhO18_nicegift)	C++14	100 / 100	1308 ms	121844 KiB

nicegift

#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  cin >> n >> k;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long s = accumulate(a.begin(), a.end(), 0LL);
  if (s % k != 0 || *max_element(a.begin(), a.end()) > s / k) {
    cout << -1 << '\n';
    return 0;
  }
  set<pair<long long, int>> st;
  for (int i = 0; i < n; i++) {
    st.emplace(a[i], i);
  }
  vector<vector<long long>> res;
  while (s > 0) {
    vector<int> ids;
    for (int foo = 0; foo < k; foo++) {
      auto it = prev(st.end());
      ids.push_back(it->second);
      st.erase(it);
    }
    long long v = a[ids.back()];
    if (!st.empty()) {
      v = min(v, s / k - prev(st.end())->first);
    }
    res.push_back({v});
    for (int i : ids) {
      res.back().push_back(i + 1);
    }
    for (int i : ids) {
      s -= v;
      a[i] -= v;
      if (a[i] > 0) {
        st.emplace(a[i], i);
      }
    }
  }
  cout << (int) res.size() << '\n';
  for (int i = 0; i < (int) res.size(); i++) {
    for (int j = 0; j < (int) res[i].size(); j++) {
      cout << res[i][j] << " ";
    }
    cout << '\n';
  }
  return 0;
}

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