oj.uz

Submission #1107937

# Submission time Handle Problem Language Result Execution time Memory
1107937 2024-11-02T11:50:12 Z stdfloat Gift (IZhO18_nicegift) C++17
30 / 100
 288 ms 60184 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define sz(v)	(int)(v).size()
#define all(v)	(v).begin(), (v).end()

#define ff	first
#define ss	second
#define pii	pair<int, int>

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

	int n, k;
	cin >> n >> k;

	ll sm = 0;
	set<pii> s;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;

		sm += x;
		s.insert({x, i});
	}

	if (sm % k) return cout << -1, 0;
	
	if ((*s.begin()).ff == (*--s.end()).ff) {
		if (n % k) {
			assert(false);
			return cout << -1, 0;
		}

		cout << n / k << '\n';
		for (int i = 1; i <= n; i += k) {
			cout << (*s.begin()).ff << ' ';
			for (int j = i; j < i + k; j++)
				cout << j << ' ';
			cout << '\n';
		}

		return 0;
	}

	vector<vector<int>> ans;
	while (!s.empty()) {
		if (sz(s) < k) return cout << -1, 0;

		vector<pii> v;
		ans.push_back({});
		for (int i = 0; i < k; i++) {
			auto t = --s.end();
		
			ans.back().push_back((*t).ss);
			if (1 < (*t).ff) v.push_back({(*t).ff - 1, (*t).ss});
			
			s.erase(t);
		}

		for (auto i : v)
			s.insert(i);
	}

	cout << sz(ans) << '\n';
	for (auto i : ans) {
		cout << "1 ";
		for (auto j : i)
			cout << j + 1 << ' ';
		cout << '\n';
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB n=4
2 Correct 0 ms 336 KB n=3
3 Correct 1 ms 336 KB n=3
4 Correct 1 ms 336 KB n=4
5 Correct 1 ms 336 KB n=4
6 Correct 1 ms 336 KB n=2

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB n=4
2 Correct 0 ms 336 KB n=3
3 Correct 1 ms 336 KB n=3
4 Correct 1 ms 336 KB n=4
5 Correct 1 ms 336 KB n=4
6 Correct 1 ms 336 KB n=2
7 Correct 1 ms 336 KB n=5
8 Correct 2 ms 1060 KB n=8
9 Correct 5 ms 1164 KB n=14
10 Correct 3 ms 1104 KB n=11
11 Correct 23 ms 5460 KB n=50000
12 Correct 24 ms 5524 KB n=50000
13 Correct 17 ms 3332 KB n=10
14 Correct 17 ms 3076 KB n=685
15 Correct 18 ms 3256 KB n=623
16 Correct 12 ms 2056 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB n=4
2 Correct 0 ms 336 KB n=3
3 Correct 1 ms 336 KB n=3
4 Correct 1 ms 336 KB n=4
5 Correct 1 ms 336 KB n=4
6 Correct 1 ms 336 KB n=2
7 Correct 1 ms 336 KB n=5
8 Correct 2 ms 1060 KB n=8
9 Correct 5 ms 1164 KB n=14
10 Correct 3 ms 1104 KB n=11
11 Correct 23 ms 5460 KB n=50000
12 Correct 24 ms 5524 KB n=50000
13 Correct 17 ms 3332 KB n=10
14 Correct 17 ms 3076 KB n=685
15 Correct 18 ms 3256 KB n=623
16 Correct 12 ms 2056 KB n=973
17 Correct 19 ms 2668 KB n=989
18 Correct 8 ms 1104 KB n=563
19 Correct 14 ms 1616 KB n=592
20 Correct 14 ms 1360 KB n=938
21 Correct 11 ms 1340 KB n=747
22 Correct 12 ms 1528 KB n=991

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 288 ms 60184 KB Not all heaps are empty in the end
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 504 KB n=4
2 Correct 0 ms 336 KB n=3
3 Correct 1 ms 336 KB n=3
4 Correct 1 ms 336 KB n=4
5 Correct 1 ms 336 KB n=4
6 Correct 1 ms 336 KB n=2
7 Correct 1 ms 336 KB n=5
8 Correct 2 ms 1060 KB n=8
9 Correct 5 ms 1164 KB n=14
10 Correct 3 ms 1104 KB n=11
11 Correct 23 ms 5460 KB n=50000
12 Correct 24 ms 5524 KB n=50000
13 Correct 17 ms 3332 KB n=10
14 Correct 17 ms 3076 KB n=685
15 Correct 18 ms 3256 KB n=623
16 Correct 12 ms 2056 KB n=973
17 Correct 19 ms 2668 KB n=989
18 Correct 8 ms 1104 KB n=563
19 Correct 14 ms 1616 KB n=592
20 Correct 14 ms 1360 KB n=938
21 Correct 11 ms 1340 KB n=747
22 Correct 12 ms 1528 KB n=991
23 Incorrect 288 ms 60184 KB Not all heaps are empty in the end
24 Halted 0 ms 0 KB -