Submission #760265

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
760265	2023-06-17T11:16:14 Z	GrindMachine	Teams (CEOI11_tea)	C++17	100 / 100	397 ms	38692 KB

// Om Namah Shivaya
 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
 
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
 
template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}
 
template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}
 
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
 
/*
 
refs:
edi
 
*/
 
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
 
void solve(int test_case)
{
    int n; cin >> n;
    vector<int> a(n+5);
    rep1(i,n) cin >> a[i];
 
    vector<pii> b;
    rep1(i,n) b.pb({a[i],i});
 
    sort(all(b));
    b.insert(b.begin(),{0,0});
    
    auto get = [&](int len, bool printt){
        vector<int> dp(n+5,-inf1);
        dp[0] = 0;
        vector<int> par(n+5);
        vector<int> prev_good(n+5);
        int mx = 0;

        rep1(i,n){
            auto [v,ind] = b[i];
            int lx = i-len;
            int rx = i-v;

            if(rx >= 0){
                int p = prev_good[rx];
                if(p >= lx){
                    dp[i] = dp[p] + 1;
                    par[i] = p;
                }
            }
    
            if(dp[i] >= mx){
                prev_good[i] = i;
                mx = dp[i];
            }     
            else{
                prev_good[i] = prev_good[i-1];
            }
        }

        if(printt){
            cout << dp[n] << endl;
            int ptr = n;
         
            while(ptr){
                int p = par[ptr];
                vector<int> curr;
         
                while(ptr != p){
                    curr.pb(b[ptr--].ss);
                }
         
                cout << sz(curr) << " ";
                trav(x,curr){
                    cout << x << " ";
                }
         
                cout << endl;
            }
        }

        return dp[n];
    };

    int want = get(n,0);

    int l = 1, r = n;
    int mn_len = -1;

    while(l <= r){
        int mid = (l+r) >> 1;
        if(get(mid,0) == want){
            mn_len = mid;
            r = mid - 1;
        }
        else{
            l = mid + 1;
        }
    }
    
    get(mn_len,1);
}
 
int main()
{
    fastio;
 
    int t = 1;
    // cin >> t;
 
    rep1(i, t) {
        solve(i);
    }
 
    return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	468 KB	Output is correct
2	Correct	2 ms	468 KB	Output is correct
3	Correct	2 ms	468 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	468 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	2844 KB	Output is correct
2	Correct	23 ms	2688 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	2992 KB	Output is correct
2	Correct	18 ms	2504 KB	Output is correct
3	Correct	25 ms	3048 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	248 ms	23132 KB	Output is correct
2	Correct	241 ms	23160 KB	Output is correct
3	Correct	256 ms	23808 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	334 ms	31524 KB	Output is correct
2	Correct	397 ms	33660 KB	Output is correct
3	Correct	333 ms	30684 KB	Output is correct
4	Correct	308 ms	27532 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	361 ms	34632 KB	Output is correct
2	Correct	318 ms	38692 KB	Output is correct
3	Correct	365 ms	30680 KB	Output is correct
4	Correct	376 ms	32248 KB	Output is correct

Submission #760265

Compilation message