結果

問題 No.2667 Constrained Permutation
ユーザー cureskolcureskol
提出日時 2024-02-17 15:27:16
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,440 ms / 2,000 ms
コード長 8,038 bytes
コンパイル時間 2,498 ms
コンパイル使用メモリ 224,632 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-09-28 23:43:06
合計ジャッジ時間 16,225 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 2 ms
6,816 KB
testcase_03 AC 2 ms
6,816 KB
testcase_04 AC 3 ms
6,816 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 2 ms
6,816 KB
testcase_09 AC 3 ms
6,816 KB
testcase_10 AC 2 ms
6,816 KB
testcase_11 AC 2 ms
6,816 KB
testcase_12 AC 284 ms
6,820 KB
testcase_13 AC 9 ms
6,816 KB
testcase_14 AC 955 ms
6,816 KB
testcase_15 AC 87 ms
6,820 KB
testcase_16 AC 59 ms
6,820 KB
testcase_17 AC 22 ms
6,820 KB
testcase_18 AC 1,090 ms
6,816 KB
testcase_19 AC 662 ms
6,816 KB
testcase_20 AC 858 ms
6,816 KB
testcase_21 AC 101 ms
6,820 KB
testcase_22 AC 110 ms
6,816 KB
testcase_23 AC 106 ms
6,816 KB
testcase_24 AC 578 ms
6,816 KB
testcase_25 AC 1,093 ms
6,816 KB
testcase_26 AC 1,412 ms
6,816 KB
testcase_27 AC 1,440 ms
6,820 KB
testcase_28 AC 45 ms
6,816 KB
testcase_29 AC 43 ms
6,816 KB
testcase_30 AC 47 ms
6,820 KB
testcase_31 AC 30 ms
6,820 KB
testcase_32 AC 8 ms
6,820 KB
testcase_33 AC 80 ms
6,820 KB
testcase_34 AC 45 ms
6,820 KB
testcase_35 AC 51 ms
6,820 KB
testcase_36 AC 52 ms
6,816 KB
testcase_37 AC 47 ms
6,816 KB
testcase_38 AC 81 ms
6,816 KB
testcase_39 AC 3 ms
6,816 KB
testcase_40 AC 38 ms
6,816 KB
testcase_41 AC 70 ms
6,816 KB
testcase_42 AC 176 ms
6,820 KB
testcase_43 AC 298 ms
6,820 KB
testcase_44 AC 362 ms
6,820 KB
testcase_45 AC 11 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma region template
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using pi = pair<int, int>;
using pll = pair<ll, ll>;

#define overload2(a, b, c, ...) c
#define overload3(a, b, c, d, ...) d
#define overload4(a, b, c, d, e, ...) e
#define overload5(a, b, c, d, e, f, ...) f

#define TYPE1(T) template <typename T>
#define TYPE2(T, U) template <typename T, typename U>
#define TYPE(...) overload2(__VA_ARGS__, TYPE2, TYPE1)(__VA_ARGS__)
#define TYPES1(T) template <typename... T>
#define TYPES2(H, T) template <typename H, typename... T>
#define TYPES(...) overload2(__VA_ARGS__, TYPES2, TYPES1)(__VA_ARGS__)

#define REP4(i, s, n, d) for (int i = (s); i < (n); i += (d))
#define REP3(i, s, n) REP4(i, s, n, 1)
#define REP2(i, n) REP3(i, 0, n)
#define REP1(n) REP2(tomato, n)
#define REP(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)

#define RREP4(i, n, s, d) for (int i = (n)-1; i >= (s); i -= (d))
#define RREP3(i, n, s) RREP4(i, n, s, 1)
#define RREP2(i, n) RREP3(i, n, 0)
#define RREP1(n) RREP2(tomato, n)
#define RREP(...)                                                              \
  overload4(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)

