#941381 (C++23) No.2543 Many Meetings

• 問題: No.2543 Many Meetings
• ユーザー: Misuki
• 提出日時: 2023-12-31 17:39:32
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 117 ms / 2,000 ms
• コード長: 2,924 bytes
• コンパイル時間: 3,428 ms
• コンパイル使用メモリ: 220,960 KB
• 実行使用メモリ: 40,780 KB
• 最終ジャッジ日時: 2024-09-27 17:07:39
• 合計ジャッジ時間: 8,909 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 40

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#pragma GCC optimize("O2")
#include <algorithm>
#include <array>
#include <bit>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <climits>
#include <cmath>
#include <compare>
#include <complex>
#include <concepts>
#include <cstdarg>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <new>
#include <numbers>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ranges>
#include <set>
#include <span>
#include <sstream>
#include <stack>
#include <streambuf>
#include <string>
#include <tuple>
#include <type_traits>
#include <variant>
#define int ll
#define INT128_MAX (__int128)(((unsigned __int128) 1 << ((sizeof(__int128) * __CHAR_BIT__) - 1)) - 1)
#define INT128_MIN (-INT128_MAX - 1)
namespace R = std::ranges;
namespace V = std::views;
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
using tiii = tuple<int, int, int>;
using ldb = long double;
//#define double ldb
template<class T>
ostream& operator<<(ostream& os, const pair<T, T> pr) {
  return os << pr.first << ' ' << pr.second;
}
template<class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N> &arr) {
  for(const T &X : arr)
    os << X << ' ';
  return os;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> &vec) {
  for(const T &X : vec)
    os << X << ' ';
  return os;
}
signed main() {
  ios::sync_with_stdio(false), cin.tie(NULL);
  int n, k; cin >> n >> k;
  vector<array<int, 2>> seg(n);
  for(auto &[l, r] : seg)
    cin >> l >> r;
  sort(seg.begin(), seg.end(), [](array<int, 2> l, array<int, 2> r) { return l[1] > r[1]; });
  vector<array<int, 3>> cand(n);
  for(int i = 0; i < n; i++)
    cand[i] = {seg[i][0], seg[i][1], i};
  R::sort(cand);
  vector jp(18, vector<int>(n, -1));
  int mnR = INT_MAX, id = -1;
  for(int i = 0; i < n; i++) {
    auto [l, r] = seg[i];
    while(!cand.empty() and cand.back()[0] >= r) {
      auto [lp, rp, j] = cand.back();
      if (rp < mnR)
        mnR = rp, id = j;
      cand.pop_back();
    }
    jp[0][i] = id;
  }
  for(int i = 1; i < 18; i++)
    for(int j = 0; j < n; j++)
      if (jp[i - 1][j] != -1)
        jp[i][j] = jp[i - 1][jp[i - 1][j]];
  int ans = INT_MAX;
  for(int i = 0; i < n; i++) {
    int j = i;
    for(int bit = 0; bit < 18; bit++)
      if (j != -1 and ((k - 1) >> bit & 1))
        j = jp[bit][j];
    if (j != -1)
      ans = min(ans, seg[j][1] - seg[i][0]);
  }
  cout << (ans == INT_MAX ? -1 : ans) << '\n';
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX