#841481 (C++17) No.2220 Range Insert & Point Mex

提出ソース

結果

問題	No.2220 Range Insert & Point Mex
ユーザー	apricity
提出日時	2023-02-17 23:46:59
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	6,439 bytes
コンパイル時間	1,784 ms
コンパイル使用メモリ	146,780 KB
実行使用メモリ	13,940 KB
最終ジャッジ日時	2024-07-19 14:56:06
合計ジャッジ時間	6,404 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	WA	-
testcase_04	AC	2 ms 6,944 KB
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	AC	95 ms 9,840 KB
testcase_21	AC	93 ms 9,712 KB
testcase_22	AC	95 ms 9,716 KB
testcase_23	AC	138 ms 13,188 KB
testcase_24	AC	114 ms 11,240 KB
testcase_25	AC	87 ms 8,684 KB
testcase_26	AC	120 ms 12,456 KB
testcase_27	AC	99 ms 10,212 KB
testcase_28	AC	22 ms 6,940 KB
testcase_29	AC	25 ms 6,944 KB
testcase_30	AC	25 ms 6,940 KB
testcase_31	AC	103 ms 12,808 KB
testcase_32	AC	79 ms 9,832 KB
testcase_33	AC	79 ms 9,840 KB
testcase_34	AC	119 ms 11,372 KB
testcase_35	AC	115 ms 11,440 KB
testcase_36	AC	115 ms 11,372 KB
testcase_37	AC	114 ms 11,368 KB
testcase_38	AC	125 ms 12,416 KB

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

ソースコード

raw source code

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

template <typename T> struct RangeSet{
    set<pair<T, T>> st;
    T TINF;
    RangeSet(){
        TINF = numeric_limits<T>::max() / 2;
        st.emplace(TINF, TINF);
        st.emplace(-TINF, -TINF);
    }
    bool covered(T l, T r){
        assert(l <= r);
        auto ite = prev(st.lower_bound({l + 1, l + 1}));
        return ite->first <= l and r <= ite->second;
    }
    bool covered(T x) { return covered(x, x); }
    pair<T, T> covered_by(T l, T r){
        assert(l <= r);
        auto ite = prev(st.lower_bound({l + 1, l + 1}));
        if (ite->first <= l and r <= ite->second) return *ite;
        return make_pair(-TINF, -TINF);
    }
    pair<T, T> covered_by(T x) { return covered_by(x, x); }
    T insert(T l, T r){
        assert(l <= r);
        auto ite = prev(st.lower_bound({l + 1, l + 1}));
        if (ite->first <= l and r <= ite->second) return T(0);
        T sum_erased = T(0);
        if (ite->first <= l and l <= ite->second + 1){
            l = ite->first;
            sum_erased += ite->second - ite->first + 1;
            ite = st.erase(ite);
        }
        else ite = next(ite);
        while (r > ite->second){
            sum_erased += ite->second - ite->first + 1;
            ite = st.erase(ite);
        }
        if (ite->first - 1 <= r and r <= ite->second){
            sum_erased += ite->second - ite->first + 1;
            r = ite->second;
            st.erase(ite);
        }
        st.emplace(l, r);
        return r - l + 1 - sum_erased;
    }
    T insert(T x) { return insert(x, x); }
    T erase(T l, T r){
        assert(l <= r);
        auto ite = prev(st.lower_bound({l + 1, l + 1}));
        if (ite->first <= l and r <= ite->second){
            if (ite->first < l) st.emplace(ite->first, l - 1);
            if (r < ite->second) st.emplace(r + 1, ite->second);
            st.erase(ite);
            return r - l + 1;
        }
        T ret = T(0);
        if (ite->first <= l and l <= ite->second){
            ret += ite->second - l + 1;
            if (ite->first < l) st.emplace(ite->first, l - 1);
            ite = st.erase(ite);
        }
        else ite = next(ite);
        while (ite->second <= r){
            ret += ite->second - ite->first + 1;
            ite = st.erase(ite);
        }
        if (ite->first <= r and r <= ite->second){
            ret += r - ite->first + 1;
            if (r < ite->second) st.emplace(r + 1, ite->second);
            st.erase(ite);
        }
        return ret;
    }
    T erase(T x) { return erase(x, x); }
    int size() { return (int)st.size() - 2; }
    T mex(T x = 0){
        auto ite = prev(st.lower_bound({x + 1, x + 1}));
        if (ite->first <= x and x <= ite->second) return ite->second + 1;
        else return x;
    }
    void output(){
        cout << "RangeSet : ";
        for (auto &p : st){
            if (p.first == -TINF or p.second == TINF) continue;
            cout << "[" << p.first << ", " << p.second << "] ";
        }
        cout << "\n";
    }
    vector<pair<T, T>> get_ranges(){
        vector<pair<T, T>> res;
        for (auto &[l, r] : st){
            if (l == -TINF or r == TINF)
                continue;
            res.emplace_back(l, r);
        }
        return res;
    }
};

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; in(n);
    vector<tuple<int,int,int>> ev;
    rep(i,n){
        int l,r,a; in(l,r,a);
        if(a >= n) continue;
        ev.pb({l,-1,a});
        ev.pb({r,1,a});
    }
    int q; in(q);
    vector<int> x(q); in(x);
    rep(i,q) ev.pb({x[i],0,i});
    sort(ALL(ev));
    vector<int> ans(q);
    set<int> s;
    rep(i,n+1) s.insert(i);
    for(auto [pos,type,val] : ev){
        if(type == -1 && s.count(val)){
            s.erase(val);
        }
        else if(type == 1){
            s.insert(val);
        }
        else{
            debug(val,s);
            ans[val] = *s.begin();
        }
    }
    rep(i,q) out(ans[i]);
}

yukicoder

結果

テストケース

ソースコード