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

• 問題: No.2220 Range Insert & Point Mex
• ユーザー: nu50218
• 提出日時: 2023-02-17 23:51:12
• 言語: C++17(gcc12) (gcc 12.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 131 ms / 2,000 ms
• コード長: 1,966 bytes
• コンパイル時間: 10,845 ms
• コンパイル使用メモリ: 295,104 KB
• 最終ジャッジ日時: 2025-02-10 18:25:05
• ジャッジサーバーID （参考情報）: judge3 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 36

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#ifdef LOCAL
#include <local.hpp>
#else
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
#define debug(...) (static_cast<void>(0))
#define postprocess() (static_cast<void>(0))
#endif
// #include "atcoder/dsu.hpp"
// #include "atcoder/modint.hpp"
// using mint = atcoder::modint998244353;
// using mint = atcoder::modint1000000007;
using namespace std;
using ll = long long;
using ld = long double;
void solve([[maybe_unused]] int test) {
    // 1: l_i, a_i
    // 2: x_i, i
    // 3: r_i, a_i
    vector<tuple<int, int, int>> queries;
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) {
        int l, r, a;
        cin >> l >> r >> a;
        if (a <= N) {
            queries.push_back({l, 1, a});
            queries.push_back({r, 3, a});
        }
    }
    int Q;
    cin >> Q;
    for (int i = 0; i < Q; i++) {
        int x;
        cin >> x;
        queries.push_back({x, 2, i});
    }
    sort(queries.begin(), queries.end());
    optional<int> ans[Q];
    int num[N + 1];
    set<int> not_included;
    for (int i = 0; i <= N; i++) {
        num[i] = 0;
        not_included.insert(i);
    }
    for (auto&& query : queries) {
        int type = get<1>(query);
        if (type == 1) {
            int l, a;
            tie(l, ignore, a) = query;
            num[a] += 1;
            not_included.erase(a);
        }
        if (type == 3) {
            int r, a;
            tie(r, ignore, a) = query;
            num[a] -= 1;
            if (num[a] == 0) not_included.insert(a);
        }
        if (type == 2) {
            int x, i;
            tie(x, ignore, i) = query;
            ans[i] = *not_included.begin();
        }
    }
    for (int i = 0; i < Q; i++) {
        cout << ans[i].value_or(-1) << '\n';
    }
}
int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    for (int _t = 1; _t <= t; _t++) solve(_t);
    postprocess();
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX