結果
| 問題 | No.2543 Many Meetings |
| ユーザー |
 ZrjaK
|
| 提出日時 | 2023-11-28 17:24:07 |
| 言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 293 ms / 2,000 ms |
| コード長 | 26,224 bytes |
| コンパイル時間 | 7,829 ms |
| コンパイル使用メモリ | 349,636 KB |
| 実行使用メモリ | 56,744 KB |
| 最終ジャッジ日時 | 2023-11-28 17:24:26 |
| 合計ジャッジ時間 | 15,362 ms |
|
ジャッジサーバーID （参考情報） |
judge15 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 10 ms
23,220 KB |
| testcase_01 | AC | 10 ms
23,220 KB |
| testcase_02 | AC | 9 ms
23,220 KB |
| testcase_03 | AC | 266 ms
56,744 KB |
| testcase_04 | AC | 268 ms
56,744 KB |
| testcase_05 | AC | 278 ms
56,744 KB |
| testcase_06 | AC | 264 ms
56,744 KB |
| testcase_07 | AC | 293 ms
56,744 KB |
| testcase_08 | AC | 259 ms
56,744 KB |
| testcase_09 | AC | 255 ms
56,744 KB |
| testcase_10 | AC | 264 ms
56,744 KB |
| testcase_11 | AC | 258 ms
56,744 KB |
| testcase_12 | AC | 266 ms
56,744 KB |
| testcase_13 | AC | 227 ms
49,672 KB |
| testcase_14 | AC | 115 ms
38,184 KB |
| testcase_15 | AC | 105 ms
37,872 KB |
| testcase_16 | AC | 163 ms
45,104 KB |
| testcase_17 | AC | 210 ms
48,272 KB |
| testcase_18 | AC | 228 ms
51,536 KB |
| testcase_19 | AC | 212 ms
48,904 KB |
| testcase_20 | AC | 258 ms
49,192 KB |
| testcase_21 | AC | 266 ms
53,448 KB |
| testcase_22 | AC | 207 ms
48,400 KB |
| testcase_23 | AC | 10 ms
23,376 KB |
| testcase_24 | AC | 10 ms
23,356 KB |
| testcase_25 | AC | 10 ms
23,356 KB |
| testcase_26 | AC | 10 ms
23,364 KB |
| testcase_27 | AC | 10 ms
23,508 KB |
| testcase_28 | AC | 139 ms
47,792 KB |
| testcase_29 | AC | 52 ms
31,432 KB |
| testcase_30 | AC | 53 ms
31,592 KB |
| testcase_31 | AC | 45 ms
30,160 KB |
| testcase_32 | AC | 155 ms
46,192 KB |
| testcase_33 | AC | 9 ms
23,220 KB |
| testcase_34 | AC | 10 ms
23,220 KB |
| testcase_35 | AC | 9 ms
23,224 KB |
| testcase_36 | AC | 10 ms
23,224 KB |
| testcase_37 | AC | 9 ms
23,224 KB |
| testcase_38 | AC | 10 ms
23,220 KB |
| testcase_39 | AC | 10 ms
23,224 KB |
| testcase_40 | AC | 10 ms
23,220 KB |
| testcase_41 | AC | 10 ms
23,220 KB |
| testcase_42 | AC | 11 ms
23,224 KB |
ソースコード
#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif
#include <bits/stdc++.h>
#include <ext/rope>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
template <class T> using pbds_set = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;
using Trie = trie<string, null_type, trie_string_access_traits<>, pat_trie_tag, trie_prefix_search_node_update>;
// template <class T> using heapq = __gnu_pbds::priority_queue<T, greater<T>, pairing_heap_tag>;
template <class T> using heapq = std::priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;
using u128 = __uint128_t;
using f128 = __float128;
using ld = long double;
using ui = unsigned int;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vpii = vector<pii>;
using vpll = vector<pll>;
template <class T>
constexpr T infty = 0;
template <>
constexpr int infty<int> = 1'000'000'000;
template <>
constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;
template <>
constexpr u32 infty<u32> = infty<int>;
template <>
constexpr u64 infty<u64> = infty<ll>;
template <>
constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;
template <>
constexpr double infty<double> = infty<ll>;
template <>
constexpr long double infty<long double> = infty<ll>;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = std::priority_queue<T>;
template <class T>
using pqg = std::priority_queue<T, vector<T>, greater<T>>;
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name( \
a, vector<vector<vector<type>>>( \
b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define eb emplace_back
#define fi first
#define se second
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for(ll _ = 0; _ < n; ++_)
#define rep2(i, n) for(ll i = 0; i < n; ++i)
#define rep3(i, a, b) for(ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for(int i = a; i < b; i += c)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1) (__VA_ARGS__)
#define rrep1(n) for(ll i = n; i--; )
#define rrep2(i, n) for(ll i = n; i--; )
#define rrep3(i, a, b) for(ll i = a; i > b; i--)
#define rrep4(i, a, b, c) for(ll i = a; i > b; i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1) (__VA_ARGS__)
#define each1(i, a) for(auto&& i : a)
#define each2(x, y, a) for(auto&& [x, y] : a)
#define each3(x, y, z, a) for(auto&& [x, y, z] : a)
#define each(...) overload4(__VA_ARGS__, each3, each2, each1) (__VA_ARGS__)
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1) (__VA_ARGS__)
#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R) (__VA_ARGS__)
#define FOR_subset(t, s) for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))
#define len(x) (int)x.size()
#define elif else if
#define all1(i) begin(i), end(i)
#define all2(i, a) begin(i), begin(i) + a
#define all3(i, a, b) begin(i) + a, begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1) (__VA_ARGS__)
#define rall1(i) rbegin(i), rend(i)
#define rall2(i, a) rbegin(i), rbegin(i) + a
#define rall3(i, a, b) rbegin(i) + a, rbegin(i) + b
#define rall(...) overload3(__VA_ARGS__, rall3, rall2, rall1) (__VA_ARGS__)
#define mst(x, a) memset(x, a, sizeof(x))
#define bitcnt(x) (__builtin_popcountll(x))
#define endl "\n"
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
#define SORT(a) sort(all(a))
#define REV(a) reverse(all(a))
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template<class T> auto max(const T& a){ return *max_element(all(a)); }
template<class T> auto min(const T& a){ return *min_element(all(a)); }
template <typename T, typename U>
T ceil(T x, U y) {
return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U>
T floor(T x, U y) {
return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
T q = floor(x, y);
return {q, x - q * y};
}
template <typename T, typename U>
T SUM(const vector<U> &A) {
T sum = 0;
for (auto &&a: A) sum += a;
return sum;
}
template <typename T, typename U>
vector<T> cumsum(vector<U> &A, int off = 1) {
int N = A.size();
vector<T> B(N + 1);
for (int i = 0; i < N; i++) B[i + 1] = B[i] + A[i];
if (off == 0) B.erase(B.begin());
return B;
}
template <typename T>
vector<int> argsort(const vector<T> &A) {
vector<int> ids(len(A));
iota(all(ids), 0);
sort(all(ids),
[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });
return ids;
}
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
vc<T> B(len(I));
FOR(i, len(I)) B[i] = A[I[i]];
return B;
}
template <typename T>
T POP(deque<T> &que) {
T a = que.front();
que.pop_front();
return a;
}
template <typename T>
T POP(pq<T> &que) {
T a = que.top();
que.pop();
return a;
}
template <typename T>
T POP(pqg<T> &que) {
assert(!que.empty());
T a = que.top();
que.pop();
return a;
}
template <typename T>
T POP(vc<T> &que) {
assert(!que.empty());
T a = que.back();
que.pop_back();
return a;
}
template <typename F>
ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {
if (check_ok) assert(check(ok));
while (abs(ok - ng) > 1) {
auto x = (ng + ok) / 2;
(check(x) ? ok : ng) = x;
}
return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
while (iter--) {
double x = (ok + ng) / 2;
(check(x) ? ok : ng) = x;
}
return (ok + ng) / 2;
}
template <class T, class S> inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S> inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
mt19937 rng( chrono::steady_clock::now().time_since_epoch().count() );
#define Ran(a, b) rng() % ( (b) - (a) + 1 ) + (a)
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
size_t operator()(pair<uint64_t,uint64_t> x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x.first + FIXED_RANDOM) ^ (splitmix64(x.second + FIXED_RANDOM) >> 1);
}
};
#define FASTIO
#include <unistd.h>
// https://judge.yosupo.jp/submission/21623
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() {
memcpy(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(u32 &x) { rd_integer(x); }
void rd(u64 &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); }
void rd(f128 &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(vc<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(u32 x) { wt_integer(x); }
void wt(u64 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); }
void wt(f128 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)...);
}
// gcc expansion. called automaticall after main.
void __attribute__((destructor)) _d() { flush(); }
} // namespace fastio
using fastio::read;
using fastio::print;
using fastio::flush;
#define INT(...) \
int __VA_ARGS__; \
read(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
read(__VA_ARGS__)
#define U32(...) \
u32 __VA_ARGS__; \
read(__VA_ARGS__)
#define U64(...) \
u64 __VA_ARGS__; \
read(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
read(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
read(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
read(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
read(name)
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
read(name)
void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
const i128 ONE = 1;
template <typename Iterable>
auto print_all(const Iterable& v, std::string sep = " ", std::string end = "\n") -> decltype(fastio::wt(*v.begin())) {
for (auto it = v.begin(); it != v.end();) {
fastio::wt(*it);
if (++it != v.end()) fastio::wt(sep);
}
fastio::wt(end);
}
ll gcd(ll x, ll y) {
if(!x) return y;
if(!y) return x;
int t = __builtin_ctzll(x | y);
x >>= __builtin_ctzll(x);
do {
y >>= __builtin_ctzll(y);
if (x > y) swap(x, y);
y -= x;
} while (y);
return x << t;
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
ll exgcd(ll a, ll b, ll &x, ll &y) {
if(!b) return x = 1, y = 0, a;
ll d = exgcd(b, a % b, x, y);
ll t = x;
x = y;
y = t - a / b * x;
return d;
}
ll max(ll x, ll y) { return x > y ? x : y; }
ll min(ll x, ll y) { return x < y ? x : y; }
ll Mod(ll x, int mod) { return (x % mod + mod) % mod; }
ll pow(ll x, ll y, ll mod){
ll res = 1, cur = x;
while (y) {
if (y & 1) res = res * cur % mod;
cur = ONE * cur * cur % mod;
y >>= 1;
}
return res % mod;
}
ll probabilityMod(ll x, ll y, ll mod) {
return x * pow(y, mod-2, mod) % mod;
}
vvi getGraph(int n, int m, bool directed = false) {
vvi res(n);
rep(_, 0, m) {
INT(u, v);
u--, v--;
res[u].emplace_back(v);
if(!directed) res[v].emplace_back(u);
}
return res;
}
vector<vpii> getWeightedGraph(int n, int m, bool directed = false) {
vector<vpii> res(n);
rep(_, 0, m) {
INT(u, v, w);
u--, v--;
res[u].emplace_back(v, w);
if(!directed) res[v].emplace_back(u, w);
}
return res;
}
template <class... Args> auto ndvector(size_t n, Args &&...args) {
if constexpr (sizeof...(args) == 1) {
return vector(n, args...);
} else {
return vector(n, ndvector(args...));
}
}
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const int MOD = 1000000007;
const int MODD = 998244353;
const int N = 1e6 + 10;
#line 2 "ds/segtree/dynamic_segtree_sparse.hpp"
// 常にほとんどの要素が unit であることが保証されるような動的セグ木
// したがって、default_prod の類は持たせられず、acted monoid も一般には扱えない
// 永続化しない場合のノード数を O(N) に抑えることができるのが利点
template <typename Monoid, bool PERSISTENT, int NODES>
struct Dynamic_SegTree_Sparse {
using MX = Monoid;
using X = typename MX::value_type;
struct Node {
ll idx;
Node *l, *r;
X prod, x;
};
const ll L0, R0;
Node *pool;
int pid;
using np = Node *;
Dynamic_SegTree_Sparse(ll L0, ll R0) : L0(L0), R0(R0), pid(0) {
pool = new Node[NODES];
}
np new_root() { return nullptr; }
np new_node(ll idx, const X x) {
pool[pid].idx = idx;
pool[pid].l = pool[pid].r = nullptr;
pool[pid].x = pool[pid].prod = x;
return &(pool[pid++]);
}
X prod(np root, ll l, ll r) {
assert(L0 <= l && l <= r && r <= R0);
if (l == r) return MX::unit();
X x = MX::unit();
prod_rec(root, L0, R0, l, r, x);
return x;
}
X prod_all(np root) { return prod(root, L0, R0); }
np set(np root, ll i, const X &x) {
assert(L0 <= i && i < R0);
return set_rec(root, L0, R0, i, x);
}
np multiply(np root, ll i, const X &x) {
assert(L0 <= i && i < R0);
return multiply_rec(root, L0, R0, i, x);
}
template <typename F>
ll max_right(np root, F check, ll L) {
assert(L0 <= L && L <= R0 && check(MX::unit()));
X x = MX::unit();
return max_right_rec(root, check, L0, R0, L, x);
}
template <typename F>
ll min_left(np root, F check, ll R) {
assert(L0 <= R && R <= R0 && check(MX::unit()));
X x = MX::unit();
return min_left_rec(root, check, L0, R0, R, x);
}
void reset() { pid = 0; }
vc<pair<ll, X>> get_all(np root) {
vc<pair<ll, X>> res;
auto dfs = [&](auto &dfs, np c) -> void {
if (!c) return;
dfs(dfs, c->l);
res.eb(c->idx, c->x);
dfs(dfs, c->r);
};
dfs(dfs, root);
return res;
}
X get(np root, ll idx) {
auto dfs = [&](auto &dfs, np c) -> X {
if (!c) return Monoid::unit();
if (idx == c->idx) return c->x;
if (idx < (c->idx)) return dfs(dfs, c->l);
return dfs(dfs, c->r);
};
return dfs(dfs, root);
}
private:
void update(np c) {
c->prod = c->x;
if (c->l) c->prod = MX::op(c->l->prod, c->prod);
if (c->r) c->prod = MX::op(c->prod, c->r->prod);
}
np copy_node(np c) {
if (!c || !PERSISTENT) return c;
pool[pid].idx = c->idx;
pool[pid].l = c->l;
pool[pid].r = c->r;
pool[pid].x = c->x;
pool[pid].prod = c->prod;
return &(pool[pid++]);
}
np set_rec(np c, ll l, ll r, ll i, X x) {
if (!c) {
c = new_node(i, x);
return c;
}
c = copy_node(c);
if (c->idx == i) {
c->x = x;
update(c);
return c;
}
ll m = (l + r) / 2;
if (i < m) {
if (c->idx < i) swap(c->idx, i), swap(c->x, x);
c->l = set_rec(c->l, l, m, i, x);
}
if (m <= i) {
if (i < c->idx) swap(c->idx, i), swap(c->x, x);
c->r = set_rec(c->r, m, r, i, x);
}
update(c);
return c;
}
np multiply_rec(np c, ll l, ll r, ll i, X x) {
if (!c) {
c = new_node(i, x);
return c;
}
c = copy_node(c);
if (c->idx == i) {
c->x = MX::op(c->x, x);
update(c);
return c;
}
ll m = (l + r) / 2;
if (i < m) {
if (c->idx < i) swap(c->idx, i), swap(c->x, x);
c->l = multiply_rec(c->l, l, m, i, x);
}
if (m <= i) {
if (i < c->idx) swap(c->idx, i), swap(c->x, x);
c->r = multiply_rec(c->r, m, r, i, x);
}
update(c);
return c;
}
void prod_rec(np c, ll l, ll r, ll ql, ll qr, X &x) {
chmax(ql, l);
chmin(qr, r);
if (ql >= qr || !c) return;
if (l == ql && r == qr) {
x = MX::op(x, c->prod);
return;
}
ll m = (l + r) / 2;
prod_rec(c->l, l, m, ql, qr, x);
if (ql <= (c->idx) && (c->idx) < qr) x = MX::op(x, c->x);
prod_rec(c->r, m, r, ql, qr, x);
}
template <typename F>
ll max_right_rec(np c, const F &check, ll l, ll r, ll ql, X &x) {
if (!c || r <= ql) return R0;
if (check(MX::op(x, c->prod))) {
x = MX::op(x, c->prod);
return R0;
}
ll m = (l + r) / 2;
ll k = max_right_rec(c->l, check, l, m, ql, x);
if (k != R0) return k;
if (ql <= (c->idx)) {
x = MX::op(x, c->x);
if (!check(x)) return c->idx;
}
return max_right_rec(c->r, check, m, r, ql, x);
}
template <typename F>
ll min_left_rec(np c, const F &check, ll l, ll r, ll qr, X &x) {
if (!c || qr <= l) return L0;
if (check(MX::op(c->prod, x))) {
x = MX::op(c->prod, x);
return L0;
}
ll m = (l + r) / 2;
ll k = min_left_rec(c->r, check, m, r, qr, x);
if (k != L0) return k;
if (c->idx < qr) {
x = MX::op(c->x, x);
if (!check(x)) return c->idx + 1;
}
return min_left_rec(c->l, check, l, m, qr, x);
}
};
#line 2 "alg/monoid/min_idx.hpp"
template <typename T, bool tie_is_left = true>
struct Monoid_Min_Idx {
using value_type = pair<T, int>;
using X = value_type;
static constexpr bool is_small(const X& x, const X& y) {
if (x.fi < y.fi) return true;
if (x.fi > y.fi) return false;
return (tie_is_left ? (x.se < y.se) : (x.se >= y.se));
}
static X op(X x, X y) { return (is_small(x, y) ? x : y); }
static constexpr X unit() { return {infty<T>, -1}; }
static constexpr bool commute = true;
};
#line 2 "alg/monoid/add.hpp"
template <typename X>
struct Monoid_Add {
using value_type = X;
static constexpr X op(const X &x, const X &y) noexcept { return x + y; }
static constexpr X inverse(const X &x) noexcept { return -x; }
static constexpr X power(const X &x, ll n) noexcept { return X(n) * x; }
static constexpr X unit() { return X(0); }
static constexpr bool commute = true;
};
#line 2 "ds/doubling.hpp"
// 状態 a から 1 回操作すると、状態 b に遷移し、モノイドの元 x を加える。
// 行き先がない場合：-1 （add 不要）
template <typename Monoid, int LOG>
struct Doubling {
using X = typename Monoid::value_type;
int N;
bool is_prepared;
vvc<int> TO;
vvc<X> DP;
Doubling(int N) : N(N), is_prepared(0) {
TO.assign(LOG, vc<int>(N, -1));
DP.assign(LOG, vc<X>(N, Monoid::unit()));
}
void add(int i, int to, X x) {
assert(!is_prepared);
assert(-1 <= to && to < N);
TO[0][i] = to;
DP[0][i] = x;
}
void build() {
assert(!is_prepared);
is_prepared = 1;
FOR(k, LOG - 1) {
FOR(v, N) {
int w = TO[k][v];
if (w == -1) {
TO[k + 1][v] = -1;
DP[k + 1][v] = DP[k][v];
continue;
}
TO[k + 1][v] = TO[k][w];
DP[k + 1][v] = Monoid::op(DP[k][v], DP[k][w]);
}
}
}
// (to, val)
pair<int, X> calc(int i, ll step) {
assert(is_prepared);
assert(step < (1LL << LOG));
X x = Monoid::unit();
FOR(k, LOG) {
if (i == -1) break;
if (step & 1LL << k) {
x = Monoid::op(x, DP[k][i]);
i = TO[k][i];
}
}
return {i, x};
}
template <typename F>
ll max_step(F check, int i) {
assert(is_prepared);
X x = Monoid::unit();
ll step = 0;
assert(check(x));
FOR_R(k, LOG) {
int j = TO[k][i];
X y = Monoid::op(x, DP[k][i]);
if (check(y)) {
step |= 1LL << k;
i = j;
x = y;
assert(i != -1);
}
}
return step;
}
void debug() {
print("TO");
FOR(k, LOG) print(TO[k]);
print("DP");
FOR(k, LOG) print(DP[k]);
}
};
void solve() {
INT(n, k);
vi L(n), R(n);
rep(i, n) read(L[i], R[i]);
L.pb(infty<int>);
R.pb(infty<int>);
Dynamic_SegTree_Sparse<Monoid_Min_Idx<int>, 0, 500'000> seg(0, infty<int>);
auto root = seg.new_root();
rep(i, n) root = seg.multiply(root, L[i], {R[i], i});
Doubling<Monoid_Add<int>, 20> X(n + 1);
rep(i, n) {
int x = seg.prod(root, R[i], infty<int>).se;
X.add(i, x, 1);
}
X.build();
int ans = infty<int>;
rep(i, n) {
auto [to, _] = X.calc(i, k - 1);
if (to == -1 || to == n) continue;
chmin(ans, R[to] - L[i]);
}
if (ans == infty<int>) ans = -1;
print(ans);
}
signed main() {
int T = 1;
// read(T);
while (T--) {
solve();
}
return 0;
}