Submission #1111375

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1111375	2024-11-12T07:51:46 Z	DuongKiet	Teams (CEOI11_tea)	C++17	80 / 100	229 ms	73948 KB

#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++){
        if (cur == -1){
            cur = a[i].c - 1;
            maketeam.pb(a[i].id);
            continue;
        }
        if (cur > 0){
            cur--;
            maketeam.pb(a[i].id);
        }else{
            cur = a[i].c - 1;
            team.pb(maketeam);
            maketeam.clear();
            maketeam.pb(a[i].id);
        }
    }
    if (cur > 0){

        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;
        }
        if (!maketeam.empty()) team.pb(maketeam);
    }
    else if (!maketeam.empty()) team.pb(maketeam);
    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 "task"
    if (fopen(task".inp", "r")){
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    init();
    return 0;
}

Compilation message

tea.cpp: In function 'int main()':
tea.cpp:90:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
tea.cpp:91:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	2 ms	336 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	2 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	17 ms	3664 KB	Output is correct
2	Correct	10 ms	3408 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	14 ms	3820 KB	Output is correct
2	Correct	10 ms	3652 KB	Output is correct
3	Correct	15 ms	3664 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	103 ms	15224 KB	Output is correct
2	Correct	92 ms	15872 KB	Output is correct
3	Correct	110 ms	16244 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	152 ms	19804 KB	Output is correct
2	Correct	229 ms	73948 KB	Output is correct
3	Correct	127 ms	19844 KB	Output is correct
4	Correct	164 ms	17140 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	163 ms	23268 KB	Output is correct
2	Correct	131 ms	27068 KB	Output is correct
3	Correct	141 ms	19272 KB	Output is correct
4	Correct	171 ms	19640 KB	Output is correct