結果

問題 No.2220 Range Insert & Point Mex
ユーザー miscalcmiscalc
提出日時 2023-02-17 23:04:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 200 ms / 2,000 ms
コード長 3,287 bytes
コンパイル時間 4,974 ms
コンパイル使用メモリ 275,476 KB
実行使用メモリ 16,640 KB
最終ジャッジ日時 2024-07-21 12:52:33
合計ジャッジ時間 11,412 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
6,816 KB
testcase_01 AC 4 ms
6,812 KB
testcase_02 AC 4 ms
6,940 KB
testcase_03 AC 3 ms
6,944 KB
testcase_04 AC 5 ms
6,944 KB
testcase_05 AC 4 ms
6,940 KB
testcase_06 AC 4 ms
6,944 KB
testcase_07 AC 4 ms
6,940 KB
testcase_08 AC 4 ms
6,940 KB
testcase_09 AC 4 ms
6,940 KB
testcase_10 AC 4 ms
6,940 KB
testcase_11 AC 4 ms
6,944 KB
testcase_12 AC 4 ms
6,940 KB
testcase_13 AC 186 ms
15,616 KB
testcase_14 AC 188 ms
15,616 KB
testcase_15 AC 186 ms
15,488 KB
testcase_16 AC 195 ms
15,488 KB
testcase_17 AC 186 ms
15,488 KB
testcase_18 AC 186 ms
15,744 KB
testcase_19 AC 187 ms
15,616 KB
testcase_20 AC 199 ms
13,440 KB
testcase_21 AC 200 ms
13,440 KB
testcase_22 AC 199 ms
13,488 KB
testcase_23 AC 192 ms
16,512 KB
testcase_24 AC 154 ms
12,672 KB
testcase_25 AC 134 ms
15,104 KB
testcase_26 AC 186 ms
16,640 KB
testcase_27 AC 97 ms
8,832 KB
testcase_28 AC 71 ms
13,440 KB
testcase_29 AC 82 ms
13,568 KB
testcase_30 AC 86 ms
13,440 KB
testcase_31 AC 160 ms
15,096 KB
testcase_32 AC 128 ms
14,460 KB
testcase_33 AC 136 ms
14,460 KB
testcase_34 AC 172 ms
14,528 KB
testcase_35 AC 176 ms
14,588 KB
testcase_36 AC 161 ms
14,504 KB
testcase_37 AC 171 ms
14,352 KB
testcase_38 AC 168 ms
15,888 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll logfloor(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp <= B / A; tmp *= A) {res++;} return res;}
ll logceil(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp < B; tmp *= A) {res++;} return res;}
ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; }
ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); }
ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); }
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
//*/

int main()
{
  const ll M = 100010;

  ll N;
  cin >> N;
  vector<vector<pll>> LR(M);
  for (ll i = 0; i < N; i++)
  {
    ll l, r, a;
    cin >> l >> r >> a;
    if (a < M)
      LR.at(a).push_back({l, r});
  }

  ll Q;
  cin >> Q;
  vector<ll> X(Q);
  for (ll i = 0; i < Q; i++)
  {
    cin >> X.at(i);
  }

  vector<ll> ans(Q, -1);
  set<pll> st;
  for (ll i = 0; i < Q; i++)
  {
    st.insert({X.at(i), i});
  }

  for (ll a = 0; a < M; a++)
  {     
    auto &lrs = LR.at(a);
    sort(lrs.begin(), lrs.end());

    {
      auto it = st.begin();
      //cerr << "A " << (*it).first << " " << (*it).second << endl;
      for (auto [l, r] : lrs)
      {
        while (it != st.end() && (*it).first < l)
        {
          ans.at((*it).second) = a;
          st.erase(it++);
          //cerr << "B " << (*it).first << " " << (*it).second << endl;
        }
        if (it != st.end() && (*it).first <= r)
          it = st.upper_bound({r, INF});
        //cerr << "C " << (*it).first << " " << (*it).second << endl;
      }
      while (it != st.end())
      {
        ans.at((*it).second) = a;
        st.erase(it++);
        //cerr << "D " << (*it).first << " " << (*it).second << endl;
      }
    }
  }
  printvect(ans);
}
0