oj.uz

Submission #338318

# Submission time Handle Problem Language Result Execution time Memory
338318 2020-12-23T01:57:11 Z lohacho Teams (CEOI11_tea) C++14
20 / 100
 689 ms 200552 KB 
#include <bits/stdc++.h>

using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int N;
	cin >> N;
	vector<pair<int, int>> a(N);
	for(int i = 0; i < N; ++i){
		cin >> a[i].first;
		a[i].second = i;
	}
	sort(a.begin(), a.end());
	reverse(a.begin(), a.end());
	vector<vector<int>> dp(N, vector<int>(3, -(int)1e9));
	vector<vector<int>> look(N);
	vector<int> nnow = {1, -a[0].first, -2};
	dp[a[0].first - 1] = nnow;
	for(int i = 0; i < N; ++i){
		for(auto&j:look[i]){
			vector<int> now = {dp[j][0] + 1, -max(-dp[j][1], i - j), j - 1};
			dp[i] = max(dp[i], now);
		}
		if(i){
			vector<int> now = {dp[i - 1][0], -(-dp[i - 1][1] + (i == dp[i - 1][0] * -dp[i - 1][1])), i - 1};
			dp[i] = max(dp[i], now);
		}
		if(i < N - 1 && i + a[i + 1].first < N){
			look[i + a[i + 1].first].push_back(i);
		}
	}
	vector<vector<int>> teams;
	vector<int> pmin;
	for(int i = N - 1; i >= 0;){
		if(dp[i][2] < i - 1){
			++dp[i][2];
			vector<int> np(i - dp[i][2]);
			for(int j = i; j > dp[i][2]; --j){
				np[i - j] = a[j].second;
			}
			teams.push_back(np);
			i = dp[i][2];
		}
		else{
			pmin.push_back(a[i].second);
			--i;
		}
	}
	priority_queue<pair<int, int>> pq;
	for(int i = 0; i < (int)teams.size(); ++i){
		pq.push({-(int)teams[i].size(), i});
	}
	for(auto&i:pmin){
		int top = pq.top().second; pq.pop();
		teams[top].push_back(i);
		pq.push({-(int)teams[top].size(), top});
	}
	cout << (int)teams.size() << '\n';
	for(auto&i:teams){
		cout << (int)i.size() << ' ';
		for(auto&j:i){
			cout << j + 1 << ' ';
		}
		cout << '\n';
	}
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 1004 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1004 KB Output is correct
2 Correct 3 ms 1004 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 43 ms 10732 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 12268 KB Output is correct
2 Incorrect 39 ms 10476 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 374 ms 102636 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 514 ms 132964 KB Output is correct
2 Correct 689 ms 200552 KB Output is correct
3 Incorrect 488 ms 132264 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 120036 KB Output is correct
2 Correct 354 ms 105272 KB Output is correct
3 Incorrect 498 ms 132844 KB Output isn't correct
4 Halted 0 ms 0 KB -