| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 532456 | definitelynotmee | Teams (CEOI11_tea) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
using namespace std;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
const int MAXN = 1e6+1;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> v(n);
for(int i = 0; i < n; i++)
cin >> v[i];
vector<int> o(n);
iota(all(o),0);
sort(all(o),[&](int a, int b){
return v[a] > v[b];
});
matrix<int> resp;
int start = 0;
while(start < n){
while(start < n && n-start>=v[o[start]]){
resp.push_back({});
for(int i = 0; i < v[o[start]]; i++){
resp.back().push_back(o[i+start]);
}
start+=v[o[start]];
};
while(start < n && n-start<v[o[start]]){
int ptr = lower_bound(all(resp),resp.back(),[&](vector<int>&a, vector<int>&b){
return a.size() > b.size();
})-resp.begin();
while(start < n && n-start<v[o[start]] && ptr < resp.size()){
resp[ptr].push_back(o[start]);
ptr++;
start++;
}
}
}
if(start < n){
resp.push_back({});
while(start < n)
resp.back().push_back(o[start]), start++;
}
cout << resp.size() << '\n';
int tot =0;
for(vector<int>& i : resp){
tot+=i.size();
}
for(vector<int>& i : resp){
cout << i.size() << ' ';
for(int j : i){
cout << j+1 << ' ';
}
cout << '\n';
}
return 0;
}