Submission #378864

#	Time	Username	Problem	Language	Result	Execution time	Memory
378864		Seanliu	Gift (IZhO18_nicegift)	C++14	0 / 100	182 ms	122988 KiB

nicegift

#include <iostream>
#include <map>
#include <deque>
#include <vector>
#define int long long int
using namespace std;

const int maxN = 1e5 + 326;
map<int, deque<int>> mp;
vector<vector<int>> ans;

int N, K, arr[maxN];
int sm[maxN];

struct Obj{
	int num;
	deque<int> poss;
	Obj(){}
	Obj(int num, deque<int> dq): num(num), poss(dq){}
};

deque<Obj> has[maxN];

signed main(){
	cin >> N >> K;
	for(int i = 1; i <= N; i++){
		cin >> arr[i];
	}
	if(N % K){
		cout << -1 << endl;
		return 0;
	}
	cout << N / K << endl;
	for(int i = 1; i <= N; i += K){
		cout << arr[1] << " ";
		for(int j = i; j < i + K; j++) cout << j << " ";
		cout << endl;
	}
}

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