oj.uz

답안 #787496

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
787496 2023-07-19T08:32:31 Z willychan Gift (IZhO18_nicegift) C++14
0 / 100
 137 ms 27624 KB 
#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;
		vector<int> use;
		for(int i=0;i<k;i++){
			int p = pq.top().second;
			pq.pop();
			cout<<" "<<p+1;
			arr[p]--;
			use.push_back(p);
		}
		for(auto i : use){
			pq.push({arr[i],i});
		}
		cout<<"\n";
	}
	
	
	return 0;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=4
2 Correct 0 ms 212 KB n=3
3 Incorrect 0 ms 212 KB Not all heaps are empty in the end
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=4
2 Correct 0 ms 212 KB n=3
3 Incorrect 0 ms 212 KB Not all heaps are empty in the end
4 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=4
2 Correct 0 ms 212 KB n=3
3 Incorrect 0 ms 212 KB Not all heaps are empty in the end
4 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 137 ms 27624 KB Jury has the answer but participant has not
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB n=4
2 Correct 0 ms 212 KB n=3
3 Incorrect 0 ms 212 KB Not all heaps are empty in the end
4 Halted 0 ms 0 KB -