Submission #748027

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
748027	2023-05-25 10:11:17	WongChun1234	Passport (JOI23_passport)	C++14	100 / 100	893 ms	166116 KiB

passport

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;
const int N=200050;
int n,q,x,l[N],r[N],dist[3][N<<2],final[3][N<<2],rrl[N],mx;
vector<pair<int,int>> adj[N<<2],radj[N<<2];
priority_queue<pair<int,int>> pq;
void pre(int id,int l,int r){
    mx=max(id,mx);
    //cout<<id<<" "<<l<<" "<<r<<"\n";
    if (l==r){
        rrl[l]=id;
        return;
    }
    int m=(l+r)/2;
    pre(id*2,l,m);
    pre(id*2+1,m+1,r);
    adj[id].push_back({id*2,0});
    adj[id].push_back({id*2+1,0});
    radj[id*2].push_back({id,0});
    radj[id*2+1].push_back({id,0});
}
void build(int id,int l,int r,int ql,int qr,int rt,int dist){
    if (l>qr||r<ql) return;
    if (ql<=l&&qr>=r){
        //cout<<rt<<"<->"<<id<<"\n";
        adj[rt].push_back({id,dist});
        radj[id].push_back({rt,dist});
        return;
    }
    int m=(l+r)/2;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 6 / 6
• Subtask 2: 16 / 16
• Subtask 3: 24 / 24
• Subtask 4: 8 / 8
• Subtask 5: 46 / 46