oj.uz

Submission #902804

# Submission time Handle Problem Language Result Execution time Memory
902804 2024-01-11T03:06:24 Z Darren0724 Teams (CEOI11_tea) C++17
0 / 100
 346 ms 59236 KB 
#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;
 
 
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);
    cout<<mx1<<endl;
    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
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Expected EOF
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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