Submission #211479

#	Time	Username	Problem	Language	Result	Execution time	Memory
211479		Andrei_Cotor	Teams (CEOI11_tea)	C++11	80 / 100	381 ms	32632 KiB

tea

#include<iostream>
#include<algorithm>

using namespace std;

int Prv[1000005],Best[1000005],Dp[1000005];
pair<int,int> A[1000005];
int n;

//nu era corecta solutia precedenta deoarece se putea sa fie mai bine sa extind echipa curenta pt a scadea lungimea precedentei
bool check(int lgmax)
{
    Dp[0]=0;
    Best[0]=0;
    for(int i=1; i<=n; i++)
    {
        Best[i]=Best[i-1];
        if(i<A[i].first)
        {
            Dp[i]=-1000000000;
            continue;
        }

        if(Best[i-A[i].first]>=i-lgmax)
        {
            Dp[i]=1+Dp[Best[i-A[i].first]];
            Prv[i]=Best[i-A[i].first];
            Best[i]=i;
        }
        else
            Dp[i]=-1000000000;
    }
    return (Dp[n]!=-1000000000);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

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

    sort(A+1,A+n+1); //pax din echipe o sa fie pe pozitii consecutive

    int lung=0;
    for(int i=19; i>=0; i--)
    {
        if(!check(lung+(1<<i)))
            lung+=(1<<i);
    }

    check(lung+1);
    cout<<Dp[n]<<"\n";

    int poz=n;
    while(poz!=0)
    {
        cout<<poz-Prv[poz]<<" ";
        for(int i=poz; i>Prv[poz]; i--)
            cout<<A[i].second<<" ";
        cout<<"\n";
        poz=Prv[poz];
    }
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10