#include <bits/stdc++.h>
using namespace std;
#define lo long
const long long lmax=1999999999;
const long long lmx=1999999999999999999;
long long n,k,p;
long long a[100003],sum;
set<pair<long long,long long> >s;
vector<vector<long long> > ans;
int main(){std::ios::sync_with_stdio(false);
cin>>n>>k;
for(long long i=1;i<=n;i++)
{
cin>>a[i];
sum=sum+a[i];
}
bool ok=1;
for(long long i=2;i<=n;i++)
{
ok=ok&(a[i]==a[i-1]);
}
if(!(sum<=1000000||ok)){
cout<<-1<<endl;return 0;}
if(sum%k!=0){
cout<<-1<<endl;return 0;}
for(long long i=1;i<=n;i++)
{
s.insert(make_pair(a[i],i));
}
p=1;
if(ok){
p=sum/(n*(k/__gcd(n,k)));
}
while(s.size())
{
long long t=0;
vector<long long>v;
while(s.size()&&t<k)
{
set<pair<long long,long long> >::iterator it=s.end();
it--;
long long u=(*(it)).second;
s.erase(it);
v.push_back(u);
a[u]-=p;
t++;
}
if(t!=k){cout<<-1<<endl;return 0;
}
for(long long i=0;i<v.size();i++)
{
if(a[v[i]]>0)
{
s.insert(make_pair(a[v[i]],v[i]));
}
}
ans.push_back(v);
}
cout<<ans.size()<<endl;
for(long long i=0;i<ans.size();i++)
{
cout<<p<<" ";
for(long long j=0;j<ans[i].size();j++)
{
cout<<ans[i][j]<<" ";
}
cout<<endl;
}
}
/*
* *
* * * *
* * * *
* * * *
* * * *
* * *
* *
* *
* *
* *
* *
* *
* *
* *
*
*/
Compilation message
nicegift.cpp: In function 'int main()':
nicegift.cpp:51:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(long long i=0;i<v.size();i++)
~^~~~~~~~~
nicegift.cpp:61:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(long long i=0;i<ans.size();i++)
~^~~~~~~~~~~
nicegift.cpp:64:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(long long j=0;j<ans[i].size();j++)
~^~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
248 KB |
n=4 |
2 |
Correct |
2 ms |
484 KB |
n=3 |
3 |
Correct |
3 ms |
504 KB |
n=3 |
4 |
Correct |
2 ms |
504 KB |
n=4 |
5 |
Correct |
2 ms |
504 KB |
n=4 |
6 |
Correct |
2 ms |
564 KB |
n=2 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
248 KB |
n=4 |
2 |
Correct |
2 ms |
484 KB |
n=3 |
3 |
Correct |
3 ms |
504 KB |
n=3 |
4 |
Correct |
2 ms |
504 KB |
n=4 |
5 |
Correct |
2 ms |
504 KB |
n=4 |
6 |
Correct |
2 ms |
564 KB |
n=2 |
7 |
Correct |
2 ms |
564 KB |
n=5 |
8 |
Correct |
7 ms |
1136 KB |
n=8 |
9 |
Correct |
39 ms |
1604 KB |
n=14 |
10 |
Correct |
22 ms |
1604 KB |
n=11 |
11 |
Correct |
134 ms |
6708 KB |
n=50000 |
12 |
Correct |
131 ms |
6896 KB |
n=50000 |
13 |
Correct |
125 ms |
6896 KB |
n=10 |
14 |
Correct |
107 ms |
6896 KB |
n=685 |
15 |
Correct |
110 ms |
6896 KB |
n=623 |
16 |
Correct |
62 ms |
6896 KB |
n=973 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
248 KB |
n=4 |
2 |
Correct |
2 ms |
484 KB |
n=3 |
3 |
Correct |
3 ms |
504 KB |
n=3 |
4 |
Correct |
2 ms |
504 KB |
n=4 |
5 |
Correct |
2 ms |
504 KB |
n=4 |
6 |
Correct |
2 ms |
564 KB |
n=2 |
7 |
Correct |
2 ms |
564 KB |
n=5 |
8 |
Correct |
7 ms |
1136 KB |
n=8 |
9 |
Correct |
39 ms |
1604 KB |
n=14 |
10 |
Correct |
22 ms |
1604 KB |
n=11 |
11 |
Correct |
134 ms |
6708 KB |
n=50000 |
12 |
Correct |
131 ms |
6896 KB |
n=50000 |
13 |
Correct |
125 ms |
6896 KB |
n=10 |
14 |
Correct |
107 ms |
6896 KB |
n=685 |
15 |
Correct |
110 ms |
6896 KB |
n=623 |
16 |
Correct |
62 ms |
6896 KB |
n=973 |
17 |
Correct |
90 ms |
6896 KB |
n=989 |
18 |
Correct |
27 ms |
6896 KB |
n=563 |
19 |
Correct |
34 ms |
6896 KB |
n=592 |
20 |
Correct |
33 ms |
6896 KB |
n=938 |
21 |
Correct |
32 ms |
6896 KB |
n=747 |
22 |
Correct |
30 ms |
6896 KB |
n=991 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
22 ms |
6896 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
248 KB |
n=4 |
2 |
Correct |
2 ms |
484 KB |
n=3 |
3 |
Correct |
3 ms |
504 KB |
n=3 |
4 |
Correct |
2 ms |
504 KB |
n=4 |
5 |
Correct |
2 ms |
504 KB |
n=4 |
6 |
Correct |
2 ms |
564 KB |
n=2 |
7 |
Correct |
2 ms |
564 KB |
n=5 |
8 |
Correct |
7 ms |
1136 KB |
n=8 |
9 |
Correct |
39 ms |
1604 KB |
n=14 |
10 |
Correct |
22 ms |
1604 KB |
n=11 |
11 |
Correct |
134 ms |
6708 KB |
n=50000 |
12 |
Correct |
131 ms |
6896 KB |
n=50000 |
13 |
Correct |
125 ms |
6896 KB |
n=10 |
14 |
Correct |
107 ms |
6896 KB |
n=685 |
15 |
Correct |
110 ms |
6896 KB |
n=623 |
16 |
Correct |
62 ms |
6896 KB |
n=973 |
17 |
Correct |
90 ms |
6896 KB |
n=989 |
18 |
Correct |
27 ms |
6896 KB |
n=563 |
19 |
Correct |
34 ms |
6896 KB |
n=592 |
20 |
Correct |
33 ms |
6896 KB |
n=938 |
21 |
Correct |
32 ms |
6896 KB |
n=747 |
22 |
Correct |
30 ms |
6896 KB |
n=991 |
23 |
Runtime error |
22 ms |
6896 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
24 |
Halted |
0 ms |
0 KB |
- |