結果
問題 | No.2421 entersys? |
ユーザー |
![]() |
提出日時 | 2023-08-12 14:49:53 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 541 ms / 3,000 ms |
コード長 | 7,933 bytes |
コンパイル時間 | 4,729 ms |
コンパイル使用メモリ | 218,216 KB |
最終ジャッジ日時 | 2025-02-16 05:21:47 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 28 |
ソースコード
#include <algorithm>#include <bitset>#include <cassert>#include <cmath>#include <complex>#include <cstdio>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <iterator>#include <map>#include <numeric>#include <queue>#include <random>#include <set>#include <sstream>#include <stack>#include <unordered_set>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>#endif#define GET_MACRO(_1, _2, _3, NAME, ...) NAME#define _rep(i, n) _rep2(i, 0, n)#define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#define UNIQUE(x) \std::sort((x).begin(), (x).end()); \(x).erase(std::unique((x).begin(), (x).end()), (x).end())using i64 = long long;template <class T, class U>bool chmin(T& a, const U& b) {return (b < a) ? (a = b, true) : false;}template <class T, class U>bool chmax(T& a, const U& b) {return (b > a) ? (a = b, true) : false;}inline void YesNo(bool f = 0, string yes = "Yes", string no = "No") {std::cout << (f ? yes : no) << "\n";}namespace io {template <typename T>istream& operator>>(istream& i, vector<T>& v) {rep(j, v.size()) i >> v[j];return i;}template <typename T>string join(vector<T>& v) {stringstream s;rep(i, v.size()) s << ' ' << v[i];return s.str().substr(1);}template <typename T>ostream& operator<<(ostream& o, vector<T>& v) {if (v.size()) o << join(v);return o;}template <typename T>string join(vector<vector<T>>& vv) {string s = "\n";rep(i, vv.size()) s += join(vv[i]) + "\n";return s;}template <typename T>ostream& operator<<(ostream& o, vector<vector<T>>& vv) {if (vv.size()) o << join(vv);return o;}template <class T, class U>istream& operator>>(istream& i, pair<T, U>& p) {i >> p.first >> p.second;return i;}template <class T, class U>ostream& operator<<(ostream& o, pair<T, U>& p) {o << p.first << " " << p.second;return o;}void print() { cout << "\n"; }template <class Head, class... Tail>void print(Head&& head, Tail&&... tail) {cout << head;if (sizeof...(tail)) cout << ' ';print(std::forward<Tail>(tail)...);}void in() {}template <class Head, class... Tail>void in(Head&& head, Tail&&... tail) {cin >> head;in(std::forward<Tail>(tail)...);}} // namespace iousing namespace io;namespace useful {long long modpow(long long a, long long b, long long mod) {long long res = 1;while (b) {if (b & 1) res *= a, res %= mod;a *= a;a %= mod;b >>= 1;}return res;}bool is_pow2(long long x) { return x > 0 && (x & (x - 1)) == 0; }template <class T>void rearrange(vector<T>& a, vector<int>& p) {vector<T> b = a;for (int i = 0; i < int(a.size()); i++) {a[i] = b[p[i]];}return;}template <class T>vector<pair<int, int>> rle_sequence(T& a) {vector<pair<int, int>> res;int n = a.size();if (n == 1) return vector<pair<int, int>>{{a[0], 1}};int l = 1;rep(i, n - 1) {if (a[i] == a[i + 1])l++;else {res.emplace_back(a[i], l);l = 1;}}res.emplace_back(a.back(), l);return res;}vector<pair<char, int>> rle_string(string a) {vector<pair<char, int>> res;int n = a.size();if (n == 1) return vector<pair<char, int>>{{a[0], 1}};int l = 1;rep(i, n - 1) {if (a[i] == a[i + 1])l++;else {res.emplace_back(a[i], l);l = 1;}}res.emplace_back(a.back(), l);return res;}vector<int> linear_sieve(int n) {vector<int> primes;vector<int> res(n + 1);iota(all(res), 0);for (int i = 2; i <= n; i++) {if (res[i] == i) primes.emplace_back(i);for (auto j : primes) {if (j * i > n) break;res[j * i] = j;}}return res;// return primes;}template <class T>vector<long long> dijkstra(vector<vector<pair<int, T>>>& graph, int start) {int n = graph.size();vector<long long> res(n, 2e18);res[start] = 0;priority_queue<pair<long long, int>, vector<pair<long long, int>>,greater<pair<long long, int>>>que;que.push({0, start});while (!que.empty()) {auto [c, v] = que.top();que.pop();if (res[v] < c) continue;for (auto [nxt, cost] : graph[v]) {auto x = c + cost;if (x < res[nxt]) {res[nxt] = x;que.push({x, nxt});}}}return res;}} // namespace usefulusing namespace useful;template <class T>vector<T> div(T x) {vector<T> res;for (T i = 1; i * i <= x; i++) {if (x % i == 0) {res.push_back(i);if (i * i == x) break;res.push_back(x / i);}}sort(all(res));return res;}int op(int a, int b) { return max(a, b); }int e() { return 0; }int mapping(int a, int b) { return a + b; }int composition(int a, int b) { return a + b; }int id() { return 0; }struct query {int query_type;int x, t, l, r;string name;};struct student {string name;int l, r;student(string x, int _l, int _r) : name(x), l(_l), r(_r) {}};vector<int> tmp;vector<string> names;int to_int(string x) { return lower_bound(all(names), x) - names.begin(); }int inf = 2e9;int idx(int x) { return lower_bound(all(tmp), x) - tmp.begin(); }int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int n;in(n);vector<student> students;rep(i, n) {string x;int l, r;in(x, l, r);l--, r--;names.emplace_back(x);tmp.push_back(l);tmp.push_back(r);students.emplace_back(x, l, r);}int q;in(q);vector<query> v(q);rep(i, q) {int u;in(u);if (u == 1) {string x;int t;in(x, t);t--;tmp.push_back(t);names.push_back(x);v[i].query_type = 1;v[i].name = x;v[i].t = t;}if (u == 2) {int t;in(t);t--;tmp.push_back(t);v[i].query_type = 2;v[i].t = t;}if (u == 3) {string x;int l, r;in(x, l, r);l--, r--;tmp.push_back(l);tmp.push_back(r);names.emplace_back(x);v[i].query_type = 3;v[i].name = x;v[i].l = l;v[i].r = r;}}UNIQUE(tmp);UNIQUE(names);vector<set<pair<int, int>>> st(names.size());atcoder::lazy_segtree<int, op, e, int, mapping, composition, id> seg(tmp.size());for (auto& stu : students) {st[to_int(stu.name)].emplace(stu.l, stu.r);seg.apply(idx(stu.l), idx(stu.r) + 1, 1);}for (auto& d : v) {if (d.query_type == 1) {int x = to_int(d.name), t = d.t;auto& w = st[x];auto rr = w.upper_bound(pair{t, inf});if (rr == w.begin()) {print("No");} else {rr--;auto [l, r] = *rr;YesNo(l <= t && t <= r);}}if (d.query_type == 2) {int t = d.t;print(seg.get(idx(t)));}if (d.query_type == 3) {int x = to_int(d.name);int l = d.l, r = d.r;st[x].emplace(l, r);seg.apply(idx(l), idx(r) + 1, 1);}}}