Submission #1107799

#	Time	Username	Problem	Language	Result	Execution time	Memory
1107799		KasymK	Gift (IZhO18_nicegift)	C++17	30 / 100	90 ms	7940 KiB

nicegift

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e6+6;
int v[N];
vector<vector<int>> answer;

int main(){
	int n, k;
	scanf("%d%d", &n, &k);
	set<pii> s;
	for(int i = 1; i <= n; ++i){
		int x;
		scanf("%d", &x);
		if(x>0)
			s.insert({x, i});
		v[i] = x;
	}
	while(!s.empty()){
		if((int)s.size()<k){
			puts("-1");
			bool dxdd = 0;
			exit(dxdd);
		}
		answer.pb({});
		for(int i = 1; i <= k; ++i){
			auto it = prev(s.end());
			answer[(int)answer.size()-1].pb(it->ss);
			v[it->ss]--;
			s.erase(it);
		}
		for(int &i : answer[(int)answer.size()-1])
			if(v[i]>0)
				s.insert({v[i], i});
	}
	printf("%d\n", (int)answer.size());
	for(auto it : answer){
		printf("1 ");
		for(int i : it)
			printf("%d ", i);
		puts("");
	}
	return 0;
}

Compilation message (stderr)

nicegift.cpp: In function 'int main()':
nicegift.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  scanf("%d%d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~
nicegift.cpp:25:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |   scanf("%d", &x);
      |   ~~~~~^~~~~~~~~~

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