結果

問題 No.2421 entersys?
ユーザー 👑 AngrySadEightAngrySadEight
提出日時 2023-08-12 14:56:24
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,491 ms / 3,000 ms
コード長 6,243 bytes
コンパイル時間 5,965 ms
コンパイル使用メモリ 257,804 KB
実行使用メモリ 85,940 KB
最終ジャッジ日時 2024-11-19 22:16:21
合計ジャッジ時間 27,653 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 6 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 3 ms
5,248 KB
testcase_05 AC 4 ms
5,248 KB
testcase_06 AC 5 ms
5,248 KB
testcase_07 AC 5 ms
5,248 KB
testcase_08 AC 5 ms
5,248 KB
testcase_09 AC 7 ms
5,248 KB
testcase_10 AC 4 ms
5,248 KB
testcase_11 AC 1,114 ms
66,220 KB
testcase_12 AC 1,105 ms
66,164 KB
testcase_13 AC 1,118 ms
66,304 KB
testcase_14 AC 1,092 ms
66,264 KB
testcase_15 AC 1,092 ms
66,164 KB
testcase_16 AC 1,161 ms
70,260 KB
testcase_17 AC 1,148 ms
70,152 KB
testcase_18 AC 1,154 ms
70,108 KB
testcase_19 AC 1,178 ms
70,088 KB
testcase_20 AC 1,163 ms
70,240 KB
testcase_21 AC 950 ms
54,168 KB
testcase_22 AC 984 ms
63,816 KB
testcase_23 AC 1,446 ms
85,940 KB
testcase_24 AC 1,476 ms
85,932 KB
testcase_25 AC 1,491 ms
85,924 KB
testcase_26 AC 591 ms
43,908 KB
testcase_27 AC 722 ms
43,912 KB
testcase_28 AC 712 ms
44,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

ll op(ll a, ll b) { return max(a, b); }

ll e() { return 0; }

ll mapping(ll f, ll x) { return f + x; }

ll composition(ll f, ll g) { return f + g; }

ll id() { return 0LL; }

int main() {
    ll N;
    cin >> N;
    vector<string> X(N);
    vector<ll> L(N);
    vector<ll> R(N);
    for (ll i = 0; i < N; i++) {
        cin >> X[i] >> L[i] >> R[i];
    }
    ll Q;
    cin >> Q;
    vector<ll> qq(Q);
    vector<string> x(Q);
    vector<ll> t(Q);
    vector<ll> l(Q);
    vector<ll> r(Q);
    for (ll i = 0; i < Q; i++) {
        cin >> qq[i];
        if (qq[i] == 1) {
            cin >> x[i] >> t[i];
        } else if (qq[i] == 2) {
            cin >> t[i];
        } else {
            cin >> x[i] >> l[i] >> r[i];
        }
    }
    map<string, ll> mp;
    for (ll i = 0; i < N; i++) {
        mp[X[i]]++;
    }
    for (ll i = 0; i < Q; i++) {
        if (qq[i] == 1 || qq[i] == 3) {
            mp[x[i]]++;
        }
    }
    ll now_p = 1;
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        itr->second = now_p;
        now_p++;
    }
    map<ll, ll> mpt;
    for (ll i = 0; i < N; i++) {
        mpt[L[i]]++;
        mpt[R[i]]++;
    }
    for (ll i = 0; i < Q; i++) {
        if (qq[i] == 2) {
            mpt[t[i]]++;
        }
        if (qq[i] == 3) {
            mpt[l[i]]++;
            mpt[r[i]]++;
        }
    }
    ll now = 1;
    for (auto itr = mpt.begin(); itr != mpt.end(); itr++) {
        itr->second = now;
        now++;
    }
    lazy_segtree<ll, op, e, ll, mapping, composition, id> seg(now + 2);
    for (ll i = 0; i < N; i++) {
        seg.apply(mpt[L[i]], mpt[R[i]] + 1, 1);
    }
    vector<vector<ll>> all_info(now_p, vector<ll>(0));
    vector<multiset<ll>> ms(now_p);
    for (ll i = 0; i < N; i++) {
        all_info[mp[X[i]]].push_back(L[i]);
        all_info[mp[X[i]]].push_back(R[i]);
        ms[mp[X[i]]].insert(L[i]);
        ms[mp[X[i]]].insert(R[i]);
    }
    for (ll i = 0; i < Q; i++) {
        if (qq[i] == 3) {
            all_info[mp[x[i]]].push_back(l[i]);
            all_info[mp[x[i]]].push_back(r[i]);
        }
    }
    for (ll i = 0; i < now_p; i++) {
        sort(all(all_info[i]));
    }
    // debug(all_info);
    // 処理するパート
    for (ll i = 0; i < Q; i++) {
        if (qq[i] == 1) {
            if (all_info[mp[x[i]]].size() == 0) {
                cout << "No" << endl;
                continue;
            } else if (t[i] >
                       all_info[mp[x[i]]][all_info[mp[x[i]]].size() - 1]) {
                cout << "No" << endl;
                continue;
            }
            auto itr = lower_bound(all(all_info[mp[x[i]]]), t[i]);
            if (*itr == t[i]) {
                if (ms[mp[x[i]]].find(t[i]) != ms[mp[x[i]]].end()) {
                    cout << "Yes" << endl;
                } else {
                    cout << "No" << endl;
                }
            } else {
                ll idx = itr - all_info[mp[x[i]]].begin();
                if (idx % 2 == 0) {
                    cout << "No" << endl;
                } else {
                    if (ms[mp[x[i]]].find(*itr) != ms[mp[x[i]]].end()) {
                        cout << "Yes" << endl;
                    } else {
                        cout << "No" << endl;
                    }
                }
            }
        }
        if (qq[i] == 2) {
            cout << seg.get(mpt[t[i]]) << endl;
        }
        if (qq[i] == 3) {
            ms[mp[x[i]]].insert(l[i]);
            ms[mp[x[i]]].insert(r[i]);
            seg.apply(mpt[l[i]], mpt[r[i]] + 1, 1);
        }
        /*if (qq[i] == 1 || qq[i] == 3) {
            // debug(ms[mp[x[i]]]);
        }*/
    }
}
0