#998314 (C++23) No.674 n連勤

• 問題: No.674 n連勤
• ユーザー: 寝癖
• 提出日時: 2024-07-28 14:08:33
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 93 ms / 2,000 ms
• コード長: 4,372 bytes
• コンパイル時間: 5,567 ms
• コンパイル使用メモリ: 314,224 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-28 14:08:41
• 合計ジャッジ時間: 7,777 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	8 ms; 5,376 KB
testcase_12	AC	9 ms; 5,376 KB
testcase_13	AC	73 ms; 5,376 KB
testcase_14	AC	74 ms; 5,376 KB
testcase_15	AC	71 ms; 5,376 KB
testcase_16	AC	93 ms; 5,376 KB
testcase_17	AC	93 ms; 5,376 KB
testcase_18	AC	82 ms; 5,376 KB
testcase_19	AC	74 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;
namespace neguse {}

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<string> vs;

#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,n-1,-1)
#define rrepi(i,a,b) for(int i=int(a);i>int(b);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep)(__VA_ARGS__)

#define all(x) (x).begin(),(x).end()
#define SORT(x) sort(all(x))
#define REVERSE(x) reverse(all(x))

#define dump(x) cerr << #x << " = " << (x) << endl
#define print(x) cout << (x) << endl
#define yes(f) cout << ((f) ? "Yes" : "No") << endl

#define ge(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define gt(v, x) (int)(upper_bound(all(v), x) - v.begin())
#define le(v, x) (int)(upper_bound(all(v), x) - v.begin())-1
#define lt(v, x) (int)(lower_bound(all(v), x) - v.begin())-1

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

ostream& operator<<(ostream& os, const modint998244353& a) { return os << a.val(); }
ostream& operator<<(ostream& os, const modint1000000007& a) { return os << a.val(); }

template<class T> istream& operator>>(istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) { for (const T& x : vec) os << x << ' '; return os; }


#include <set>
#include <cassert>

namespace neguse {

template<typename T>
class range_set {
    public:
        range_set() {
            S.insert({-inf, -inf});
            S.insert({inf, inf});
        }

        void insert(T l, T r) {
            auto itl = std::prev(S.upper_bound({l, inf}));
            auto itr = std::prev(S.upper_bound({r, inf}));
            if (itl->first <= l && l <= itl->second) l = itl->first;
            else itl++;
            if (itr->first <= r && r <= itr->second) r = itr->second;
            itr++;
            while (itl != itr) {
                cnt -= itl->second - itl->first;
                itl = S.erase(itl);
            }
            S.insert({l, r});
            cnt += r - l;
        }
        void insert(T x) { insert(x, x+1); }

        void erase(T l, T r) {
            auto itl = std::prev(S.upper_bound({l, inf}));
            auto itr = std::prev(S.upper_bound({r, inf}));
            if (itl->first <= l && l < itl->second) {
                if (l != itl->first) {
                    S.insert({itl->first, l});
                    cnt += l - itl->first;
                }
            } else itl++;
            if (itr->first < r && r < itr->second) {
                S.insert({r, itr->second});
                cnt += itr->second - r;
            }
            if (r != itr->first) itr++;
            while (itl != itr) {
                cnt -= itl->second - itl->first;
                itl = S.erase(itl);
            }
        }
        void erase(T x) { erase(x, x+1); }


        T count() { return cnt; }

        std::pair<T, T> get(T x) {
            auto it = S.upper_bound({x, inf});
            it--;
            if (it->first <= x && x < it->second) return *it;
            return {-inf, -inf};
        }

        T mex(T x = 0) {
            auto [l, r] = get(x);
            if (l <= x && x < r) return r;
            return x;
        }

        void debug() {
            cout << "# count: " << cnt << "\n";
            for (auto [l, r] : S) {
                if (l == inf || l == -inf) continue;
                cout << "[" << l << ", " << r << ")" << " ";
            }
            cout << endl;
        }
    private:
        std::set<std::pair<T, T>> S;
        T cnt = 0, inf = std::numeric_limits<T>::max() / 2;
};

}


using namespace neguse;

int main() {
    ll D; int Q;
    cin >> D >> Q;
    range_set<ll> rs;
    ll ans = 0;
    while (Q--) {
        ll A, B;
        cin >> A >> B;
        rs.insert(A, B+1);
        auto [l, r] = rs.get(A);
        ans = max(ans, r-l);
        print(ans);
    }
}