結果
問題 | No.3094 Stapler |
ユーザー |
![]() |
提出日時 | 2025-04-06 16:14:31 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 328 ms / 2,000 ms |
コード長 | 14,704 bytes |
コンパイル時間 | 2,562 ms |
コンパイル使用メモリ | 228,044 KB |
実行使用メモリ | 31,676 KB |
最終ジャッジ日時 | 2025-06-20 02:30:41 |
合計ジャッジ時間 | 11,175 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 72 |
ソースコード
#line 1 "library/Template/template.hpp" #include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--) #define ALL(v) (v).begin(), (v).end() #define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end()) #define SZ(v) (int)v.size() #define MIN(v) *min_element(ALL(v)) #define MAX(v) *max_element(ALL(v)) #define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin()) #define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin()) using uint = unsigned int; using ll = long long int; using ull = unsigned long long; using i128 = __int128_t; using u128 = __uint128_t; const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; template <typename T, typename S = T> S SUM(const vector<T> &a) { return accumulate(ALL(a), S(0)); } template <typename S, typename T = S> S POW(S a, T b) { S ret = 1, base = a; while (b) { if (b & 1) ret *= base; base *= base; b >>= 1; } return ret; } template <typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; } template <typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return 1; } return 0; } template <typename T, typename U> T ceil(T x, U y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x > 0 ? (x + y - 1) / y : x / y); } template <typename T, typename U> T floor(T x, U y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x > 0 ? x / y : (x - y + 1) / y); } template <typename T> int popcnt(T x) { return __builtin_popcountll(x); } template <typename T> int topbit(T x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } template <typename T> int lowbit(T x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << "P(" << p.first << ", " << p.second << ")"; return os; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << "{"; for (int i = 0; i < vec.size(); i++) { os << vec[i] << (i + 1 == vec.size() ? "" : ", "); } os << "}"; return os; } template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) { os << "{"; for (auto itr = map_var.begin(); itr != map_var.end(); itr++) { os << "(" << itr->first << ", " << itr->second << ")"; itr++; if (itr != map_var.end()) os << ", "; itr--; } os << "}"; return os; } template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { os << "{"; for (auto itr = set_var.begin(); itr != set_var.end(); itr++) { os << *itr; ++itr; if (itr != set_var.end()) os << ", "; itr--; } os << "}"; return os; } #ifdef LOCAL #define debug 1 #define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__) #else #define debug 0 #define show(...) true #endif template <typename T> void _show(int i, T name) { cerr << '\n'; } template <typename T1, typename T2, typename... T3> void _show(int i, const T1 &a, const T2 &b, const T3 &...c) { for (; a[i] != ',' && a[i] != '\0'; i++) cerr << a[i]; cerr << ":" << b << " "; _show(i + 1, a, c...); } #line 2 "library/Utility/fastio.hpp" #include <unistd.h> namespace fastio { static constexpr uint32_t SZ = 1 << 17; char ibuf[SZ]; char obuf[SZ]; char out[100]; // pointer of ibuf, obuf uint32_t pil = 0, pir = 0, por = 0; struct Pre { char num[10000][4]; constexpr Pre() : num() { for (int i = 0; i < 10000; i++) { int n = i; for (int j = 3; j >= 0; j--) { num[i][j] = n % 10 | '0'; n /= 10; } } } } constexpr pre; inline void load() { memmove(ibuf, ibuf + pil, pir - pil); pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin); pil = 0; if (pir < SZ) ibuf[pir++] = '\n'; } inline void flush() { fwrite(obuf, 1, por, stdout); por = 0; } void rd(char &c) { do { if (pil + 1 > pir) load(); c = ibuf[pil++]; } while (isspace(c)); } void rd(string &x) { x.clear(); char c; do { if (pil + 1 > pir) load(); c = ibuf[pil++]; } while (isspace(c)); do { x += c; if (pil == pir) load(); c = ibuf[pil++]; } while (!isspace(c)); } template <typename T> void rd_real(T &x) { string s; rd(s); x = stod(s); } template <typename T> void rd_integer(T &x) { if (pil + 100 > pir) load(); char c; do c = ibuf[pil++]; while (c < '-'); bool minus = 0; if constexpr (is_signed<T>::value || is_same_v<T, i128>) { if (c == '-') { minus = 1, c = ibuf[pil++]; } } x = 0; while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; } if constexpr (is_signed<T>::value || is_same_v<T, i128>) { if (minus) x = -x; } } void rd(int &x) { rd_integer(x); } void rd(ll &x) { rd_integer(x); } void rd(i128 &x) { rd_integer(x); } void rd(uint &x) { rd_integer(x); } void rd(ull &x) { rd_integer(x); } void rd(u128 &x) { rd_integer(x); } void rd(double &x) { rd_real(x); } void rd(long double &x) { rd_real(x); } template <class T, class U> void rd(pair<T, U> &p) { return rd(p.first), rd(p.second); } template <size_t N = 0, typename T> void rd_tuple(T &t) { if constexpr (N < std::tuple_size<T>::value) { auto &x = std::get<N>(t); rd(x); rd_tuple<N + 1>(t); } } template <class... T> void rd(tuple<T...> &tpl) { rd_tuple(tpl); } template <size_t N = 0, typename T> void rd(array<T, N> &x) { for (auto &d : x) rd(d); } template <class T> void rd(vector<T> &x) { for (auto &d : x) rd(d); } void read() {} template <class H, class... T> void read(H &h, T &...t) { rd(h), read(t...); } void wt(const char c) { if (por == SZ) flush(); obuf[por++] = c; } void wt(const string s) { for (char c : s) wt(c); } void wt(const char *s) { size_t len = strlen(s); for (size_t i = 0; i < len; i++) wt(s[i]); } template <typename T> void wt_integer(T x) { if (por > SZ - 100) flush(); if (x < 0) { obuf[por++] = '-', x = -x; } int outi; for (outi = 96; x >= 10000; outi -= 4) { memcpy(out + outi, pre.num[x % 10000], 4); x /= 10000; } if (x >= 1000) { memcpy(obuf + por, pre.num[x], 4); por += 4; } else if (x >= 100) { memcpy(obuf + por, pre.num[x] + 1, 3); por += 3; } else if (x >= 10) { int q = (x * 103) >> 10; obuf[por] = q | '0'; obuf[por + 1] = (x - q * 10) | '0'; por += 2; } else obuf[por++] = x | '0'; memcpy(obuf + por, out + outi + 4, 96 - outi); por += 96 - outi; } template <typename T> void wt_real(T x) { ostringstream oss; oss << fixed << setprecision(15) << double(x); string s = oss.str(); wt(s); } void wt(int x) { wt_integer(x); } void wt(ll x) { wt_integer(x); } void wt(i128 x) { wt_integer(x); } void wt(uint x) { wt_integer(x); } void wt(ull x) { wt_integer(x); } void wt(u128 x) { wt_integer(x); } void wt(double x) { wt_real(x); } void wt(long double x) { wt_real(x); } template <class T, class U> void wt(const pair<T, U> val) { wt(val.first); wt(' '); wt(val.second); } template <size_t N = 0, typename T> void wt_tuple(const T t) { if constexpr (N < std::tuple_size<T>::value) { if constexpr (N > 0) { wt(' '); } const auto x = std::get<N>(t); wt(x); wt_tuple<N + 1>(t); } } template <class... T> void wt(tuple<T...> tpl) { wt_tuple(tpl); } template <class T, size_t S> void wt(const array<T, S> val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) wt(' '); wt(val[i]); } } template <class T> void wt(const vector<T> val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) wt(' '); wt(val[i]); } } void print() { wt('\n'); } template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) { wt(head); if (sizeof...(Tail)) wt(' '); print(forward<Tail>(tail)...); } void __attribute__((destructor)) _d() { flush(); } } // namespace fastio using fastio::flush; using fastio::print; using fastio::read; inline void first(bool i = true) { print(i ? "first" : "second"); } inline void Alice(bool i = true) { print(i ? "Alice" : "Bob"); } inline void Takahashi(bool i = true) { print(i ? "Takahashi" : "Aoki"); } inline void yes(bool i = true) { print(i ? "yes" : "no"); } inline void Yes(bool i = true) { print(i ? "Yes" : "No"); } inline void No() { print("No"); } inline void YES(bool i = true) { print(i ? "YES" : "NO"); } inline void NO() { print("NO"); } inline void Yay(bool i = true) { print(i ? "Yay!" : ":("); } inline void Possible(bool i = true) { print(i ? "Possible" : "Impossible"); } inline void POSSIBLE(bool i = true) { print(i ? "POSSIBLE" : "IMPOSSIBLE"); } /** * @brief Fast IO */ #line 3 "sol.cpp" #line 2 "library/DataStructure/lazysegtree.hpp" template <typename M, typename N, M (*f)(M, M), M (*g)(M, N), N (*h)(N, N), M (*m1)(), N (*n1)()> class LazySegmentTree { int n, sz, height; vector<M> data; vector<N> lazy; void update(int k) { data[k] = f(data[k * 2], data[k * 2 + 1]); } void apply(int k, N x) { data[k] = g(data[k], x); if (k < sz) lazy[k] = h(lazy[k], x); } void down(int k) { apply(k * 2, lazy[k]); apply(k * 2 + 1, lazy[k]); lazy[k] = n1(); } public: LazySegmentTree(int n = 0) : LazySegmentTree(vector<M>(n, m1())) {} LazySegmentTree(const vector<M> &a) : n(SZ(a)) { sz = 1, height = 0; while (sz < (int)a.size()) sz <<= 1, height++; data.assign(2 * sz, m1()); lazy.assign(sz, n1()); rep(i, 0, a.size()) data[sz + i] = a[i]; for (int i = sz - 1; i; i--) update(i); } M operator[](int k) const { k += sz; rrep(i, 1, height + 1) down(k >> i); return data[k]; } vector<M> get() { rep(k, 1, sz) down(k); return {data.begin() + sz, data.begin() + sz + n}; } void set(int k, M x) { k += sz; for (int i = height; i; i--) down(k >> i); data[k] = x; for (int i = 1; i <= height; i++) update(k >> i); } void update(int L, int R, N x) { if (L >= R) return; L += sz, R += sz; for (int i = height; i; i--) { if (((L >> i) << i) != L) down(L >> i); if (((R >> i) << i) != R) down((R - 1) >> i); } int lb = L, rb = R; while (L < R) { if (L & 1) apply(L++, x); if (R & 1) apply(--R, x); L >>= 1; R >>= 1; } L = lb, R = rb; for (int i = 1; i <= height; i++) { if (((L >> i) << i) != L) update(L >> i); if (((R >> i) << i) != R) update((R - 1) >> i); } } M query(int L, int R) { if (L >= R) return m1(); L += sz, R += sz; for (int i = height; i; i--) { if (((L >> i) << i) != L) down(L >> i); if (((R >> i) << i) != R) down((R - 1) >> i); } M lb = m1(), rb = m1(); while (L < R) { if (L & 1) lb = f(lb, data[L++]); if (R & 1) rb = f(data[--R], rb); L >>= 1; R >>= 1; } return f(lb, rb); } template <class F> int max_right(int L, F ch) { if (L == n) return n; L += sz; rrep(i, 1, height + 1) down(L >> i); M sum = m1(); do { while (L % 2 == 0) L >>= 1; if (!ch(f(sum, data[L]))) { while (L < sz) { down(L); L <<= 1; if (ch(f(sum, data[L]))) sum = f(sum, data[L++]); } return L - sz; } sum = f(sum, data[L++]); } while ((L & -L) != L); return n; } template <class F> int min_left(int R, F ch) { if (R == 0) return 0; R += sz; rrep(i, 1, height + 1) down((R - 1) >> i); M sum = m1(); do { R--; while (R > 1 and (R & 1)) R >>= 1; if (!ch(f(data[R], sum))) { while (R < sz) { down(R); R = (R * 2 + 1); if (ch(f(data[R], sum))) { sum = f(data[R--], sum); } } return R + 1 - sz; } sum = f(data[R], sum); } while ((R & -R) != R); return 0; } }; /** * @brief Lazy Segment Tree */ #line 5 "sol.cpp" using P = pair<int, int>; P f(P a, P b) { if (a.first == b.first) return {a.first, a.second + b.second}; return min(a, b); } P g(P a, int b) { return {a.first + b, a.second}; } int h(int a, int b) { return a + b; } P e() { return {inf, 0}; } int e2() { return 0; } int main() { int n, Q; read(n, Q); LazySegmentTree<P, int, f, g, h, e, e2> seg(n); rep(i, 0, n) seg.set(i, {0, 1}); vector<pair<int, int>> que(Q); rep(i, 0, Q) { int ty; read(ty); if (ty == 1) { int L, R; read(L, R); L--; R--; que[i] = {L, R}; seg.update(L, R, 1); } else if (ty == 2) { int j; read(j); j--; auto [L, R] = que[j]; seg.update(L, R, -1); } else { show(seg.query(0, n).first); auto [mi, ret] = seg.query(0, n); if (seg.query(n - 1, n).first > 0) ret++; print(mi == 0 ? ret : 1); } } return 0; }