#1019738 (C++17) No.2930 Larger Mex

提出ソース

結果

問題	No.2930 Larger Mex
ユーザー	dyktr_06
提出日時	2024-10-15 16:18:32
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	52 ms / 2,000 ms
コード長	7,371 bytes
コンパイル時間	2,274 ms
コンパイル使用メモリ	205,620 KB
実行使用メモリ	9,472 KB
最終ジャッジ日時	2024-10-15 16:18:42
合計ジャッジ時間	9,305 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	3 ms 6,400 KB
testcase_01	AC	4 ms 6,400 KB
testcase_02	AC	4 ms 6,400 KB
testcase_03	AC	4 ms 6,400 KB
testcase_04	AC	4 ms 6,272 KB
testcase_05	AC	4 ms 6,272 KB
testcase_06	AC	4 ms 6,272 KB
testcase_07	AC	4 ms 6,272 KB
testcase_08	AC	35 ms 9,248 KB
testcase_09	AC	33 ms 9,148 KB
testcase_10	AC	37 ms 9,184 KB
testcase_11	AC	27 ms 8,792 KB
testcase_12	AC	41 ms 9,336 KB
testcase_13	AC	38 ms 9,472 KB
testcase_14	AC	43 ms 9,340 KB
testcase_15	AC	38 ms 9,180 KB
testcase_16	AC	33 ms 8,812 KB
testcase_17	AC	43 ms 9,456 KB
testcase_18	AC	36 ms 8,820 KB
testcase_19	AC	40 ms 9,344 KB
testcase_20	AC	39 ms 9,468 KB
testcase_21	AC	41 ms 9,344 KB
testcase_22	AC	47 ms 9,436 KB
testcase_23	AC	37 ms 9,136 KB
testcase_24	AC	41 ms 9,288 KB
testcase_25	AC	49 ms 9,292 KB
testcase_26	AC	27 ms 9,268 KB
testcase_27	AC	23 ms 8,764 KB
testcase_28	AC	25 ms 9,008 KB
testcase_29	AC	26 ms 9,184 KB
testcase_30	AC	33 ms 8,844 KB
testcase_31	AC	27 ms 8,636 KB
testcase_32	AC	32 ms 9,148 KB
testcase_33	AC	33 ms 9,068 KB
testcase_34	AC	41 ms 9,312 KB
testcase_35	AC	26 ms 8,360 KB
testcase_36	AC	43 ms 9,380 KB
testcase_37	AC	35 ms 9,088 KB
testcase_38	AC	40 ms 9,288 KB
testcase_39	AC	40 ms 9,284 KB
testcase_40	AC	42 ms 9,284 KB
testcase_41	AC	33 ms 9,128 KB
testcase_42	AC	47 ms 9,104 KB
testcase_43	AC	27 ms 9,184 KB
testcase_44	AC	27 ms 9,084 KB
testcase_45	AC	28 ms 9,204 KB
testcase_46	AC	47 ms 9,276 KB
testcase_47	AC	48 ms 9,384 KB
testcase_48	AC	34 ms 8,328 KB
testcase_49	AC	50 ms 9,320 KB
testcase_50	AC	47 ms 9,468 KB
testcase_51	AC	52 ms 9,472 KB
testcase_52	AC	45 ms 9,340 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>

using namespace std;

#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)

#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))

typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;

template<class T> long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T &a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T &a){ return *max_element(a.begin(), a.end()); }

const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);

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

template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }

template <typename T>
long long binary_search(long long ok, long long ng, T check){
    while(abs(ok - ng) > 1){
        long long mid = (ok + ng) / 2;
        if(check(mid)) ok = mid;
        else ng = mid;
    }
    return ok;
}

template <typename T>
long double binary_search_real(long double ok, long double ng, T check, int iter = 100){
    for(int i = 0; i < iter; ++i){
        long double mid = (ok + ng) / 2;
        if(check(mid)) ok = mid;
        else ng = mid;
    }
    return ok;
}

template <typename T>
long long trisum(T a, T b){
    long long res = ((b - a + 1) * (a + b)) / 2;
    return res;
}

template <typename T>
T intpow(T x, int n){
    T ret = 1;
    while(n > 0) {
        if(n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
    }
    return ret;
}

template <typename T>
T getReminder(T a, T b){
    if(b == 0) return -1;
    if(a >= 0 && b > 0){
        return a % b;
    } else if(a < 0 && b > 0){
        return ((a % b) + b) % b;
    } else if(a >= 0 && b < 0){
        return a % b;
    } else{
        return (abs(b) - abs(a % b)) % b;
    }
}

template<class T, class U> inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T &a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>> &G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }

template <typename T>
struct BinaryIndexedTree{
    int N;
    vector<T> BIT;
    BinaryIndexedTree(const int &N) : N(N), BIT(N + 1, 0){
    }

    T get(int i){
        return sum(i + 1) - sum(i);
    }

    void add(int i, T x){
        i++;
        while(i <= N){
            BIT[i] += x;
            i += i & -i;
        }
    }

    T sum(int i) const {
        T ans = 0;
        while(i > 0){
            ans += BIT[i];
            i -= i & -i;
        }
        return ans;
    }

    T sum(int L, int R) const {
        return sum(R) - sum(L);
    }

    int lower_bound(T x) const {
        if(x <= 0){
            return 0;
        } else{
            int v = 0, r = 1;
            while(r < N) r = r << 1;
            for(int len = r; len > 0; len = len >> 1){
                if(v + len < N && BIT[v + len] < x){
                    x -= BIT[v + len];
                    v += len;
                }
            }
            return v;
        }
    }

    int upper_bound(T x) const {
        if(x < 0){
            return 0;
        } else{
            int v = 0, r = 1;
            while(r <= N) r = r << 1;
            for(int len = r; len > 0; len = len >> 1){
                if(v + len <= N && BIT[v + len] <= x){
                    x -= BIT[v + len];
                    v += len;
                }
            }
            return v;
        }
    }

    T operator [](int i) const {
        return sum(i, i + 1);
    }
};

ll T;

void input(){
    in(T);
}

void solve(){
    ll n, m; in(n, m);
    vll a; vin(a, n);
    BinaryIndexedTree<ll> BIT(200001), ans(n + 1);
    vll cnt(200001);
    ll r = 0;
    rep(l, n){
        chmax(r, (ll) l);
        while(r < n && BIT.sum(m) < m){
            cnt[a[r]]++;
            if(cnt[a[r]] == 1) BIT.add(a[r], 1);
            r++;
        }
        if(BIT.sum(m) == m){
            ll lenl = r - l;
            ll lenr = n - l;
            ans.add(lenl, 1);
            ans.add(lenr + 1, -1);
        }
        cnt[a[l]]--;
        if(cnt[a[l]] == 0) BIT.add(a[l], -1);
    }
    rep(i, 1, n + 1){
        out(ans.sum(i + 1));
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);

    T = 1;
    // input();
    while(T--) solve();
}

yukicoder

結果

テストケース

ソースコード