#define FOR4(a, b, c, d, v) for (auto [a, b, c, d] : v)
#define FOR3(a, b, c, v) for (auto [a, b, c] : v)
#define FOR2(a, b, v) for (auto [a, b] : v)
#define FOR1(a, v) for (auto a : v)
#define FOR(...) overload5(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)

#define AFOR4(a, b, c, d, v) for (auto &[a, b, c, d] : v)
#define AFOR3(a, b, c, v) for (auto &[a, b, c] : v)
#define AFOR2(a, b, v) for (auto &[a, b] : v)
#define AFOR1(a, v) for (auto &a : v)
#define AFOR(...)                                                              \
  overload5(__VA_ARGS__, AFOR4, AFOR3, AFOR2, AFOR1)(__VA_ARGS__)

#define CFOR4(a, b, c, d, v) for (const auto &[a, b, c, d] : v)
#define CFOR3(a, b, c, v) for (const auto &[a, b, c] : v)
#define CFOR2(a, b, v) for (const auto &[a, b] : v)
#define CFOR1(a, v) for (const auto &a : v)
#define CFOR(...)                                                              \
  overload5(__VA_ARGS__, CFOR4, CFOR3, CFOR2, CFOR1)(__VA_ARGS__)

#define PFOR(v)                                                                \
  for (bool f = true; (f ? exchange(f, false) : next_permutation(ALL(v)));)

#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define REVERSE(v) reverse(ALL(v))
#define UNIQUE(v) SORT(v), v.erase(unique(ALL(v)), v.end())
#define SZ(v) int(v.size())
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
template <typename T>
conditional_t<is_same_v<T, int>, ll, T> SUM(const vector<T> &v) {
  return accumulate(ALL(v), conditional_t<is_same_v<T, int>, ll, T>(0));
}

TYPES(T) void input(T &...a) { (cin >> ... >> a); }
#define DECLARE(T, ...)                                                        \
  T __VA_ARGS__;                                                               \
  input(__VA_ARGS__);
#define INT(...) DECLARE(int, __VA_ARGS__)
#define STR(...) DECLARE(string, __VA_ARGS__)
#define LL(...) DECLARE(long long, __VA_ARGS__)
#define CHR(...) DECLARE(char, __VA_ARGS__)
#define DBL(...) DECLARE(double, __VA_ARGS__)
#define VI(n, v)                                                               \
  vi v(n);                                                                     \
  cin >> v;
#define VLL(n, v)                                                              \
  vll v(n);                                                                    \
  cin >> v;
#define VS(n, s)                                                               \
  vector<string> s(n);                                                         \
  cin >> s;

TYPE(T) istream &operator>>(istream &is, vector<T> &v) {
  for (auto &a : v)
    cin >> a;
  return is;
}
TYPE(T) ostream &operator<<(ostream &os, const vector<T> &v) {
  if (&os == &cerr)
    os << "[";
  REP (i, v.size()) {
    os << v[i];
    if (i + 1 < v.size())
      os << (&os == &cerr ? "," : " ");
  }
  if (&os == &cerr)
    os << "]";
  return os;
}
TYPE(T, S) istream &operator>>(istream &is, pair<T, S> &p) {
  cin >> p.first >> p.second;
  return is;
}

#ifdef __DEBUG
#include <debug>
#else
#define debug(...) void(0)
#endif

void print() { cout << '\n'; }
TYPES(T, Ts) void print(const T &a, const Ts &...b) {
  cout << a;
  (cout << ... << (cout << ' ', b));
  cout << '\n';
}

TYPE(T) using pq = priority_queue<T>;
TYPE(T) using pqg = priority_queue<T, vector<T>, greater<T>>;
TYPE(T) T pick(queue<T> &que) {
  assert(que.size());
  T a = que.front();
  que.pop();
  return a;
}
TYPE(T) T pick(pq<T> &que) {
  assert(que.size());
  T a = que.top();
  que.pop();
  return a;
}
TYPE(T) T pick(pqg<T> &que) {
  assert(que.size());
  T a = que.top();
  que.pop();
  return a;
}
TYPE(T) T pick(stack<T> &sta) {
  assert(sta.size());
  T a = sta.top();
  sta.pop();
  return a;
}
TYPE(T) void clear(T &v) { v = decltype(v)(); }

