Submission #603295

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
603295	2022-07-23 21:57:26	GusterGoose27	Railway Trip (JOI17_railway_trip)	C++11	100 / 100	207 ms	18964 KiB

railway_trip

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
#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MAXN = 1e5;
int n, k, m;
pii ranges[MAXN][20];
int heights[MAXN];
pii up_to_r(int s, int e) {
  int ans = 0;
  pii cur(s, s);
  for (int i = 19; i >= 0; i--) {
    if (max(ranges[cur.first][i].second, ranges[cur.second][i].second) < e) {
      int nextl = min(ranges[cur.first][i].first, ranges[cur.second][i].first);
      int nextr = max(ranges[cur.first][i].second, ranges[cur.second][i].second);
      cur = pii(nextl, nextr);
      ans += (1 << i);
    }
  }
  return pii(cur.second, ans);
}
pii up_to_l(int s, int e) {
  int ans = 0;
  pii cur(s, s);
  for (int i = 19; i >= 0; i--) {
    if (min(ranges[cur.first][i].first, ranges[cur.second][i].first) > e) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 15 / 15
• Subtask 3: 25 / 25
• Subtask 4: 55 / 55