oj.uz

답안 #378775

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
378775 2021-03-17T04:05:11 Z 8e7 Gift (IZhO18_nicegift) C++14
7 / 100
 2000 ms 47840 KB 
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#define ll long long
#define maxn 1000005
#define pii pair<int, ll>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;

inline void rint(ll &x) {
	x = 0;
	char c;
	do {
		c = getchar();
	} while (c < '0' || c > '9');
	do {
		x = (x<<3) + (x<<1) + (c - '0');
		c = getchar();
	} while (c >= '0' && c <= '9');
}
inline void pint(int x) {
	while (x) {
		putchar('0' + x % 10);
		x /= 10;
	}
	putchar(' ');
}

ll a[maxn], pref[maxn];
vector<ll> val;
vector<int> ans[maxn];
int main() {
	io
	ll n, k;
	rint(n), rint(k);
	ll m = 0;
	for (int i = 0;i < n;i++) {
		rint(a[i]);
		m += a[i];
		pref[i] = m;
	}

	bool poss = m % k == 0;
	ll siz = m / k;

	for (int i = 0;i < n;i++) {
		if (a[i] > siz) {
			poss = false;
			break;
		}
		val.push_back(pref[i] % siz);
	}
	sort(val.begin(), val.end());
	val.push_back(siz);
	val.resize(int(unique(val.begin(), val.end()) - val.begin()));
	if (!poss) {
		cout << -1 << endl;
	} else {
		int num = 0, ind = 0;
		ll cur = 0;
		for (int i = 0;i < val.size();i++) {
			//cout << val[i] << " " << cur << endl;
			if (val[i] - cur > 0) { //[cur, val[i])
				ans[num].push_back(val[i] - cur);
				while (ind < n && pref[ind] <= cur) ind++;

				int id = ind;
				for (ll j = cur;j < m;j += siz) {
					while (id < n && pref[id] <= j) id++;
					if (id < n) ans[num].push_back(id+1);
					else {
						break;
					}
				}
				cur = val[i];
				num++;
			}
		}
		pint(num);
		putchar('\n');
		for (int i = 0;i < num;i++) {
			for (int j:ans[i]) pint(j);
			putchar('\n');
		}
	}
}
/*
4 2
2 3 3 2

6 4
4 1 3 5 5 2
 */

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:66:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |   for (int i = 0;i < val.size();i++) {
      |                  ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23916 KB n=4
2 Correct 18 ms 23828 KB n=3
3 Correct 17 ms 23800 KB n=3
4 Correct 18 ms 23788 KB n=4
5 Correct 17 ms 23788 KB n=4
6 Correct 18 ms 23788 KB n=2

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23916 KB n=4
2 Correct 18 ms 23828 KB n=3
3 Correct 17 ms 23800 KB n=3
4 Correct 18 ms 23788 KB n=4
5 Correct 17 ms 23788 KB n=4
6 Correct 18 ms 23788 KB n=2
7 Correct 18 ms 23788 KB n=5
8 Correct 19 ms 23788 KB n=8
9 Incorrect 18 ms 23788 KB Taken too much stones from the heap
10 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23916 KB n=4
2 Correct 18 ms 23828 KB n=3
3 Correct 17 ms 23800 KB n=3
4 Correct 18 ms 23788 KB n=4
5 Correct 17 ms 23788 KB n=4
6 Correct 18 ms 23788 KB n=2
7 Correct 18 ms 23788 KB n=5
8 Correct 19 ms 23788 KB n=8
9 Incorrect 18 ms 23788 KB Taken too much stones from the heap
10 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2077 ms 47840 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23916 KB n=4
2 Correct 18 ms 23828 KB n=3
3 Correct 17 ms 23800 KB n=3
4 Correct 18 ms 23788 KB n=4
5 Correct 17 ms 23788 KB n=4
6 Correct 18 ms 23788 KB n=2
7 Correct 18 ms 23788 KB n=5
8 Correct 19 ms 23788 KB n=8
9 Incorrect 18 ms 23788 KB Taken too much stones from the heap
10 Halted 0 ms 0 KB -