oj.uz

답안 #760151

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
760151 2023-06-17T08:35:07 Z GrindMachine Teams (CEOI11_tea) C++17
70 / 100
 2500 ms 70740 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

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

template<typename T>
struct segtree {
    // https://codeforces.com/blog/entry/18051

    /*=======================================================*/

    struct data {
        ll mx,ind;
    };

    data neutral = {-inf2,-1};

    data merge(data &left, data &right) {
        if(left.mx > right.mx) return left;
        else return right;
    }

    void create(int i, T v) {
        tr[i] = {v,i-n};
    }

    void modify(int i, T v) {
        tr[i] = {v,i-n};
    }

    /*=======================================================*/

    int n;
    vector<data> tr;

    segtree() {

    }

    segtree(int siz) {
        init(siz);
    }

    void init(int siz) {
        n = siz;
        tr.assign(2 * n, neutral);
    }

    void build(vector<T> &a, int siz) {
        rep(i, siz) create(i + n, a[i]);
        rev(i, n - 1, 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    void pupd(int i, T v) {
        modify(i + n, v);
        for (i = (i + n) >> 1; i; i >>= 1) tr[i] = merge(tr[i << 1], tr[i << 1 | 1]);
    }

    data query(int l, int r) {
        data resl = neutral, resr = neutral;

        for (l += n, r += n; l <= r; l >>= 1, r >>= 1) {
            if (l & 1) resl = merge(resl, tr[l++]);
            if (!(r & 1)) resr = merge(tr[r--], resr);
        }

        return merge(resl, resr);
    }
};

void solve(int test_case)
{
    ll n; cin >> n;
    vector<ll> a(n+5);
    rep1(i,n) cin >> a[i];

    vector<pll> b;
    rep1(i,n) b.pb({a[i],i});

    sort(all(b));
    b.insert(b.begin(),{0,0});

    ll want = 0;

    {
        segtree<ll> st(n+5);
        st.pupd(0,0);
        
        vector<ll> dp(n+5);

        rep1(i,n){
            auto [v,ind] = b[i];
            auto [mx,mx_ind] = st.query(0,i-v);
            dp[i] = mx+1;
            st.pupd(i,dp[i]);
        }

        want = dp[n];
    }
    
    auto ok = [&](ll len, bool printt){
        segtree<ll> st(n+5);
        st.pupd(0,0);
        
        vector<ll> dp(n+5);
        vector<ll> par(n+5);

        rep1(i,n){
            auto [v,ind] = b[i];
            auto [mx,mx_ind] = st.query(max(i-len,0ll),i-v);
            dp[i] = mx+1;
            par[i] = mx_ind;
            st.pupd(i,dp[i]);
        }

        if(printt){
            cout << dp[n] << endl;
            ll ptr = n;

            while(ptr){
                ll p = par[ptr];
                vector<ll> curr;

                while(ptr != p){
                    curr.pb(b[ptr--].ss);
                }

                cout << sz(curr) << " ";
                trav(x,curr){
                    cout << x << " ";
                }

                cout << endl;
            }
        }

        if(dp[n] == want) return true;
        else return false;
    };

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

    while(l <= r){
        ll mid = (l+r) >> 1;
        if(ok(mid,0)){
            mn_len = mid;
            r = mid - 1;
        }
        else{
            l = mid + 1;
        }
    }

    ok(mn_len,1);
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 316 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 724 KB Output is correct
2 Correct 11 ms 724 KB Output is correct
3 Correct 11 ms 724 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 724 KB Output is correct
2 Correct 10 ms 724 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 222 ms 6724 KB Output is correct
2 Correct 223 ms 6608 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 276 ms 7304 KB Output is correct
2 Correct 195 ms 6292 KB Output is correct
3 Correct 261 ms 7792 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2541 ms 53096 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2552 ms 70736 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2562 ms 70740 KB Time limit exceeded
2 Halted 0 ms 0 KB -