Submission #23087977

---

Source Code Expand

#include <bits/stdc++.h>
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const long long INF = 1e18;
//const ll mod = 1000000007;
ll dp[201000][35];
const int M = 30;
ll to[201000];
ll N, K;
ll A[201000];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N >> K;
    for(int i = 0; i < N; i++) cin >> A[i];
    sort(A, A + N);
    to[N] = N;
    for(int i = N - 1; i >= 0; i--) {
        to[i] = to[i+1];
        while(to[i] >= 1 and A[to[i]-1] * 2 > A[i]) {
            to[i]--;
        }
    }
    /*
    for(int i = 0; i < N; i++) cerr << A[i] << " ";
    cerr << endl;
    for(int i = 0; i < N; i++) cerr << to[i] << " ";
    cerr << endl;
    */
    for(int i = 0; i <= N; i++) {
        for(int j = 0; j <= M; j++) {
            dp[i][j] = INF;
        }
    }
    dp[N][0] = 0;
    for(int i = N; i >= 1; i--) {
        for(int j = 0; j <= M; j++) {
            chmin(dp[i-1][j], dp[i][j] + 1);
            chmin(dp[to[i-1]][j+1], dp[i][j]);
        }
    }
    for(int j = 0; j <= M; j++) {
        if(dp[0][j] > K) continue;
        cout << j << " " << dp[0][j] << endl;
        break;
    }
    return 0;
}

Submission Info

Judge Result