oj.uz

답안 #92254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
92254 2019-01-02T09:59:00 Z davitmarg Gift (IZhO18_nicegift) C++17
19 / 100
 1053 ms 55436 KB 
/*
DEATH-MATCH
Davit-Marg
*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <iterator>
#include <ctype.h>
#include <stdlib.h>  
#include <cassert>
#include <fstream>  
#define mod 998244353ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
using namespace std;

LL gcd(LL a, LL b) {
	while (b) {
		a %= b;
		swap(a, b);
	}
	return a;
}

LL n,k,a[1000006],d,s;
bool hav=1;
priority_queue<pair<LL, int>> q;
vector<pair<LL, int>> ans;
pair<LL, int> mn = {mod*mod,mod};
int main()
{
	cin >> n >> k;
	for (int i = 0; i < n; i++)
	{
		scanf("%lld", a + i);
		s += a[i];
		q.push(MP(a[i],i));
		mn = min(mn,MP(a[i],i));
		if (i && a[i] != a[i - 1])
			hav = 0;
	}


	if (!hav)
	{
		int step = 0;
		vector<pair<LL, int>> st;
		bool br = 0;
		while (!q.empty() && !br)
		{
			for (int i = 0; i < k; i++)
			{
				if (q.empty())
				{
					cout << -1 << endl;
					return 0;
				}
				st.PB(q.top());
				q.pop();
			}
			LL d= st.back().first;
			if (!q.empty())
				d = min(st.back().first - q.top().first + 1, d);
			else
				br = 1;
			for (int i = k-1; i >=0 ; i--)
			{
				ans.PB(MP(d,st[i].second));
				a[st[i].second] -= d;
				if(st[i].first - d > 0)
					q.push(MP(st[i].first-d,st[i].second));
				st.pop_back();
			}
		}

	}

	if(1 && a[0])
	{
		d = k / gcd(n, k);
		if (a[0] % d != 0)
		{
			cout << -1 << endl;
			return 0;
		}
		for (LL i = 0; i < d*n; i++)
		{
			ans.PB(MP(a[0] / d, (i%n)));
		}
		cout << endl;
	}

	cout << ans.size() / k;
	for (int i = 0; i < ans.size(); i++)
	{
		if (i%k == 0)
			cout << endl << ans[i].first << " ";
		cout << ans[i].second + 1 << " ";
	}
	cout << endl;

	return 0;
}

/*

4 2
1 1 4 4 

4 3
6 6 6 6 

14 7
10 10 10 10 10 10 10 10 10 10 10 10 10 10

*/

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:57:7: warning: unused variable 'step' [-Wunused-variable]
   int step = 0;
       ^~~~
nicegift.cpp:105:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ans.size(); i++)
                  ~~^~~~~~~~~~~~
nicegift.cpp:46:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", a + i);
   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 12.0

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

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1053 ms 53968 KB n=1000000
2 Correct 557 ms 40636 KB n=666666
3 Correct 260 ms 22096 KB n=400000
4 Correct 773 ms 55436 KB n=285714
5 Correct 9 ms 1616 KB n=20000
6 Correct 595 ms 51092 KB n=181818
7 Correct 5 ms 1012 KB n=10000
8 Correct 52 ms 8800 KB n=6666
9 Correct 3 ms 504 KB n=4000
10 Correct 283 ms 40984 KB n=2857
11 Correct 2 ms 376 KB n=2000

Subtask #5
0 / 51.0

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