#include <bits/stdc++.h>
using namespace std;
/// toto -> 1
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define io \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(a) a.begin(),a.end()
#define rep(k,i,n) for(int k=i;k<n;k++)
#define repp(k,i,n) for(int k=n-1;k>=i;k--)
#define rech(k) for(char k='a';k<='z';k++)
#define SZ(a) (int)a.size()
#define MX(a) *max_element(all(a))
#define MN(a) *min_element(all(a))
#define SM(a) accumulate(all(a),0LL)
#define vi vector<int>
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define vvi vector<vector<int>>
/// toto -> 2
const int modd = 1e9 + 7 , mod = 998244353;
typedef long long ll;
void F1(bool res) {
if(res) {
cout<<"Yes\n" ;
}
else {
cout<<"No\n" ;
}
}
struct mint{
ll val;
mint(int64_t v = 0) {
v %= mod;
if (v < 0) v += mod;
val = v;
}
mint& operator+=(const mint& other) {
val += other.val;
if (val >= mod) val -= mod;
return *this;
}
mint& operator-=(const mint& other) {
val += mod - other.val;
if (val >= mod) val -= mod;
return *this;
}
mint& operator*=(const mint& other) {
val = (int64_t)val * other.val % mod;
return *this;
}
mint& operator/=(const mint& other) {
return *this *= other.inv();
}
friend mint operator+(mint a, const mint& b) { return a += b; }
friend mint operator-(mint a, const mint& b) { return a -= b; }
friend mint operator*(mint a, const mint& b) { return a *= b; }
friend mint operator/(mint a, const mint& b) { return a /= b; }
mint pow(int64_t exp) const {
mint a = *this, res = 1;
while (exp > 0) {
if (exp & 1)
res *= a;
a *= a;
exp >>= 1;
}
return res;
}
mint inv() const {
assert(val != 0);
return pow(mod - 2);
}
friend ostream& operator<<(ostream& os, const mint& m) {
return os << m.val;
}
};
ll bp(ll n,ll m){
if(m == 0){
return 1;
}
if(m == 1){
return n%mod;
}
if(m%2==0){
return bp(n*n%mod,m/2)%mod;
}
return n*bp(n,m-1)%mod;
}
/// toto -> 3
const int N = 2e5 + 545, M = 2e4 + 434, inf = 1e9 + 99;
const ll inff = 1e12;
#define int long long
void solve() {
int n,k;
cin >> n >> k;
priority_queue<pair<int , int>> q;
vector<vector<int>> res;
rep(i,0,n) {
int x;
cin >> x;
q.push({x , i});
}
while(q.top().first > 0) {
vector<int> tmp(k);
vector<int> ind;
for(int i=k - 1;i>=0;i--) {
tmp[i] = q.top().first;
ind.push_back(q.top().second);
q.pop();
}
int fer = 0;
if(q.size() > 0) {
fer = max(0LL , q.top().first - 1);
}
if(tmp[0] == 0) {
cout << -1 << endl;
return;
}
fer = tmp[0] - fer;
rep(i,0,k) {
tmp[i] -= fer;
q.push({tmp[i] , ind[i]});
}
vector<int> tmpp;
tmpp.push_back(fer);
rep(i,0,k) {
tmpp.push_back(ind[i] + 1);
}
res.push_back(tmpp);
}
cout << res.size() << endl;
for(auto i:res) {
for(auto j:i) {
cout << j << " ";
}
cout << endl;
}
cout << endl;
}
int32_t main() {
io;
ll t=1;
/// cin>>t;
rep(_,1,t+1) {
cerr << "Start of test case " << _ << "\n";
///cout<<"Case #"<<_<<": ";
solve();
cerr << endl;
cerr << endl;
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
n=4 |
| 2 |
Incorrect |
0 ms |
348 KB |
Taken too much stones from the heap |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
n=4 |
| 2 |
Incorrect |
0 ms |
348 KB |
Taken too much stones from the heap |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
n=4 |
| 2 |
Incorrect |
0 ms |
348 KB |
Taken too much stones from the heap |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2108 ms |
346640 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
n=4 |
| 2 |
Incorrect |
0 ms |
348 KB |
Taken too much stones from the heap |
| 3 |
Halted |
0 ms |
0 KB |
- |
