제출 #511073

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
511073		Mazaalai	Gift (IZhO18_nicegift)	C++17	0 / 100	2074 ms	8564 KiB

nicegift

#include <bits/stdc++.h>
#define pb push_back
#define ff first
#define ss second
#define LLA(x) x.rbegin(),x.rend()
#define print(x) for(auto el:x)cout<<el<<' ';cout<<"\n";
#define printPII(x) for(auto [a,b]:x)cout<<a<<","<<b<<' ';cout<<'\n';
using namespace std;
using PII = pair <int, int>;
int n, k;
signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);
	cin >> n >> k;
	vector <PII> nums;
	vector <vector <int> > ans;
	for (int i = 1; i <= n; i++) {
		int x; cin >> x;
		nums.pb({x, i});
	}
	nums.pb({0, 0});
	// int dbg = 0;
	while(1) {
		sort(LLA(nums));
		if (nums[0].ff == 0) break;
		int num = nums[0].ff, nx = nums[k-1].ff;
		int cur = max(1, num - nx);
		vector <int> curAns(1, cur); 
		for (int i = 0; i < k; i++) {
			nums[i].ff-=cur;
			curAns.pb(nums[i].ss);
		}
		ans.pb(curAns);
		// printPII(nums);
		// if (dbg++==10) break;
	}
	for (int i = 0; i < n; i++) {
		if (nums[i].ff < 0) {
			cout << "-1\n";
			return 0;
		}
	}
	cout << ans.size() << '\n';
	for (auto el : ans) {
		print(el);
	}
}

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