# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
378724 | iris2617 | Gift (IZhO18_nicegift) | C++14 | 2111 ms | 353424 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
#define matsuri pair<int,int>
#define iris 1000000007
using namespace std;
priority_queue<matsuri> pq;
int arr[1000010];
vector<vector<int> > ans;
vector<int> ouo;
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int n,k,i,a;
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>arr[i];
pq.push({arr[i],i});
}
while(pq.size()>=k)
{
ouo.clear();
for(i=0;i<k;i++)
{
ouo.emplace_back(pq.top().second);
pq.pop();
}
ans.emplace_back(ouo);
for(int aoi:ouo)
{
arr[aoi]--;
if(arr[aoi])
pq.push({arr[aoi],aoi});
}
}
if(pq.empty())
{
cout<<ans.size()<<'\n';
for(auto sana:ans)
{
cout<<"1";
for(int aoi:sana)
{
cout<<" "<<aoi;
}
cout<<'\n';
}
}
else
{
cout<<"-1\n";
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |