結果

問題 No.2421 entersys?
ユーザー poyonpoyon
提出日時 2023-08-12 14:04:21
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 594 ms / 3,000 ms
コード長 9,942 bytes
コンパイル時間 2,859 ms
コンパイル使用メモリ 234,176 KB
実行使用メモリ 72,848 KB
最終ジャッジ日時 2024-11-19 17:16:56
合計ジャッジ時間 12,737 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
7,868 KB
testcase_01 AC 5 ms
8,064 KB
testcase_02 AC 6 ms
8,352 KB
testcase_03 AC 5 ms
7,964 KB
testcase_04 AC 6 ms
7,964 KB
testcase_05 AC 6 ms
8,192 KB
testcase_06 AC 5 ms
8,192 KB
testcase_07 AC 6 ms
8,192 KB
testcase_08 AC 5 ms
8,320 KB
testcase_09 AC 8 ms
8,472 KB
testcase_10 AC 6 ms
8,172 KB
testcase_11 AC 446 ms
60,452 KB
testcase_12 AC 437 ms
60,588 KB
testcase_13 AC 452 ms
60,448 KB
testcase_14 AC 445 ms
60,404 KB
testcase_15 AC 435 ms
60,504 KB
testcase_16 AC 446 ms
62,612 KB
testcase_17 AC 453 ms
62,472 KB
testcase_18 AC 465 ms
62,472 KB
testcase_19 AC 441 ms
62,476 KB
testcase_20 AC 450 ms
62,460 KB
testcase_21 AC 388 ms
58,008 KB
testcase_22 AC 335 ms
56,596 KB
testcase_23 AC 589 ms
72,728 KB
testcase_24 AC 594 ms
72,848 KB
testcase_25 AC 583 ms
72,840 KB
testcase_26 AC 272 ms
53,024 KB
testcase_27 AC 275 ms
53,024 KB
testcase_28 AC 274 ms
53,024 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// clang-format off
#ifdef _LOCAL
    #include <pch.hpp>
#else
    #include <bits/stdc++.h>
    #define cerr if (false) cerr
    #define debug_bar
    #define debug(...)
    #define debug2(vv)
    #define debug3(vvv)
#endif

using namespace std;
using ll = long long;
using ld = long double;
using str = string;
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VC = vector<char>;
using VS = vector<string>;
using VVS = vector<VS>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define FORE(e,c) for (auto&& e : c)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define COUNT(c,v) count(ALL(c),(v))
#define len(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) ((ll)__builtin_popcountll(b))
#define LB(c,v) distance((c).begin(), lower_bound(ALL(c), (v)))
#define UB(c,v) distance((c).begin(), upper_bound(ALL(c), (v)))
#define UQ(c) do { SORT(c); (c).erase(unique(ALL(c)), (c).end()); (c).shrink_to_fit(); } while (0)
#define END(...) do { print(__VA_ARGS__); exit(0); } while (0)
constexpr ld EPS = 1e-10;
constexpr ld PI  = acosl(-1.0);
constexpr int inf = (1 << 30) - (1 << 15);   // 1,073,709,056
constexpr ll INF = (1LL << 62) - (1LL << 31);  // 4,611,686,016,279,904,256
template<class... T> void input(T&... a) { (cin >> ... >> a); }
void print() { cout << '\n'; }
template<class T> void print(const T& a) { cout << a << '\n'; }
template<class P1, class P2> void print(const pair<P1, P2>& a) { cout << a.first << " " << a.second << '\n'; }
template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void cout_line(const vector<T>& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; } cout << '\n'; }
template<class T> void print(const vector<T>& a) { cout_line(a, 0, a.size()); }
template<class S, class T> bool chmin(S& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
template<class S, class T> bool chmax(S& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> T SUM(const vector<T>& A) { return accumulate(ALL(A), T(0)); }
template<class T> vector<T> cumsum(const vector<T>& A, bool offset = false) { int N = A.size(); vector<T> S(N+1, 0); for (int i = 0; i < N; i++) { S[i+1] = S[i] + A[i]; } if (not offset) { S.erase(S.begin()); } return S; }
template<class T> string to_binary(T x, int B = 0) { string s; while (x) { s += ('0' + (x & 1)); x >>= 1; } while ((int)s.size() < B) { s += '0'; } reverse(s.begin(), s.end()); return s; }
template<class F> ll binary_search(const F& is_ok, ll ok, ll ng) { while (abs(ok - ng) > 1) { ll m = (ok + ng) / 2; (is_ok(m) ? ok : ng) = m; } return ok; }
template<class F> double binary_search_real(const F& is_ok, double ok, double ng, int iter = 90) { for (int i = 0; i < iter; i++) { double m = (ok + ng) / 2; (is_ok(m) ? ok : ng) = m; } return ok; }
template<class T> using PQ_max = priority_queue<T>;
template<class T> using PQ_min = priority_queue<T, vector<T>, greater<T>>;
template<class T> T pick(stack<T>& s) { assert(not s.empty()); T x = s.top(); s.pop(); return x; }
template<class T> T pick(queue<T>& q) { assert(not q.empty()); T x = q.front(); q.pop(); return x; }
template<class T> T pick_front(deque<T>& dq) { assert(not dq.empty()); T x = dq.front(); dq.pop_front(); return x; }
template<class T> T pick_back(deque<T>& dq) { assert(not dq.empty()); T x = dq.back(); dq.pop_back(); return x; }
template<class T> T pick(PQ_min<T>& pq) { assert(not pq.empty()); T x = pq.top(); pq.pop(); return x; }
template<class T> T pick(PQ_max<T>& pq) { assert(not pq.empty()); T x = pq.top(); pq.pop(); return x; }
template<class T> T pick(vector<T>& v) { assert(not v.empty()); T x = v.back(); v.pop_back(); return x; }
int to_int(const char c) { if (islower(c)) { return (c - 'a'); } if (isupper(c)) { return (c - 'A'); } if (isdigit(c)) { return (c - '0'); } assert(false); }
char to_a(const int i) { assert(0 <= i && i < 26); return ('a' + i); }
char to_A(const int i) { assert(0 <= i && i < 26); return ('A' + i); }
char to_d(const int i) { assert(0 <= i && i <= 9); return ('0' + i); }
ll min(int a, ll b) { return min((ll)a, b); }
ll min(ll a, int b) { return min(a, (ll)b); }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
ll mod(ll x, ll m) { assert(m > 0); return (x % m + m) % m; }
ll ceil(ll a, ll b) { if (b < 0) { return ceil(-a, -b); } assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
ll floor(ll a, ll b) { if (b < 0) { return floor(-a, -b); } assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
ll powint(ll x, ll n) { assert(n >= 0); if (n == 0) { return 1; }; ll res = powint(x, n>>1); res *= res; if (n & 1) { res *= x; } return res; }
pair<ll,ll> divmod(ll a, ll b) { assert(b != 0); ll q = floor(a, b); return make_pair(q, a - q * b); }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
ll digitlen(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; }
ll msb(ll b) { return (b <= 0 ? -1 : (63 - __builtin_clzll(b))); }
ll lsb(ll b) { return (b <= 0 ? -1 : __builtin_ctzll(b)); }
// --------------------------------------------------------

// 座標圧縮
template <class T = ll>
struct compress {
  public:
    compress() {}
    compress(const vector<T>& A) : xs(A) {}
    compress(const vector<T>& A, const vector<T>& B) {
        xs.reserve(A.size() + B.size());
        for (const auto& a : A) { xs.push_back(a); }
        for (const auto& b : B) { xs.push_back(b); }
    }

    // 値 v を追加する
    //   - amortized O(1)
    void add(T v) {
        assert(not is_built);
        xs.push_back(v);
    }

    // 配列 A の値を全て追加する
    //   - O(|A|)
    void add(const vector<T>& A) {
        assert(not is_built);
        xs.reserve(xs.size() + A.size());
        for (const auto& a : A) { xs.push_back(a); }
    }

    // 座標圧縮して種類数を返す
    //   - O(N log N)
    int build() {
        assert(not is_built);
        sort(xs.begin(), xs.end());
        xs.erase(unique(xs.begin(), xs.end()), xs.end());
        is_built = true;
        return xs.size();
    }

    // 座標圧縮前で i 番目に大きい値を返す (0-indexed)
    //   - O(1)
    T operator[] (int i) const noexcept {
        assert(is_built);
        assert(0 <= i && i < (int)xs.size());
        return xs[i];
    }

    // 値 v に対応する座標圧縮後の値（番号）を返す
    // 値 v が元の配列に存在することを想定
    //   - O(log N)
    int operator() (T v) const noexcept {
        assert(is_built);
        auto it = lower_bound(xs.begin(), xs.end(), v);
        assert(it != xs.end() && *it == v);
        return distance(xs.begin(), it);
    }

    // 座標圧縮後の値の種類数を返す
    //   - O(1)
    int size() const noexcept {
        assert(is_built);
        return xs.size();
    }

  private:
    bool is_built = false;
    vector<T> xs;
};


#include <atcoder/lazysegtree>
using namespace atcoder;

// 区間加算・1点取得
using Mono = ll;
using Func = ll;
Mono op([[maybe_unused]] Mono a, [[maybe_unused]] Mono b) { return 0; }
Mono e() { return 0; }
Mono mapping(Func f, Mono a) { return a + f; }
Func composition(Func f, Func g) { return f + g; }
Func id() { return 0; }

// clang-format on
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N;
    input(N);
    VS X(N);
    VLL L(N), R(N);
    REP (i, N) {
        input(X[i], L[i], R[i]);
    }

    // 動的に番号管理
    int n_idx = 0;
    map<string, int> mp_idx;
    auto idx = [&](const string& s) -> int {
        auto it = mp_idx.find(s);
        if (it != mp_idx.end()) { return it->second; }
        return mp_idx[s] = n_idx++;
    };

    // (L, -1), (R, +1)
    vector<set<P>> memo(N + 1e5);
    compress<ll> z;
    REP (i, N) {
        z.add(L[i]);
        z.add(R[i]);
        memo[idx(X[i])].emplace(L[i], -1);
        memo[idx(X[i])].emplace(R[i], +1);
    }

    ll Q;
    input(Q);
    VLL q(Q), t(Q), l(Q), r(Q);
    VS x(Q);
    REP (i, Q) {
        input(q[i]);
        if (q[i] == 1) {
            input(x[i], t[i]);
            z.add(t[i]);
        } else if (q[i] == 2) {
            input(t[i]);
            z.add(t[i]);
        } else {
            input(x[i], l[i], r[i]);
            z.add(l[i]);
            z.add(r[i]);
        }
    }

    ll M = z.build();
    vector<Mono> seg_init(M, e());
    lazy_segtree<Mono, op, e, Func, mapping, composition, id> seg(seg_init);
    REP (i, N) {
        seg.apply(z(L[i]), z(R[i]) + 1, 1);
    }

    REP (i, Q) {
        input(q[i]);
        if (q[i] == 1) {
            ll id = idx(x[i]);
            auto& st = memo[id];
            auto it = st.lower_bound(make_pair(t[i], 0));
            bool ok = false;
            if (it != st.end() && it->second == +1) { ok = true; }
            string ans = (ok ? "Yes" : "No");
            print(ans);
        } else if (q[i] == 2) {
            ll ans = seg.get(z(t[i]));
            print(ans);
        } else {
            ll id = idx(x[i]);
            memo[id].emplace(l[i], -1);
            memo[id].emplace(r[i], +1);
            seg.apply(z(l[i]), z(r[i]) + 1, 1);
        }
    }

    return 0;
}
0