Submission #749698

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
749698	2023-05-28T11:42:56 Z	finn__	Teams (CEOI11_tea)	C++17	80 / 100	2500 ms	37744 KB

#pragma GCC optimize("O3")
#pragma GCC target("avx2")

#include <bits/stdc++.h>
using namespace std;

constexpr size_t N = 1000001, L = 1 << 20;

size_t n;
pair<int, int> a[N];
int tree[2 * L][2], pre[N];

void update(size_t i, int x, int y)
{
    i += L;
    tree[i][0] = x;
    tree[i][1] = y;
    while (i >>= 1)
    {
        tree[i][0] = max(tree[i << 1][0], tree[(i << 1) | 1][0]);
        tree[i][1] = tree[i << 1][0] > tree[(i << 1) | 1][0] ? tree[i << 1][1] : tree[(i << 1) | 1][1];
    }
}

pair<int, int> range_max(size_t i, size_t j)
{
    i += L, j += L;
    int x = 0, y = 0;
    while (i <= j)
    {
        if (i & 1)
        {
            y = tree[i][0] > x ? tree[i][1] : y;
            x = max(x, tree[i++][0]);
        }
        if (!(j & 1))
        {
            y = tree[j][0] > x ? tree[j][1] : y;
            x = max(x, tree[j--][0]);
        }
        i >>= 1;
        j >>= 1;
    }
    return {x, y};
}

int max_number_of_teams(size_t max_team_size)
{
    memset(tree, 0, sizeof tree);
    for (size_t i = 1; i <= n; ++i)
        if (i >= a[i].first)
        {
            size_t u = i - min(max_team_size, i), v = i - a[i].first;
            auto const [x, y] = range_max(u, v);
            if (u && !x)
            {
                if (i == n)
                    return 0;
                continue;
            }
            pre[i] = y;
            if (i == n)
                return x + 1;
            update(i, x + 1, i);
        }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (size_t i = 1; i <= n; ++i)
        cin >> a[i].first, a[i].second = i;
    sort(a + 1, a + n + 1);

    int t = max_number_of_teams(n);
    cout << t << '\n';
    size_t u = a[n].first, v = n;
    while (u < v)
    {
        size_t mid = (u + v) / 2;
        if (max_number_of_teams(mid) == t)
            v = mid;
        else
            u = mid + 1;
    }

    assert(max_number_of_teams(u) == t);
    int i = n;
    while (i)
    {
        vector<int> team;
        for (int j = pre[i] + 1; j <= i; ++j)
            team.push_back(a[j].second);
        i = pre[i];
        cout << team.size() << ' ';
        for (int const &x : team)
            cout << x << ' ';
        cout << '\n';
    }
}

Compilation message

tea.cpp: In function 'int max_number_of_teams(size_t)':
tea.cpp:51:15: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |         if (i >= a[i].first)
      |             ~~^~~~~~~~~~~~~
tea.cpp:66:1: warning: control reaches end of non-void function [-Wreturn-type]
   66 | }
      | ^

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	16724 KB	Output is correct
2	Correct	17 ms	16724 KB	Output is correct
3	Correct	19 ms	16716 KB	Output is correct
4	Correct	19 ms	16752 KB	Output is correct
5	Correct	17 ms	16752 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	20 ms	16756 KB	Output is correct
2	Correct	22 ms	16748 KB	Output is correct
3	Correct	21 ms	16752 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	21 ms	16724 KB	Output is correct
2	Correct	24 ms	16748 KB	Output is correct
3	Correct	23 ms	16724 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	41 ms	16800 KB	Output is correct
2	Correct	48 ms	16792 KB	Output is correct
3	Correct	42 ms	16796 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	38 ms	16800 KB	Output is correct
2	Correct	37 ms	16852 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	169 ms	18280 KB	Output is correct
2	Correct	234 ms	18080 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	279 ms	18404 KB	Output is correct
2	Correct	224 ms	18000 KB	Output is correct
3	Correct	301 ms	18404 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2476 ms	30640 KB	Output is correct
2	Correct	2174 ms	30656 KB	Output is correct
3	Correct	2383 ms	30976 KB	Output is correct

Subtask #9
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	2551 ms	28220 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #10
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1388 ms	37744 KB	Output is correct
2	Correct	192 ms	35572 KB	Output is correct
3	Execution timed out	2573 ms	28360 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-