Submission #1111349

#	Time	Username	Problem	Language	Result	Execution time	Memory
1111349		b1hn_4n	Teams (CEOI11_tea)	C++17	0 / 100	202 ms	72580 KiB

tea

#include <bits/stdc++.h>
using namespace std;
#define ll			long long  
#define ld			long double
#define all(x)		x.begin(), x.end()
#define pii			pair<int, int>
#define fi			first
#define se			second
#define pb			emplace_back

template <class T>
inline bool maximize(T &a, const T &b) {return (a < b ? (a = b, 1) : 0);}
template <class T>
inline bool minimize(T &a, const T &b) {return (a > b ? (a = b, 1) : 0);}

const int N = 1e6 + 5;

int n, m;
pii arr[N];
vector<int> comp[N];

signed main(){	
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	cin >> n;
	for (int i = 1; i <= n; ++i){
		cin >> arr[i].fi;
		arr[i].se = i;
	}
	
	sort(arr+1, arr+n+1);
	reverse(arr+1, arr+n+1);
	int i = 1;
	while (i <= n){
		++m;
		for (int j = i; j <= i + arr[i].fi - 1; ++j)
			comp[m].push_back(arr[j].se);
		i += arr[i].fi;
	}
	
	cout << m << '\n';
	for (int i = 1; i <= m; ++i){
		cout << comp[i].size() << ' ';
		for (int id : comp[i]) cout << id << ' ';
		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