oj.uz

답안 #532465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
532465 2022-03-03T00:34:10 Z definitelynotmee Teams (CEOI11_tea) C++
100 / 100
 2240 ms 80708 KB 
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
using namespace std;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
const int MAXN = 1e6+1;



int main(){

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> v(n+1);
    for(int i = 1; i <= n; i++)
        cin >> v[i];
    vector<int> o(n+1);
    iota(all(o),0);
    stable_sort(1+all(o),[&](int a, int b){return v[a] < v[b];});

    vector<pii> dp(n+1);

    auto solve =[&](int limit){
        priority_queue<pii> q;
        q.push({-INF,-INF});
        int ptr = -1;
        for(int i = 1; i <= n; i++){
            while(ptr < i-v[o[i]]){
                ptr++;
                if(ptr>=0)
                    q.push({dp[ptr].ff,ptr});
            }
            ptr = min(ptr,i-v[o[i]]);
            int timer = 0;
            while(q.top().ss > ptr || (q.top().ss!=-INF && q.top().ss < i-limit))
                q.pop();

            dp[i] = q.top();
            dp[i].ff++;
        }
    };
    solve(INF);
    int goal = dp[n].ff;

    int ini = 1, fim = n;
    while(ini!=fim){
        int m = (ini+fim)>>1;
        solve(m);
        if(dp[n].ff == goal)
            fim = m;
        else ini = m+1;
    }
    solve(ini);

    matrix<int> resp;
    resp.reserve(dp[n].ff);
    int id = n;
    while(id){
        //cout << id << ' ' << dp[id].ss << endl;
        resp.push_back({});
        for(int i = id; i > dp[id].ss; i--){
            resp.back().push_back(o[i]);
        }
        id = dp[id].ss;
    }
    cout << resp.size() << '\n';
    for(vector<int>& i : resp){
        cout << i.size() << ' ';
        for(int j : i )
            cout << j << ' ';
        cout << '\n';
    }


    return 0;

}

Compilation message

tea.cpp: In lambda function:
tea.cpp:51:17: warning: unused variable 'timer' [-Wunused-variable]
   51 |             int timer = 0;
      |                 ^~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 460 KB Output is correct
2 Correct 6 ms 452 KB Output is correct
3 Correct 5 ms 460 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 448 KB Output is correct
2 Correct 4 ms 460 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 2524 KB Output is correct
2 Correct 108 ms 3224 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 3312 KB Output is correct
2 Correct 95 ms 3120 KB Output is correct
3 Correct 118 ms 3344 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1385 ms 26068 KB Output is correct
2 Correct 1320 ms 26196 KB Output is correct
3 Correct 1381 ms 25708 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1877 ms 31252 KB Output is correct
2 Correct 1351 ms 80708 KB Output is correct
3 Correct 1726 ms 32032 KB Output is correct
4 Correct 2020 ms 28948 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1036 ms 30824 KB Output is correct
2 Correct 286 ms 30816 KB Output is correct
3 Correct 1641 ms 32064 KB Output is correct
4 Correct 2240 ms 31796 KB Output is correct