oj.uz

답안 #90466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
90466 2018-12-21T17:50:40 Z inom Gift (IZhO18_nicegift) C++14
30 / 100
 53 ms 14268 KB 
#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>

#define fi first
#define se second
#define new new228
#define pb push_back
#define rank rank228
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
 
using namespace std;
using namespace __gnu_pbds;
 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
#pragma warning(disable : 4996)
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; // st.oreder_of_key();

const int N = 100100;
const int MAXN = 4 * N;
const int INF = 1e9 + 7;
const int MOD = 998244353;
 
int TN = 1;

int n, k;
int a[N], cnt;
vector<int> ans[N];
set<pair<int, int>> st;

void solve() {
	scanf("%d %d", &n, &k);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		st.insert({a[i], i});
	}
	while (!st.empty()) {
		if (sz(st) < k) {
			printf("-1\n"); return;
		}
		cnt++;
		int cur = k;
		vector<pair<int, int>> tmp;
		while (cur--) {
			auto now = *st.rbegin();
			st.erase(--st.end());
			ans[cnt].pb(now.se);
			now.fi--;
			tmp.pb(now);
		}
		for (auto i: tmp) {
			if (i.fi) {
				st.insert(i);
			}
		}
	}
	printf("%d\n", cnt);
	for (int i = 1; i <= cnt; i++) {
		printf("%d ", 1);
		for (auto j: ans[i]) {
			printf("%d ", j);
		}
		puts("");
	}
	return;
}

signed main() {
    // in; out;  // cin >> TN;
    while (TN--) { solve(); }
    return 0;
}

Compilation message

nicegift.cpp:22:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable : 4996)
 
nicegift.cpp: In function 'void solve()':
nicegift.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~~
nicegift.cpp:41:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2680 KB n=4
2 Correct 3 ms 2740 KB n=3
3 Correct 3 ms 2740 KB n=3
4 Correct 3 ms 2776 KB n=4
5 Correct 3 ms 2776 KB n=4
6 Correct 3 ms 2780 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2680 KB n=4
2 Correct 3 ms 2740 KB n=3
3 Correct 3 ms 2740 KB n=3
4 Correct 3 ms 2776 KB n=4
5 Correct 3 ms 2776 KB n=4
6 Correct 3 ms 2780 KB n=2
7 Correct 3 ms 2784 KB n=5
8 Correct 6 ms 3172 KB n=8
9 Correct 11 ms 3348 KB n=14
10 Correct 9 ms 3352 KB n=11
11 Correct 47 ms 7108 KB n=50000
12 Correct 47 ms 7340 KB n=50000
13 Correct 31 ms 7340 KB n=10
14 Correct 31 ms 7340 KB n=685
15 Correct 33 ms 7340 KB n=623
16 Correct 21 ms 7340 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2680 KB n=4
2 Correct 3 ms 2740 KB n=3
3 Correct 3 ms 2740 KB n=3
4 Correct 3 ms 2776 KB n=4
5 Correct 3 ms 2776 KB n=4
6 Correct 3 ms 2780 KB n=2
7 Correct 3 ms 2784 KB n=5
8 Correct 6 ms 3172 KB n=8
9 Correct 11 ms 3348 KB n=14
10 Correct 9 ms 3352 KB n=11
11 Correct 47 ms 7108 KB n=50000
12 Correct 47 ms 7340 KB n=50000
13 Correct 31 ms 7340 KB n=10
14 Correct 31 ms 7340 KB n=685
15 Correct 33 ms 7340 KB n=623
16 Correct 21 ms 7340 KB n=973
17 Correct 34 ms 7340 KB n=989
18 Correct 17 ms 7340 KB n=563
19 Correct 27 ms 7340 KB n=592
20 Correct 27 ms 7340 KB n=938
21 Correct 21 ms 7340 KB n=747
22 Correct 25 ms 7340 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 53 ms 14268 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2680 KB n=4
2 Correct 3 ms 2740 KB n=3
3 Correct 3 ms 2740 KB n=3
4 Correct 3 ms 2776 KB n=4
5 Correct 3 ms 2776 KB n=4
6 Correct 3 ms 2780 KB n=2
7 Correct 3 ms 2784 KB n=5
8 Correct 6 ms 3172 KB n=8
9 Correct 11 ms 3348 KB n=14
10 Correct 9 ms 3352 KB n=11
11 Correct 47 ms 7108 KB n=50000
12 Correct 47 ms 7340 KB n=50000
13 Correct 31 ms 7340 KB n=10
14 Correct 31 ms 7340 KB n=685
15 Correct 33 ms 7340 KB n=623
16 Correct 21 ms 7340 KB n=973
17 Correct 34 ms 7340 KB n=989
18 Correct 17 ms 7340 KB n=563
19 Correct 27 ms 7340 KB n=592
20 Correct 27 ms 7340 KB n=938
21 Correct 21 ms 7340 KB n=747
22 Correct 25 ms 7340 KB n=991
23 Runtime error 53 ms 14268 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -