結果

問題 No.2421 entersys?
ユーザー ecottea
提出日時 2023-08-12 14:09:04
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 682 ms / 3,000 ms
コード長 12,371 bytes
コンパイル時間 4,516 ms
コンパイル使用メモリ 265,340 KB
最終ジャッジ日時 2025-02-16 04:17:43
ジャッジサーバーID
(参考情報)
judge4 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 28
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>; using vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
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>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620;
double EPS = 1e-15;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
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
    
template <class T> inline T get(T set, int i) { return (set >> i) & T(1); }
//
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) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
//
/*
* Dynamic_segtree<S, op, e>(ll n) : O(1)
* a[0..n) = e()
* (S, op, e)
*
* set(ll i, S x) : O(log n)
* a[i] = x
*
* apply_left(ll i, S x) : O(log n)
* a[i] = op(x, a[i])
*
* apply_right(ll i, S x) : O(log n)
* a[i] = op(a[i], x)
*
* S get(ll i) : O(log n)
* a[i] e()
*
* S prod(ll l, ll r) : O(log n)
* op( a[l..r) ) e()
*
* S all_prod() : O(1)
* op( a[0..n) )
*
* ll max_right(ll l, function<bool(S)> f) : O(log n)
* f( op( a[l..r) ) ) = true r
* f( e() ) = truef 調
*
* ll min_left(ll r, function<bool(S)> f) : O(log n)
* f( op( a[l..r) ) ) = true l
* f( e() ) = truef 調
*/
template <class S, S(*op)(S, S), S(*e)()>
class Dynamic_segtree {
// : https://lorent-kyopro.hatenablog.com/entry/2021/03/12/025644
struct Node {
ll pos; //
S val; //
S acc; //
Node* l, * r;
Node(ll pos, S val) : pos(pos), val(val), acc(val), l(nullptr), r(nullptr) {}
// acc
void update() {
acc = val;
if (l) acc = op(l->acc, acc);
if (r) acc = op(acc, r->acc);
}
};
const int SET = 0, APL = 1, APR = 2;
ll n;
Node* root;
// t pos val t [il..ir)
void set(Node*& t, ll il, ll ir, ll pos, S val, int q_type) const {
//
if (!t) {
t = new Node(pos, val);
return;
}
// pos val
if (t->pos == pos) {
if (q_type == SET) t->val = val;
else if (q_type = APL) t->val = op(val, t->val);
else t->val = op(t->val, val);
t->update();
return;
}
//
ll im = (il + ir) / 2LL;
// pos
if (pos < im) {
// pos < t->pos
if (pos > t->pos) {
swap(pos, t->pos);
swap(val, t->val);
}
set(t->l, il, im, pos, val, q_type);
}
// pos
else {
// t->pos < pos
if (t->pos > pos) {
swap(pos, t->pos);
swap(val, t->val);
}
set(t->r, im, ir, pos, val, q_type);
}
t->update();
}
S get(Node* t, ll il, ll ir, ll pos) const {
//
if (!t) return e();
// pos val
if (t->pos == pos) return t->val;
//
ll im = (il + ir) / 2LL;
if (pos < im) return get(t->l, il, im, pos);
else return get(t->r, im, ir, pos);
}
S prod(Node* t, ll il, ll ir, ll l, ll r) const {
// [il, ir)
if (!t || ir <= l || r <= il) return e();
// [il, ir) acc
if (l <= il && ir <= r) return t->acc;
//
ll im = (il + ir) / 2;
S res = prod(t->l, il, im, l, r);
if (l <= t->pos && t->pos < r) res = op(res, t->val);
res = op(res, prod(t->r, im, ir, l, r));
return res;
}
ll max_right(Node* t, ll il, ll ir, ll l, const function<bool(S)>& f, S& acc) const {
if (!t || ir <= l) return n;
if (f(op(acc, t->acc))) {
acc = op(acc, t->acc);
return n;
}
ll im = (il + ir) / 2;
ll res = max_right(t->l, il, im, l, f, acc);
if (res != n) return res;
if (l <= t->pos) {
acc = op(acc, t->val);
if (!f(acc)) return t->pos;
}
return max_right(t->r, im, ir, l, f, acc);
}
ll min_left(Node* t, ll il, ll ir, ll r, const function<bool(S)>& f, S& acc) const {
if (!t || r <= il) return 0LL;
if (f(op(t->acc, acc))) {
acc = op(t->acc, acc);
return 0L;
}
ll im = (il + ir) / 2;
ll res = min_left(t->r, im, ir, r, f, acc);
if (res != 0) return res;
if (t->pos < r) {
acc = op(t->val, acc);
if (!f(acc)) return t->pos + 1LL;
}
return min_left(t->l, il, im, r, f, acc);
}
void print(Node* t, ostream& os) const {
if (!t) return;
print(t->l, os);
os << "(" << t->pos << "," << t->val << ") ";
print(t->r, os);
}
public:
// a[0..n) = e()
Dynamic_segtree(ll n) : n(n), root(nullptr) {
// verify : https://www.spoj.com/problems/ADAAPHID/
}
Dynamic_segtree() : n(0LL), root(nullptr) {}
// a[i] = x
void set(ll i, S x) {
// verify : https://www.spoj.com/problems/ADAAPHID/
Assert(0LL <= i && i < n);
set(root, 0LL, n, i, x, SET);
}
// a[i] = op(x, a[i])
void apply_left(ll i, S x) {
Assert(0LL <= i && i < n);
set(root, 0LL, n, i, x, APL);
}
// a[i] = op(a[i], x)
void apply_right(ll i, S x) {
Assert(0LL <= i && i < n);
set(root, 0LL, n, i, x, APR);
}
// a[i]
S get(ll i) const {
// verify : https://www.spoj.com/problems/ADAAPHID/
Assert(0LL <= i && i < n);
return get(root, 0LL, n, i);
}
// op( a[l..r) ) e()
S prod(ll l, ll r) const {
// verify : https://www.spoj.com/problems/ADAAPHID/
chmax(l, 0LL); chmin(r, n);
if (l >= r) return e();
return prod(root, 0LL, n, l, r);
}
// op( a[0..n) )
S all_prod() const {
return root ? root->acc : e();
}
// a[l..r) e()
void reset(ll l, ll r) {
chmax(l, 0LL); chmin(r, n);
if (l >= r) return;
return reset(root, 0LL, n, l, r);
}
// f( op( a[l..r) ) ) = true r
ll max_right(ll l, const function<bool(S)>& f) const {
chmax(l, 0LL);
S acc = e();
assert(f(acc));
return max_r(root, 0LL, n, l, f, acc);
}
// f( op( a[l..r) ) ) = true l
ll min_left(ll r, const function<bool(S)>& f) const {
chmin(r, n);
S acc = e();
assert(f(acc));
return min_l(root, 0LL, n, r, f, acc);
}
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, Dynamic_segtree seg) {
seg.print(seg.root, os);
return os;
}
#endif
};
//
/* verify : https://atcoder.jp/contests/arc035/tasks/arc035_d */
using S001 = ll;
S001 op001(S001 a, S001 b) { return a + b; }
S001 e001() { return 0; }
#define Add_monoid S001, op001, e001
int main() {
input_from_file("input.txt");
// output_to_file("output.txt");
int n;
cin >> n;
map<string, set<pll>> lrs;
Dynamic_segtree<Add_monoid> seg((ll)1e9 + 10);
rep(i, n) {
string x; ll l, r;
cin >> x >> l >> r;
r++;
lrs[x].insert({ l, r });
seg.apply_left(l, 1);
seg.apply_left(r, -1);
}
int q;
cin >> q;
rep(hoge, q) {
int tp;
cin >> tp;
if (tp == 1) {
string x; ll t;
cin >> x >> t;
auto it = lrs[x].upper_bound(make_pair(t, INFL));
if (it == lrs[x].begin()) {
cout << "No" << endl;
continue;
}
Yes(prev(it)->second > t);
}
else if (tp == 2) {
ll t;
cin >> t;
cout << seg.prod(0, t + 1) << endl;
}
else {
string x; ll l, r;
cin >> x >> l >> r;
r++;
lrs[x].insert({ l, r });
seg.apply_left(l, 1);
seg.apply_left(r, -1);
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0