Submission #928282

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
928282	2024-02-16 07:14:46	pcc	Railway Trip 2 (JOI22_ho_t4)	C++17	27 / 100	2068 ms	22596 KiB

Main

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 pii pair<int,int>
#define fs first
#define sc second
const int mxn = 1e5+10;
int N,M,K,Q;
pii range[mxn],segtree[mxn*4];
vector<int> lop[mxn],rop[mxn];
void build(int now,int l,int r){
  if(l == r){
    segtree[now] = range[l];
    return;
  }
  int mid = (l+r)>>1;
  build(now*2+1,l,mid);
  build(now*2+2,mid+1,r);
  segtree[now].fs = min(segtree[now*2+1].fs,segtree[now*2+2].fs);
  segtree[now].sc = max(segtree[now*2+1].sc,segtree[now*2+2].sc);
}
pii getval(int now,int l,int r,int s,int e){
  if(l>=s&&e>=r)return segtree[now];
  int mid = (l+r)>>1;
  if(mid>=e)return getval(now*2+1,l,mid,s,e);
  else if(mid<s)return getval(now*2+2,mid+1,r,s,e);
  else{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 8 / 8
• Subtask 3: 11 / 11
• Subtask 4: 0 / 25
• Subtask 5: 0 / 35
• Subtask 6: 0 / 13