結果

問題 No.2667 Constrained Permutation
ユーザー hitonanodehitonanode
提出日時 2024-03-08 21:39:49
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 440 ms / 2,000 ms
コード長 9,045 bytes
コンパイル時間 2,276 ms
コンパイル使用メモリ 197,308 KB
実行使用メモリ 16,328 KB
最終ジャッジ日時 2024-09-29 19:06:10
合計ジャッジ時間 8,369 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 3 ms
5,248 KB
testcase_05 AC 3 ms
5,248 KB
testcase_06 AC 3 ms
5,248 KB
testcase_07 AC 2 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 3 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 3 ms
5,248 KB
testcase_12 AC 95 ms
7,040 KB
testcase_13 AC 4 ms
5,248 KB
testcase_14 AC 239 ms
14,240 KB
testcase_15 AC 102 ms
13,056 KB
testcase_16 AC 93 ms
9,984 KB
testcase_17 AC 25 ms
5,376 KB
testcase_18 AC 256 ms
15,048 KB
testcase_19 AC 440 ms
15,696 KB
testcase_20 AC 412 ms
15,496 KB
testcase_21 AC 148 ms
15,884 KB
testcase_22 AC 175 ms
15,724 KB
testcase_23 AC 185 ms
15,744 KB
testcase_24 AC 95 ms
9,116 KB
testcase_25 AC 185 ms
13,228 KB
testcase_26 AC 224 ms
15,572 KB
testcase_27 AC 206 ms
14,572 KB
testcase_28 AC 49 ms
8,996 KB
testcase_29 AC 50 ms
8,576 KB
testcase_30 AC 57 ms
9,312 KB
testcase_31 AC 33 ms
7,040 KB
testcase_32 AC 8 ms
5,248 KB
testcase_33 AC 102 ms
15,232 KB
testcase_34 AC 56 ms
9,856 KB
testcase_35 AC 68 ms
10,880 KB
testcase_36 AC 63 ms
10,496 KB
testcase_37 AC 68 ms
11,496 KB
testcase_38 AC 203 ms
11,968 KB
testcase_39 AC 4 ms
5,248 KB
testcase_40 AC 57 ms
9,236 KB
testcase_41 AC 91 ms
13,020 KB
testcase_42 AC 119 ms
12,440 KB
testcase_43 AC 203 ms
16,328 KB
testcase_44 AC 168 ms
8,832 KB
testcase_45 AC 5 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif

constexpr lint inf = 1LL << 40;
int main() {
    int N;
    cin >> N;
    vector<plint> LR(N);
    for (auto &[l, r] : LR) {
        cin >> l >> r;
        l += 1000000;
        r += 1000000;
    }
    sort(ALL(LR));
    dbg(LR);
    lint all_l_max = -inf, all_r_min = inf;
    for (auto [l, r] : LR) {
        chmax(all_l_max, l);
        chmin(all_r_min, r);
    }
    // 先頭は [all_l_max - (n - 1), all_r_min]

    auto find_feasible = [&]() -> lint {
        if (all_l_max - (N - 1) > all_r_min) return 0;

        if (all_l_max + N - 1 <= all_r_min) return all_l_max;

        const lint L = all_l_max - (N - 1);
        const lint R = all_r_min + (N - 1);

        vector<vector<int>> dp(R - L + 1);
        for (auto [l, r] : LR) {
            lint left = max(l, L) - L, right = min(r, R) - L;
            dp.at(left).push_back(right);
        }
        vector<int> L2Rs(dp.size(), -1);
        priority_queue<int, vector<int>, greater<int>> pq;
        int last_pop = -1;
        REP(i, dp.size()) {
            for (auto r : dp.at(i)) pq.push(r);
            if (pq.size()) {
                L2Rs.at(i) = pq.top();
                pq.pop();
                last_pop = i;
            }
        }
        dbg(make_tuple(L, R));
        dbg(L2Rs);

        return L + last_pop - (N - 1);
    };

    auto check = [&](lint mid) -> bool {
        // [mid, mid + 1, ..., mid + N - 1]
        vector<vector<int>> dp(N);

        for (auto [l, r] : LR) {
            lint left = max(l, mid) - mid, right = min(r, mid + N - 1) - mid;
            if (left <= right) dp.at(left).push_back(right);
        }
        dbg(mid);
        dbg(dp);

        priority_queue<int, vector<int>, greater<int>> pq;
        REP(i, N) {
            for (auto r : dp.at(i)) pq.push(r);
            while (pq.size() and pq.top() < i) pq.pop();
            if (pq.empty()) return false;
            pq.pop();
        }

        return true;
    };

    auto binsearch = [&](lint ok, lint ng) -> lint {
        while (abs(ok - ng) > 1) {
            const lint mid = (ok + ng) / 2;
            (check(mid) ? ok : ng) = mid;
        }
        return ok;
    };

    const lint feasible = find_feasible();
    dbg(feasible);
    dbg(check(feasible));

    if (!check(feasible)) {
        puts("0");
        exit(0);
    }

    lint lo = binsearch(feasible, all_l_max - N);
    lint hi = binsearch(feasible, all_r_min + 1);

    cout << abs(hi - lo) + 1 << '\n';
}
0