# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1111522 | DuongKiet | Teams (CEOI11_tea) | C++17 | 858 ms | 27664 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 N 1000005
#define inf 1e18
#define ll long long
#define ii pair <int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define SZ(x) (int) x.size()
const long long Mod = 1e9 + 7;
using namespace std;
int n;
struct cauthu{
int c, id;
}a[N];
struct slteam{
int c, id;
};
struct cmp{
bool operator()(slteam &a, slteam &b){
return a.c > b.c;
}
};
void init(){
cin >> n;
for (int i = 1; i <= n; i++){
cin >> a[i].c;
a[i].id = i;
}
sort(a + 1, a + 1 + n, [&](cauthu a, cauthu b){
return a.c > b.c;
});
vector <vector<int> > team;
vector <int> maketeam;
int cur = -1;
for (int i = 1; i <= n; i++)
maketeam.pb(a[i].id);
while (!maketeam.empty()) {
priority_queue<slteam, vector <slteam>, cmp> q;
for (int i = 0; i < SZ(team); i++)
q.push({SZ(team[i]), i});
sort(all(maketeam), [&](int u, int v){return a[u].c < a[v].c;});
while (a[maketeam.back()].c > SZ(maketeam) && !maketeam.empty()){
slteam k = q.top();
q.pop();
team[k.id].pb(maketeam.back());
q.push({SZ(team[k.id]), k.id});
maketeam.pop_back();
if (maketeam.empty()) break;
}
vector <int> nteam;
int t = -1;
if (!maketeam.empty())
while (SZ(maketeam) >= a[maketeam.back()].c && !maketeam.empty()){
// cout << "YES";
// exit(0);
if (t == -1) t = a[maketeam.back()].c;
nteam.pb(maketeam.back());
maketeam.pop_back();
t--;
if (t == 0 || maketeam.empty()) break;
}
team.pb(nteam);
}
cout << team.size() << '\n';
for (vector <int> cur: team){
cout << cur.size() << ' ';
for (int x: cur)
cout << x << " ";
cout << '\n';
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
#define task "DIVTEAM"
if (fopen(task".inp", "r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
init();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |