oj.uz

Submission #378865

# Submission time Handle Problem Language Result Execution time Memory
378865 2021-03-17T06:45:14 Z Seanliu Gift (IZhO18_nicegift) C++14
0 / 100
 324 ms 524292 KB 
#include <iostream>
#include <map>
#include <deque>
#include <vector>
#define int long long int
using namespace std;

const int maxN = 1e6 + 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.0

# Verdict Execution time Memory Grader output
1 Runtime error 324 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 324 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 324 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Runtime error 315 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Runtime error 324 ms 524292 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -