結果

問題 No.2220 Range Insert & Point Mex
ユーザー 👑 seekworserseekworser
提出日時 2023-02-17 23:08:11
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 9,410 bytes
コンパイル時間 3,422 ms
コンパイル使用メモリ 272,544 KB
実行使用メモリ 12,652 KB
最終ジャッジ日時 2024-07-19 14:19:33
合計ジャッジ時間 7,671 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 WA -
testcase_04 AC 1 ms
5,376 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 AC 2 ms
5,376 KB
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 164 ms
12,624 KB
testcase_21 AC 163 ms
12,652 KB
testcase_22 AC 168 ms
12,516 KB
testcase_23 AC 66 ms
9,448 KB
testcase_24 AC 59 ms
9,576 KB
testcase_25 AC 46 ms
7,144 KB
testcase_26 AC 65 ms
9,452 KB
testcase_27 AC 50 ms
9,452 KB
testcase_28 AC 16 ms
5,376 KB
testcase_29 AC 20 ms
5,376 KB
testcase_30 AC 19 ms
5,376 KB
testcase_31 AC 55 ms
9,576 KB
testcase_32 AC 55 ms
7,912 KB
testcase_33 AC 54 ms
7,908 KB
testcase_34 AC 80 ms
9,572 KB
testcase_35 AC 78 ms
9,444 KB
testcase_36 AC 121 ms
11,620 KB
testcase_37 AC 114 ms
11,756 KB
testcase_38 AC 63 ms
9,460 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#ifndef LOCAL_TEST
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // LOCAL_TEST
using namespace std;
using ll = long long;
using pii = pair<int, int>; using pll = pair<ll, ll>;
using vi = vector<int>;  using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>;  using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;
template <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.14159265358979323;
constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;
float EPS = 1e-8; double EPSL = 1e-16;
bool eq(const double x, const double y) { return abs(x - y) < EPSL; }
bool eq(const float x, const float y) { return abs(x - y) < EPS; }
template<typename T> bool eq(const T x, const T y) { return x == y; }
template<typename T> bool neq(const T x, const T y) { return !(eq(x, y)); }
template<typename T> bool ge(const T x, const T y) { return eq(x, y) || (x > y); }
template<typename T> bool le(const T x, const T y) { return eq(x, y) || (x < y); }
template<typename T> bool gt(const T x, const T y) { return !(le(x, y)); }
template<typename T> bool lt(const T x, const T y) { return !(ge(x, y)); }
constexpr int MODINT998244353 = 998244353;
constexpr int MODINT1000000007 = 1000000007;
struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define rep(i, n) for(ll i = 0, i##_len = ll(n); i < i##_len; ++i) // 0 から n-1 まで昇順
#define repi(i, s, t) for(ll i = ll(s), i##_end = ll(t); i < i##_end; ++i) // s から t まで昇順
#define repis(i, s, t, step) for(ll i = ll(s), i##_end = ll(t); i < i##_end; i+=step) // s から t まで stepずつ
#define repir(i, s, t, step) for(ll i = ll(s), i##_end = ll(t); i > i##_end; i+=step) // s から t まで stepずつ
#define repe(a, v) for(auto& a : (v)) // v の全要素（変更可能）
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod
#define sdiv(n, m) (((n) - smod(n, m)) / (m)) // 非負div
void Yes(bool b) { cout << (b ? "Yes\n" : "No\n"); return; }
void YES(bool b) { cout << (b ? "YES\n" : "NO\n"); return; }

ll powm(ll a, ll n, ll mod=INFL) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = (res * a) % mod;
        if (n > 1) a = (a * a) % mod;
        n >>= 1;
    }
    return res;
}
ll sqrtll(ll x) {
    assert(x >= 0);
    ll hi(x), lo(0);
    while (hi != lo) {
        ll y = (hi + lo + 1) / 2;
        if (y <= x/y) lo = y;
        else hi = y - 1;
    }
    return lo;
}
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）
int digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } // xのd進数桁数
template <class T> struct Mex {
private:
    set<pair<T, T>> s;

public:
    Mex(T inf=INF) {
        s.emplace(-inf, -inf);
        s.emplace(inf, inf);
    }

    bool contains(T x) const {
        auto it = prev(s.lower_bound(make_pair(x+1, x+1)));
        auto [l, u] = *it;
        return l <= x && x <= u;
    }

    bool insert(T x) {
        auto nit = s.lower_bound(make_pair(x+1, x+1));
        auto it = prev(nit);
        auto [l, u] = *it;
        auto [nl, nu] = *nit;
        if (l <= x && x <= u) return false;
        if (u == x-1) {
            if (nl == x+1) {
                s.erase(it);
                s.erase(nit);
                s.emplace(l, nu);
            } else {
                s.erase(it);
                s.emplace(l, x);
            }
        } else {
            if (nl == x+1) {
                s.erase(nit);
                s.emplace(x, nu);
            } else {
                s.emplace(x, x);
            }
        }
        return true;
    }

    bool erase(T x) {
        auto nit = s.lower_bound(make_pair(x+1, x+1));
        auto it = prev(nit);
        auto [l, u] = *it;
        if (x < l || u < x) return false;
        if (l == x) {
            if (u == x) {
                s.erase(it);
            } else {
                s.erase(it);
                s.emplace(l+1, u);
            }
            return true;
        }
        if (u == x) {
            s.erase(it);
            s.emplace(l, u-1);
            return true;
        }
        s.erase(it);
        s.emplace(l, x-1);
        s.emplace(x+1, u);
        return true;
    }

    T mex(T x = 0) const {
        auto [l, u] = *prev(s.lower_bound(make_pair(x+1, x+1)));
        if (l <= x && x <= u) {
            return u+1;
        } else {
            return x;
        }
    }
};
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);
template <class T> inline istream& operator>>(istream& is, vector<T>& v);
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v);
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp);
template <typename T> ostream &operator<<(ostream &os, const set<T> &st);
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st);
template <typename T> ostream &operator<<(ostream &os, queue<T> q);
template <typename T> ostream &operator<<(ostream &os, deque<T> q);
template <typename T> ostream &operator<<(ostream &os, stack<T> st);
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);

template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << " " << p.second; return os; }
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << " "; } 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 <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }

#define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print
#ifdef LOCAL_TEST
template <typename T>
void debug_func(int i, T name) { (void)i; (void)name; cerr << endl; }
template <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) {
  for ( ; name[i] != ',' && name[i] != '\0'; i++ ) cerr << name[i];
  cerr << ":" << a << " ";
  debug_func(i + 1, name, b...);
}
#endif
#ifndef LOCAL_TEST
template <typename... T>
void debug_func(const T &...) {}
#endif

int main() {
    int n;
    cin >> n;
    vector<tuple<ll, ll, bool>> e;
    rep(i, n) {
        ll l,r,a;
        cin >> l >> r >> a;
        e.emplace_back(l, a, true);
        e.emplace_back(r+1, a, false);
    }
    sort(all(e));
    repe(ei, e) {
        auto [xi, ai, ti] = ei;
        debug(xi, ai, ti);
    }
    n = sz(e);
    Mex<ll> mex(INFL);
    int q;
    cin >> q;
    vl x(q);
    cin >> x;
    vl ans(q);
    debug(x);
    int epos = 0;
    rep(i, q) {
        while (epos < n) {
            auto [xi, ai, ti] = e[epos];
            if (xi > x[i]) break;
            if (ti) mex.insert(ai);
            else mex.erase(ai);
            epos++;
        }
        ans[i] = mex.mex(0);
    }
    rep(i, q) cout << ans[i] << '\n';
}
0