string YES(bool f = true) { return (f ? "YES" : "NO"); }
string Yes(bool f = true) { return (f ? "Yes" : "No"); }
string yes(bool f = true) { return (f ? "yes" : "no"); }

constexpr int INF = 1e9 + 7;
constexpr ll LINF = ll(1e18) + 7;
constexpr ld EPS = 1e-10;

vi iota(int n) {
  vi a(n);
  iota(ALL(a), 0);
  return a;
}
TYPE(T) vector<pair<T, int>> query_sort(const vector<T> &v) {
  vector<pair<T, int>> res(v.size());
  REP (i, v.size())
    res[i] = {v[i], i};
  SORT(res);
  return res;
}
TYPE(T) void add(vector<T> &v, T a = 1) {
  AFOR (p, v)
    p += a;
}
TYPE(T) T rev(T a) {
  REVERSE(a);
  return a;
}
TYPE(T) void fin(T a) {
  cout << a << '\n';
  exit(0);
}
TYPE(T) bool chmax(T &a, T b) { return (a < b && (a = b, true)); }
TYPE(T) bool chmin(T &a, T b) { return (a > b && (a = b, true)); }
TYPES(T, Ns) auto make_vector(T x, int n, Ns... ns) {
  if constexpr (sizeof...(ns) == 0)
    return vector<T>(n, x);
  else
    return vector(n, make_vector<T>(x, ns...));
}
bool in(const ll S, const int a) { return (S >> a) & 1; }
int popcount(const ll S) { return __builtin_popcountll(S); }
int digit(char c) { return (c >= '0' and c <= '9' ? c - '0' : -1); }
ll sqrtll(ll a) {
  for (ll b = sqrt(a); b * b <= a; b++)
    if (b * b == a)
      return b;
  for (ll b = sqrt(a); b >= 0 and b * b >= a; b--)
    if (b * b == a)
      return b;
  return -1;
}
#pragma endregion template

bool can(const std::vector<pi> &lr, int k) {
  int n = lr.size();
  int now = 0;
  pqg<int> que;
  for (int i = 1; i <= n; i++) {
    while (now < n and lr[now].first - k <= i) {
      que.push(lr[now].second - k);
      now++;
    }
    if (!que.size() || que.top() < i)
      return false;
    que.pop();
  }
  return true;
}

std::optional<int> solve(const std::vector<pi> &lr) {
  int n = lr.size();
  int l = -INF, r = INF;
  while (r - l > 1) {
    int m = (l + r) >> 1;
    if (can(lr, m))
      return m;

    int now = 0;
    pqg<int> que;
    for (int i = 1; i <= n; i++) {
      while (now < n and lr[now].first - m <= i) {
        que.push(lr[now].second - m);
        now++;
      }
      if (!que.size()) {
        // m が小さい
        l = m;
        i = INF;
      } else if (que.top() < i) {
        // m が大きい
        r = m;
        i = INF;
      } else
        que.pop();
    }
  }
  return nullopt;
}

template <class F>
long long binary_search_ll(long long ok, long long ng, const F &is_ok) {
  while (abs(ok - ng) > 1) {
    long long mid = (ok + ng) >> 1;
    (is_ok(mid) ? ok : ng) = mid;
  }
  return ok;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  INT(n);
  vector<pi> lr(n);
  AFOR (l, r, lr)
    cin >> l >> r;
  SORT(lr);

  auto k_ = solve(lr);
  if (!k_)
    fin(0);

  int k = k_.value();
  auto is_ok = [&](int x) { return can(lr, x); };

  fin(binary_search_ll(k, INF, is_ok) - binary_search_ll(k, -INF, is_ok) + 1);
}
0