Submission #787492

#TimeUsernameProblemLanguageResultExecution timeMemory
787492willychanGift (IZhO18_nicegift)C++14
0 / 100
136 ms27632 KiB
#include<bits/stdc++.h> using namespace std; typedef long long ll; //#include<bits/extc++.h> //__gnu_pbds int main(){ ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0); int n,k;cin>>n>>k; set<int> s; int g = 0; ll asum=0; for(int i=1;i<n;i++){ g = (g+k)%n; s.insert(g); } vector<int> arr(n); int sum = 0; for(int i=0;i<n;i++){ cin>>arr[i]; sum = (sum+arr[i])%n; asum+=arr[i]; } if(s.count(sum)==0){ cout<<-1<<"\n"; return 0; } priority_queue<pair<int,int> > pq; for(int i=0;i<n;i++){ pq.push({arr[i],i}); } cout<<asum/k<<"\n"; for(int t=0;t<asum/k;t++){ cout<<1; for(int i=0;i<k;i++){ int p = pq.top().second; pq.pop(); cout<<" "<<p+1; pq.push({--arr[p],p}); } cout<<"\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...