Submission #1111530

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1111530	2024-11-12T09:20:40 Z	DuongKiet	Teams (CEOI11_tea)	C++17	0 / 100	2500 ms	27096 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++)
        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;
        nteam.clear();
        int t = -1;
        if (!maketeam.empty() && SZ(maketeam) >= a[maketeam.back()].c)
        while (!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;
        }
        if (!nteam.empty()) 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

tea.cpp: In function 'void init()':
tea.cpp:40:9: warning: unused variable 'cur' [-Wunused-variable]
   40 |     int cur = -1;
      |         ^~~
tea.cpp: In function 'int main()':
tea.cpp:88:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
tea.cpp:89:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
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	Incorrect	1 ms	336 KB	Output isn't correct
5	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	504 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	592 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	4048 KB	Output is correct
2	Incorrect	617 ms	3784 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #7
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	4048 KB	Output is correct
2	Incorrect	1769 ms	3900 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	232 ms	27096 KB	Output is correct
2	Correct	159 ms	26984 KB	Output is correct
3	Execution timed out	2554 ms	14528 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-