Submission #204507

#	Time	Username	Problem	Language	Result	Execution time	Memory
204507		Saboon	Teams (CEOI11_tea)	C++14	0 / 100	343 ms	22112 KiB

tea

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 1e6 + 10;

pair<int,int> a[maxn];
bool mark[maxn];

int main(){
	ios_base::sync_with_stdio(false);
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++){
		int x;
		cin >> x;
		a[i] = {x, i};
	}
	sort(a + 1, a + n + 1);
	int t = 0;
	int now = n;
	while (now > 1){
		if (a[now].first > now){
			now --;
			continue;
		}
		mark[now] = 1;
		t ++;
		now -= a[now].first;
	}
	cout << t << endl;
	int last = 0;
	for (int i = 1; i <= n; i++){
		if (mark[i]){
			cout << i - last << ' ';
			for (int j = last + 1; j <= i; j++)
				cout << a[j].second << ' ';
			last = i;
			cout << '\n';
		}
	}
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10