제출 #839345

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
839345		emkow	Teams (CEOI11_tea)	C++14	100 / 100	306 ms	86472 KiB

tea

#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define pb emplace_back
#define ins insert
#define ssize(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define pld pair <ld, ld>
#define st first
#define nd second

using namespace std;
using ll = int_fast64_t;
// using lll = __int128_t;
using ld = long double;
const int oo = 1e9 + 7;
const int mod = 1e9 + 7;

void solve(){
    int n; cin >> n;
    vector <pii> arr(n + 1);
    for(int i = 1; i <= n; i ++){
        cin >> arr[i].st;
        arr[i].nd = i;
    }
    sort(all(arr));
    vector <int> dp(n + 1, 0);
    for(int i = 1; i <= n; i ++){
        if(i == n){
            dp[i] = dp[i - arr[i].st] + 1;
            continue;
        }
        if(arr[i].st > i) dp[i] = dp[i - 1];
        else dp[i] = max(dp[i - 1], dp[i - arr[i].st] + 1);
    }
    vector <vector<int>> ans;
    priority_queue <pii> pq;
    for(int i = n; i >= 1; i --){
        if(i == n || (arr[i].st <= i && dp[i - arr[i].st] + 1 >= dp[i - 1])){
            ans.pb();
            for(int j = i; j >= i - arr[i].st + 1; j --) ans.back().pb(arr[j].nd);
            pq.emplace(- ssize(ans.back()), ssize(ans) - 1);
            i -= arr[i].st - 1;
            continue;
        }
        pii rn = pq.top();
        pq.pop();
        ans[rn.nd].pb(arr[i].nd);
        pq.emplace(- ssize(ans[rn.nd]), rn.nd);
    }
    cout << ssize(ans) << '\n';
    for(auto i: ans){
        cout << ssize(i) << ' ';
        for(auto j: i) cout << j << ' ';
        cout << '\n';
    }
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t; t = 1;
    // cin >> t;
    while(t --) solve();
    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