Submission #105836

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
105836	2019-04-15 10:29:04	Pro_ktmr	Railway Trip (JOI17_railway_trip)	C++14	20 / 100	498 ms	8940 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;
#define LL long long
#define MP make_pair
struct SegmentTree{
private:
  int N;
  vector<int> node;
public:
  void init(int n){
    N = 1;
    while(N < n) N *= 2;
    N = N*2-1;
    node.clear();
    for(int i=0; i<N; i++) node.push_back(0);
  }
  void update(int a, int x){
    int k = a + (N-1)/2;
    node[k] = x;
    while(k > 0){
      k = (k-1) / 2;
      node[k] = max(node[2*k+1], node[2*k+2]);
    }
  }
  int findL(int a, int b, int x, int k=0, int l=0, int r=-1){
    if(r == -1) r = (N+1)/2;
    if(r <= a || b <= l) return INT_MAX;
    if(r-l == 1 && node[k] > x) return k - (N-1)/2;
    else if(r-l == 1) return INT_MAX;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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