Submission #512064

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
512064	2022-01-16T06:30:01 Z	blue	Teams (CEOI11_tea)	C++17	70 / 100	2500 ms	86948 KB

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

using vi = vector<int>;
using pii = pair<int, int>;
using vvi = vector<vi>;
#define sz(x) int(x.size())

const int INF = 100'000'000;

const int Z = (1<<20);
vector<pii> segtree;

void set(int i, int v)
{
    i += Z;
    segtree[i].first = v;
    for(i >>= 1; i >= 1; i >>= 1) segtree[i] = max(segtree[i<<1], segtree[(i<<1) | 1]);
}



int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n;
    cin >> n;

    pii a[1+n];
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i].first;
        a[i].second = i;
    }
    sort(a+1, a+n+1);

    int t;

    vi dp(1+n);

    vi occ[1+n];

    vi bit(1+n+1, -INF);
    // bit[0 +1] = 0;
    for(int j = 0 +1; j <= n +1; j += j&-j) bit[j] = 0;

    occ[0].push_back(0);

    for(int i = 1; i <= n; i++)
    {
        t = -INF;
        if(a[i].first > i)
        {
            ;
        }
        else
        {
            for(int j = i - a[i].first +1; j >= 0 +1; j -= j&-j)
                t = max(t, bit[j]+1);

            // cerr << i << " -> " << i - a[i].first << '\n';

            for(int j = i +1; j <= n +1; j += j&-j)
                bit[j] = max(bit[j], t);
        }

        dp[i] = t;
        if(t != -INF) occ[dp[i]].push_back(i);

        // cerr << i << " : " << t << '\n';
    }

    int team_count = dp[n];

    // int Z = (1<<20);


    int lo = 1, hi = n;
    while(1)
    {
        int mxs = (lo+hi)/2;

        // cerr << "\n\n\n\n\n";
        // cerr << lo << ' ' << hi << " : " << mxs << '\n';

        segtree = vector<pii>(Z<<1, {-INF, -1});
        for(int i = 0; i <= n; i++) segtree[Z+i].second = i;

        int l = 0;
        int r = -1;

        vi new_dp(1+n, -INF);
        new_dp[0] = 0;

        vi prv(1+n, -1);

        // cerr << "n = " << n << '\n';

        for(int i = 1; i <= n; i++)
        {
            int nl = max(0, i-mxs);
            int nr = max(-1, i - a[i].first);
            // if(i-mxs > i - a[i]) con
            // cerr << "nl nr = " << nl << ' ' << nr << '\n';
            if(nl > nr) continue;

            while(r < nr)
            {
                r++;
                set(r, new_dp[r]);
            }

            while(l > nl)
            {
                l--;
                set(l, new_dp[l]);
            }

            while(r > nr)
            {
                set(r, -INF);
                r--;
            }

            while(l < nl)
            {
                set(l, -INF);
                l++;
            }

            new_dp[i] = max(-INF, segtree[1].first+1);
            prv[i] = segtree[1].second;

            // cerr << i << " : " << new_dp[i] << ' ' << prv[i] << '\n';
        }

        if(lo == hi)
        {
            vvi teams;
            int I = n;
            while(I != 0)
            {
                teams.push_back(vi(0));
                // cerr << I << ' ' << prv[I] << '\n';
                for(int q = I; q > prv[I]; q--)
                    teams.back().push_back(a[q].second);
                I = prv[I];
            }

            cout << team_count << '\n';
            for(int f = 0; f < team_count; f++)
            {
                cout << sz(teams[f]) << ' ';
                for(int w: teams[f]) cout << w << ' ';
                cout << '\n';
            }
            return 0;
        }
        else
        {
            if(new_dp[n] == team_count)
                hi = mxs;
            else
                lo = mxs+1;
        }
    }
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	8 ms	16716 KB	Output is correct
2	Correct	33 ms	33144 KB	Output is correct
3	Correct	33 ms	33144 KB	Output is correct
4	Correct	33 ms	33088 KB	Output is correct
5	Correct	31 ms	33220 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	41 ms	33100 KB	Output is correct
2	Correct	34 ms	33172 KB	Output is correct
3	Correct	37 ms	33212 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	40 ms	33172 KB	Output is correct
2	Correct	41 ms	33196 KB	Output is correct
3	Correct	41 ms	33140 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	70 ms	33420 KB	Output is correct
2	Correct	58 ms	33392 KB	Output is correct
3	Correct	74 ms	33444 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	56 ms	33356 KB	Output is correct
2	Correct	71 ms	33408 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	236 ms	37008 KB	Output is correct
2	Correct	360 ms	37392 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	365 ms	37592 KB	Output is correct
2	Correct	307 ms	37192 KB	Output is correct
3	Correct	321 ms	37972 KB	Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1657 ms	82008 KB	Output is correct
2	Correct	412 ms	86948 KB	Output is correct
3	Execution timed out	2590 ms	80868 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Submission #512064

Compilation message