oj.uz

답안 #335177

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335177 2020-12-11T11:45:46 Z amunduzbaev Gift (IZhO18_nicegift) C++14
0 / 100
 219 ms 51308 KB 
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 1e6+5;

vector<pii>v[N];
vector<int>ans[N]; 
int a[N];

/*

4 2
2 3 3 2

*/

int main(){
	int n, k, mx = 0, sum = 0;
	scanf("%d %d", &n, &k);
	for(int i=0; i<n; i++){
		scanf("%d", &a[i]);
		mx = max(a[i], mx);
		sum += a[i];
	}
	if(mx * k > sum || sum % k){
		cout<<mx<<" "<<sum<<" "<<-1;
		return 0;
	}		
	
	ll c = 0, cnt = 0;
	ll size = sum/k;
	
	for(int i=0; i<n; i++){
		if(c + a[i] >= size){
			ll x = c + a[i] - size;
			v[cnt++].pb({a[i] - x, i + 1});
			c = x;
			v[cnt].pb({c, i + 1});
        }
		else{
			c += a[i];
			v[cnt].pb({a[i], i+1});
		}
	}
	bool f = 1;
	cnt = 0;
	while(f){
		f = 1;
		int mn = (int)inf;
		for(int i = 0; i < k; i++)  mn = min(mn, v[i].back().ff);
		ans[cnt].pb(mn);
		for(int i = 0; i < k; i++){
			pll x = v[i].back();
			v[i].pop_back();
			x.ff -= mn;
			ans[cnt].pb(x.ss);
			if(x.ff > 0) v[i].pb(x);
		}
		f &= (!v[0].empty());
		cnt++;
	}
	printf("%lld\n", cnt);
	for(int i = 0; i < cnt; i++){
		for(int j = 0; j < sz(ans[i]); j++){
			printf("%d ", ans[i][j]);
		}printf("\n");
	}
	return 0;
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   35 |  scanf("%d %d", &n, &k);
      |  ~~~~~^~~~~~~~~~~~~~~~~
nicegift.cpp:37:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |   scanf("%d", &a[i]);
      |   ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 47340 KB n=4
2 Correct 33 ms 47340 KB n=3
3 Incorrect 33 ms 47340 KB Integer -1 violates the range [1, 3]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 47340 KB n=4
2 Correct 33 ms 47340 KB n=3
3 Incorrect 33 ms 47340 KB Integer -1 violates the range [1, 3]
4 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 47340 KB n=4
2 Correct 33 ms 47340 KB n=3
3 Incorrect 33 ms 47340 KB Integer -1 violates the range [1, 3]
4 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 219 ms 51308 KB Not all heaps are empty in the end
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 47340 KB n=4
2 Correct 33 ms 47340 KB n=3
3 Incorrect 33 ms 47340 KB Integer -1 violates the range [1, 3]
4 Halted 0 ms 0 KB -