oj.uz

답안 #378830

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
378830 2021-03-17T05:42:35 Z casperwang Gift (IZhO18_nicegift) C++14
7 / 100
 2000 ms 244364 KB 
#include <bits/stdc++.h>
#define pb emplace_back
#define pii pair<int,int>
#define ff first
#define ss second
#define All(x) x.begin(), x.end()
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

struct Node {
	int X;
	vector <int> I;
	Node(int x) {
		X = x;
	}
};

const int MAXN = 1000000;
int N, K;
int v;
vector <Node> ops;
bool flag = true;
set <pii> now;
int sum;

signed main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> N >> K;
	for (int i = 0; i < N; i++) {
		cin >> v;
		sum += v;
		now.insert(pii(v, i+1));
	}
	while (now.size()) {
		if (now.size() < K) {
			flag = false;
			break;
		}
		auto it = prev(now.end());
		ops.pb(1);
		vector <pii> tmp;
		int x = 0;
		// debug(now.size());
		for (int i = 0; i < K; i++) {
			// debug(it->ff, it->ss);
			ops[ops.size()-1].I.pb(it->ss);
			tmp.pb(*it);
			if (i+1 < K) {
				it = prev(now.erase(it));
			} else {
				now.erase(it);
				if (!now.size()) {
					x = it->ff;
				} else {
					x = min(it->ff, (sum - (prev(now.end())->ff * K - sum)) / K);
				}
			}
		}
		ops[ops.size()-1].X = x;
		sum -= K * x;
		for (pii i : tmp) {
			if (i.ff-x)
				now.insert(pii(i.ff-x, i.ss));
		}
	}
	if (flag) {
		cout << ops.size() << '\n';
		for (Node now : ops) {
			cout << now.X;
			for (int i : now.I) cout << ' ' << i;
			cout << '\n';
		}
	} else {
		cout << -1 << '\n';
	}
}

Compilation message

nicegift.cpp: In function 'int main()':
nicegift.cpp:38:18: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |   if (now.size() < K) {
      |       ~~~~~~~~~~~^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 364 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 364 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Correct 1 ms 364 KB n=8
9 Incorrect 1 ms 364 KB Jury has the answer but participant has not
10 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 364 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Correct 1 ms 364 KB n=8
9 Incorrect 1 ms 364 KB Jury has the answer but participant has not
10 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

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

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB n=4
2 Correct 1 ms 364 KB n=3
3 Correct 1 ms 364 KB n=3
4 Correct 1 ms 364 KB n=4
5 Correct 1 ms 364 KB n=4
6 Correct 1 ms 364 KB n=2
7 Correct 1 ms 364 KB n=5
8 Correct 1 ms 364 KB n=8
9 Incorrect 1 ms 364 KB Jury has the answer but participant has not
10 Halted 0 ms 0 KB -