oj.uz

Submission #1107801

# Submission time Handle Problem Language Result Execution time Memory
1107801 2024-11-02T06:48:47 Z KasymK Gift (IZhO18_nicegift) C++17
30 / 100
 98 ms 7620 KB 
#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 = --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

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.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB n=4
2 Correct 1 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 336 KB n=4
2 Correct 1 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 908 KB n=8
9 Correct 5 ms 1164 KB n=14
10 Correct 3 ms 1104 KB n=11
11 Correct 25 ms 7340 KB n=50000
12 Correct 32 ms 7620 KB n=50000
13 Correct 17 ms 3532 KB n=10
14 Correct 18 ms 3076 KB n=685
15 Correct 20 ms 3292 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 336 KB n=4
2 Correct 1 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 908 KB n=8
9 Correct 5 ms 1164 KB n=14
10 Correct 3 ms 1104 KB n=11
11 Correct 25 ms 7340 KB n=50000
12 Correct 32 ms 7620 KB n=50000
13 Correct 17 ms 3532 KB n=10
14 Correct 18 ms 3076 KB n=685
15 Correct 20 ms 3292 KB n=623
16 Correct 12 ms 2056 KB n=973
17 Correct 20 ms 2568 KB n=989
18 Correct 9 ms 1104 KB n=563
19 Correct 18 ms 1616 KB n=592
20 Correct 19 ms 1376 KB n=938
21 Correct 11 ms 1528 KB n=747
22 Correct 12 ms 1284 KB n=991

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 98 ms 4180 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 336 KB n=4
2 Correct 1 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 908 KB n=8
9 Correct 5 ms 1164 KB n=14
10 Correct 3 ms 1104 KB n=11
11 Correct 25 ms 7340 KB n=50000
12 Correct 32 ms 7620 KB n=50000
13 Correct 17 ms 3532 KB n=10
14 Correct 18 ms 3076 KB n=685
15 Correct 20 ms 3292 KB n=623
16 Correct 12 ms 2056 KB n=973
17 Correct 20 ms 2568 KB n=989
18 Correct 9 ms 1104 KB n=563
19 Correct 18 ms 1616 KB n=592
20 Correct 19 ms 1376 KB n=938
21 Correct 11 ms 1528 KB n=747
22 Correct 12 ms 1284 KB n=991
23 Incorrect 98 ms 4180 KB Not all heaps are empty in the end
24 Halted 0 ms 0 KB -