제출 #1111347

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1111347		haianhnguyen08102007	Teams (CEOI11_tea)	C++17	100 / 100	424 ms	107608 KiB

tea

#include <bits/stdc++.h>
using namespace std;
#define LCBorz ios_base::sync_with_stdio(false); cin.tie(0);
#define all(x) x.begin(), x.end()
const int N=200005;
#define endl '\n'
 
int32_t main() {
    LCBorz;
    int n;cin>>n;
    vector<int> a[n+1];
    vector<int> v(n+1);
    for(int i=1;i<=n;i++){
        cin>>v[i];
        a[v[i]].push_back(i);
    }
    sort(all(v));
    vector<int> dp(n+1,-N);
    vector<int> mx(n+1);
    function<int(int)> check=[&](int lim){
        dp.assign(n+1,-N);
        dp[0]=0;
        for(int i=1;i<=n;i++){
            if(i>=v[i]&&i-mx[i-v[i]]<=lim)dp[i]=dp[mx[i-v[i]]]+1;
            mx[i]=(dp[mx[i-1]]>dp[i]?mx[i-1]:i);
        }
        return dp[n];
    };
    int mx1=check(n);
    int l=0,r=n;
    while(r-l>1){
        int m=(l+r)>>1;
        if(check(m)==mx1){
            r=m;
        }
        else{
            l=m;
        }
    }
    check(r);
    vector<vector<int>> ans;
    int p=n;
    while(p>0){
        ans.push_back(vector<int>());
        int t=mx[p-v[p]];
        while(p>t){
            ans.back().push_back(a[v[p]].back());
            a[v[p]].pop_back();
            p--;
        }
    }
    cout<<mx1<<endl;
    for(auto &i:ans){
        cout<<i.size()<<' ';
        for(int j:i){
            cout<<j<<' ';
        }
        cout<<endl;
    }
    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 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