Submission #824589

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
824589	2023-08-14 08:03:04	PoonYaPat	Railway Trip 2 (JOI22_ho_t4)	C++14	100 / 100	1046 ms	62196 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;
typedef pair<int,int> pii;
int ma[100005],mi[100005],n,m,k;
const int mx=100003;
vector<int> chma[100005][2],chmi[100005][2];
multiset<int> smi;
multiset<int,greater<int>> sma;
pii merge(pii a, pii b) {return {min(a.first,b.first),max(a.second,b.second)};}
pii s[1<<18][18];
void build(int l, int r, int idx, int tree) {
    if (l==r) {
        s[idx][tree]=pii(mi[l],ma[l]);
    } else {
        int mid=(l+r)/2;
        build(l,mid,2*idx,tree);
        build(mid+1,r,2*idx+1,tree);
        s[idx][tree]=merge(s[2*idx][tree],s[2*idx+1][tree]);
    }
}
void update(int l, int r, int idx, int x, int mmax, int mmin, int tree) {
    if (x>r || x<l) return;
    if (l==r) s[idx][tree]=merge(s[idx][tree],pii(mmin,mmax));
    else {
        int mid=(l+r)/2;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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