제출 #378711

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
378711		8e7	Gift (IZhO18_nicegift)	C++14	30 / 100	662 ms	524292 KiB

nicegift

//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#define ll long long
#define maxn 1000005
#define pii pair<int, ll>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
ll a[maxn];
vector<int> val;
int main() {
	io
	ll n, k;
	cin >> n >> k;
	for (int i = 0;i < n;i++) {
		cin >> a[i];
		for (int j = 0;j < a[i];j++) {
			val.push_back(i);
		}
	}
	int m = val.size();
	bool poss = m % k == 0;
	for (int i = 0;i < m / k;i++) {
		for (int j = i;j < m;j += m / k) {
			if (val[i] == val[(i + m / k) % m]) {
				poss = false;
				break;
			}
		}
		if (!poss) {
			break;
		}
	}
	if (!poss) {
		cout << -1 << endl;
	} else {
		cout << m / k << "\n";
		for (int i = 0;i < m / k;i++) {
			cout << 1 << " ";
			for (int j = i;j < m;j += m / k) {
				cout << val[j]+1 << " ";
			}
			cout << "\n";
		}
	}
}

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