結果

問題 No.3269 Leq-K Partition
ユーザー AngrySadEight
提出日時 2025-09-20 00:12:17
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 4,927 bytes
コンパイル時間 3,417 ms
コンパイル使用メモリ 184,020 KB
実行使用メモリ 13,324 KB
最終ジャッジ日時 2025-09-20 00:12:29
合計ジャッジ時間 11,725 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 5 TLE * 1 -- * 21
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main(){
    ll N;
    cin >> N;
    vector<ll> A(N);
    for (ll i = 0; i < N; i++){
        cin >> A[i];
        A[i]--;
    }

    ll INF = 10000000000023;

    vector<ll> cnts(N, 0);

    ll B = 3000;
    for (ll i = 1; i <= min(B, N); i++){
        // 尺取り法 + dp
        vector<ll> dp(N + 1, INF);
        dp[0] = 0;

        ll left = 0;
        ll right = 0;
        ll kind = 0;
        while (left < N){
            if (right == N){
                cnts[A[left]]--;
                if (cnts[A[left]] == 0){
                    kind--;
                }
                left++;
            }
            else if (kind <= i){
                if (cnts[A[right]] == 0){
                    kind++;
                }
                cnts[A[right]]++;
                right++;
            }
            else{
                cnts[A[left]]--;
                if (cnts[A[left]] == 0){
                    kind--;
                }
                left++;
            }
            if (kind <= i){
                dp[right] = min(dp[right], dp[left] + 1);
            }
        }
        cout << dp[N] << endl;
    }
    for (ll i = B + 1; i <= N; i++){
        ll now = 0;
        ll cnt = 0;

        while (now < N){
            if (N - now <= i){
                cnt++;
                break;
            }
            ll ok = i;
            ll ng = N - now + 1;
            while (ng - ok > 1){
                ll mid = (ok + ng) / 2;
                ll kind = 0;
                for (ll j = now; j < now + mid; j++){
                    if (cnts[A[j]] == 0){
                        kind++;
                    }
                    cnts[A[j]]++;
                }
                for (ll j = now; j < now + mid; j++){
                    cnts[A[j]]--;
                }
                if (kind > i){
                    ng = mid;
                }
                else{
                    ok = mid;
                }
            }
            now += ok;
            cnt++;
            // debug(now);
        }
        cout << cnt << endl;
    }
}
0