oj.uz

Submission #962421

# Submission time Handle Problem Language Result Execution time Memory
962421 2024-04-13T13:39:59 Z pragmatist Gift (IZhO18_nicegift) C++17
30 / 100
 2000 ms 379040 KB 
#include<bits/stdc++.h>

using namespace std;

const int N = (int)1e6+7;

int n, k;
long long a[N];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
	cin >> n >> k;
	long long tot = 0;
	for(int i = 1; i <= n; ++i) {
		cin >> a[i];
		tot += a[i];
	}    
	priority_queue<pair<long long, int> > s;
	for(int i = 1; i <= n; ++i) {
		s.push({a[i], i});
	}
	vector<vector<long long> > ans;
	vector<long long> v;
	while((int)s.size()>=k) {
		vector<int> cur;       
		for(int j = 0; j < k; ++j) {
			cur.push_back(s.top().second);
			s.pop();
		}
		int can;
		if(s.empty()) {
			can = a[cur.back()];
		} else {
			can = a[cur.back()]-s.top().first+1;
		}
		v = {can};
		for(auto id : cur) {
			assert(a[id]>=can);
			v.push_back(id);
		}
		ans.push_back(v);
		for(auto id : cur) {
			a[id] -= can;
			if(a[id]>0) {
				s.push({a[id], id});
			}
		}
	}
	if(!s.empty()) {
		cout << "-1\n";
		return 0;
	}
	cout << (int)ans.size() << "\n";
	for(auto x : ans) {
		for(auto y : x) {
			cout << y << ' ';
		}
		cout << "\n";
	}
    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 0 ms 600 KB n=4
6 Correct 0 ms 348 KB n=2

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 0 ms 600 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 0 ms 348 KB n=8
9 Correct 4 ms 1116 KB n=14
10 Correct 2 ms 604 KB n=11
11 Correct 19 ms 5680 KB n=50000
12 Correct 25 ms 6344 KB n=50000
13 Correct 10 ms 1812 KB n=10
14 Correct 21 ms 3084 KB n=685
15 Correct 23 ms 3432 KB n=623
16 Correct 13 ms 2064 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 0 ms 600 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 0 ms 348 KB n=8
9 Correct 4 ms 1116 KB n=14
10 Correct 2 ms 604 KB n=11
11 Correct 19 ms 5680 KB n=50000
12 Correct 25 ms 6344 KB n=50000
13 Correct 10 ms 1812 KB n=10
14 Correct 21 ms 3084 KB n=685
15 Correct 23 ms 3432 KB n=623
16 Correct 13 ms 2064 KB n=973
17 Correct 22 ms 3080 KB n=989
18 Correct 10 ms 1372 KB n=563
19 Correct 15 ms 1880 KB n=592
20 Correct 18 ms 1884 KB n=938
21 Correct 15 ms 1372 KB n=747
22 Correct 14 ms 1680 KB n=991

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2083 ms 379040 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 0 ms 600 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 0 ms 348 KB n=8
9 Correct 4 ms 1116 KB n=14
10 Correct 2 ms 604 KB n=11
11 Correct 19 ms 5680 KB n=50000
12 Correct 25 ms 6344 KB n=50000
13 Correct 10 ms 1812 KB n=10
14 Correct 21 ms 3084 KB n=685
15 Correct 23 ms 3432 KB n=623
16 Correct 13 ms 2064 KB n=973
17 Correct 22 ms 3080 KB n=989
18 Correct 10 ms 1372 KB n=563
19 Correct 15 ms 1880 KB n=592
20 Correct 18 ms 1884 KB n=938
21 Correct 15 ms 1372 KB n=747
22 Correct 14 ms 1680 KB n=991
23 Execution timed out 2083 ms 379040 KB Time limit exceeded
24 Halted 0 ms 0 KB -