oj.uz

Submission #678794

# Submission time Handle Problem Language Result Execution time Memory
678794 2023-01-06T15:12:52 Z guagua0407 Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 714 ms 231920 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end() 
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);


struct node{
	int mx=-1, mn=1e5+5;
	int stmx=-1,stmn=1e5+5;
};

const int mxn=1e5+5;
int n,k,m;
int up[17][mxn][17],down[17][mxn][17];
node segtree[1][mxn*4];
int lg[mxn];

void push(int id,int v){
	segtree[id][v*2].mn=min(segtree[id][v*2].mn,segtree[id][v].stmn);
	segtree[id][v*2+1].mn=min(segtree[id][v*2+1].mn,segtree[id][v].stmn);
	segtree[id][v*2].mx=max(segtree[id][v*2].mx,segtree[id][v].stmx);
	segtree[id][v*2+1].mx=max(segtree[id][v*2+1].mx,segtree[id][v].stmx);
	segtree[id][v*2].stmn=min(segtree[id][v*2].stmn,segtree[id][v].stmn);
	segtree[id][v*2+1].stmn=min(segtree[id][v*2+1].stmn,segtree[id][v].stmn);
	segtree[id][v*2].stmx=max(segtree[id][v*2].stmx,segtree[id][v].stmx);
	segtree[id][v*2+1].stmx=max(segtree[id][v*2+1].stmx,segtree[id][v].stmx);
	segtree[id][v].stmn=1e5+5;
	segtree[id][v].stmx=-1;
}

void init(int id,int l=1,int r=n,int v=1){
	segtree[id][v].mn=l,segtree[id][v].mx=r;
	if(l==r){
		return;
	}
	int mid=(l+r)/2;
	init(id,l,mid,v*2);
	init(id,mid+1,r,v*2+1);
}

void update1(int id,int tl,int tr,int val,int l=1,int r=n,int v=1){
	if(tl>tr){
		return;
	}
	if(tl<=l and r<=tr){
		segtree[id][v].stmx=max(segtree[id][v].stmx,val);
		segtree[id][v].mx=max(segtree[id][v].mx,val);
		return;
	}
	push(id,v);
	int mid=(l+r)/2;
	update1(id,tl,min(mid,tr),val,l,mid,v*2);
	update1(id,max(mid+1,tl),tr,val,mid+1,r,v*2+1);
	segtree[id][v].mx=max(segtree[id][v*2].mx,segtree[id][v*2+1].mx);
	segtree[id][v].mn=min(segtree[id][v*2].mn,segtree[id][v*2+1].mn);
}

void update2(int id,int tl,int tr,int val,int l=1,int r=n,int v=1){
	if(tl>tr){
		return;
	}
	if(tl<=l and r<=tr){
		segtree[id][v].stmn=min(segtree[id][v].stmn,val);
		segtree[id][v].mn=min(segtree[id][v].mn,val);
		return;
	}
	push(id,v);
	int mid=(l+r)/2;
	update2(id,tl,min(mid,tr),val,l,mid,v*2);
	update2(id,max(mid+1,tl),tr,val,mid+1,r,v*2+1);
	segtree[id][v].mn=min(segtree[id][v*2].mn,segtree[id][v*2+1].mn);
	segtree[id][v].mx=max(segtree[id][v*2].mx,segtree[id][v*2+1].mx);
}

pair<int,int> query(int id,int tl,int tr,int l=1,int r=n,int v=1){
	if(tl>tr){
		return {n+1,-1};
	}
	if(tl<=l and r<=tr){
		return {segtree[id][v].mn,segtree[id][v].mx};
	}
	push(id,v);
	int mid=(l+r)/2;
	pair<int,int> x=query(id,tl,min(mid,tr),l,mid,v*2);
	pair<int,int> y=query(id,max(mid+1,tl),tr,mid+1,r,v*2+1);
	return {min(x.f,y.f),max(x.s,y.s)};
}

bool ok(int a,int b,int k){
	pair<int,int> cur={a,a};
	for(int i=0;i<17;i++){
		if(k&(1<<i)){
            int bit=lg[cur.s-cur.f+1];
            int x=min(down[i][cur.f][bit],down[i][cur.s-(1<<bit)+1][bit]);
            int y=max(up[i][cur.f][bit],up[i][cur.s-(1<<bit)+1][bit]);
			cur.f=x;
            cur.s=y;
            //cout<<cur.f<<' '<<cur.s<<'\n';
		}
	}
	return (cur.f<=b and b<=cur.s);
}

int main() {_
	cin>>n>>k;
	cin>>m;
	init(0);
    for(int i=2;i<=n;i++){
        lg[i]=lg[i/2]+1;
    }
	for(int i=0;i<m;i++){
		int a,b;
		cin>>a>>b;
		if(a<b){
			int tmp=min(a+k-1,b);
			update1(0,a,tmp,b);
		}
		else{
			int tmp=max(a-k+1,b);
			update2(0,tmp,a,b);
		}
	}
    for(int i=1;i<=n;i++){
        up[0][i][0]=query(0,i,i).s;
        down[0][i][0]=query(0,i,i).f;
        //cout<<i<<' '<<down[0][i][0]<<' '<<up[0][i][0]<<'\n';
    }
    for(int i=1;i<17;i++){
        for(int j=1;j+(1<<i)-1<=n;j++){
            up[0][j][i]=max(up[0][j][i-1],up[0][j+(1<<(i-1))][i-1]);
            down[0][j][i]=min(down[0][j][i-1],down[0][j+(1<<(i-1))][i-1]);
        }
    }
	for(int bit=1;bit<17;bit++){
        for(int i=1;i<=n;i++){
            int tmp=lg[up[bit-1][i][0]-down[bit-1][i][0]+1];
            up[bit][i][0]=max(up[bit-1][down[bit-1][i][0]][tmp],up[bit-1][up[bit-1][i][0]-(1<<tmp)+1][tmp]);
            down[bit][i][0]=min(down[bit-1][down[bit-1][i][0]][tmp],down[bit-1][up[bit-1][i][0]-(1<<tmp)+1][tmp]);
        }
        for(int i=1;i<17;i++){
            for(int j=1;j+(1<<i)-1<=n;j++){
                up[bit][j][i]=max(up[bit][j][i-1],up[bit][j+(1<<(i-1))][i-1]);
                down[bit][j][i]=min(down[bit][j][i-1],down[bit][j+(1<<(i-1))][i-1]);
            }
        }
    }
	int q;
	cin>>q;
	for(int j=0;j<q;j++){
		int a,b;
		cin>>a>>b;
		//binary search ans(actually not neccessary)
		int l=a,r=a;
        int ans=0;
        for(int i=16;i>=0;i--){
            int bit=lg[r-l+1];
            int tl=min(down[i][l][bit],down[i][r-(1<<bit)+1][bit]);
            int tr=max(up[i][l][bit],up[i][r-(1<<bit)+1][bit]);
            if(b<tl or b>tr){
                l=tl,r=tr;
                ans+=(1<<i);
            }
        }
        int bit=lg[r-l+1];
        int tl=min(down[0][l][bit],down[0][r-(1<<bit)+1][bit]);
        int tr=max(up[0][l][bit],up[0][r-(1<<bit)+1][bit]);
        l=tl,r=tr;
		cout<<((l<=b and b<=r)?ans+1:-1)<<'\n';
	}
return 0;
}
//maybe its multiset not set

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1236 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1236 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 5 ms 5208 KB Output is correct
14 Correct 5 ms 5204 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 6 ms 5204 KB Output is correct
17 Correct 5 ms 5204 KB Output is correct
18 Correct 5 ms 5204 KB Output is correct
19 Correct 5 ms 4948 KB Output is correct
20 Correct 5 ms 5204 KB Output is correct
21 Correct 5 ms 5204 KB Output is correct
22 Correct 5 ms 5204 KB Output is correct
23 Correct 5 ms 5204 KB Output is correct
24 Correct 5 ms 5204 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 431 ms 231896 KB Output is correct
2 Correct 466 ms 231632 KB Output is correct
3 Correct 442 ms 231640 KB Output is correct
4 Correct 442 ms 231784 KB Output is correct
5 Correct 573 ms 231736 KB Output is correct
6 Correct 496 ms 231816 KB Output is correct
7 Correct 487 ms 231712 KB Output is correct
8 Correct 483 ms 229572 KB Output is correct
9 Correct 528 ms 231716 KB Output is correct
10 Correct 520 ms 231632 KB Output is correct
11 Correct 510 ms 231652 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 531 ms 231860 KB Output is correct
2 Correct 579 ms 231832 KB Output is correct
3 Correct 513 ms 231920 KB Output is correct
4 Correct 549 ms 231708 KB Output is correct
5 Correct 591 ms 229580 KB Output is correct
6 Correct 576 ms 231608 KB Output is correct
7 Correct 554 ms 231632 KB Output is correct
8 Correct 586 ms 231732 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 714 ms 231576 KB Output is correct
2 Correct 554 ms 231772 KB Output is correct
3 Correct 552 ms 231676 KB Output is correct
4 Correct 501 ms 231836 KB Output is correct
5 Correct 482 ms 231828 KB Output is correct
6 Correct 430 ms 231696 KB Output is correct
7 Correct 474 ms 231508 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 6 ms 5216 KB Output is correct
10 Correct 558 ms 231396 KB Output is correct
11 Correct 661 ms 231524 KB Output is correct
12 Correct 563 ms 229320 KB Output is correct
13 Correct 593 ms 231528 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 5 ms 5184 KB Output is correct
16 Correct 510 ms 231392 KB Output is correct
17 Correct 589 ms 231700 KB Output is correct
18 Correct 580 ms 231500 KB Output is correct
19 Correct 560 ms 231440 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1236 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1236 KB Output is correct
8 Correct 1 ms 1236 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 1 ms 1236 KB Output is correct
13 Correct 5 ms 5208 KB Output is correct
14 Correct 5 ms 5204 KB Output is correct
15 Correct 4 ms 5204 KB Output is correct
16 Correct 6 ms 5204 KB Output is correct
17 Correct 5 ms 5204 KB Output is correct
18 Correct 5 ms 5204 KB Output is correct
19 Correct 5 ms 4948 KB Output is correct
20 Correct 5 ms 5204 KB Output is correct
21 Correct 5 ms 5204 KB Output is correct
22 Correct 5 ms 5204 KB Output is correct
23 Correct 5 ms 5204 KB Output is correct
24 Correct 5 ms 5204 KB Output is correct
25 Correct 431 ms 231896 KB Output is correct
26 Correct 466 ms 231632 KB Output is correct
27 Correct 442 ms 231640 KB Output is correct
28 Correct 442 ms 231784 KB Output is correct
29 Correct 573 ms 231736 KB Output is correct
30 Correct 496 ms 231816 KB Output is correct
31 Correct 487 ms 231712 KB Output is correct
32 Correct 483 ms 229572 KB Output is correct
33 Correct 528 ms 231716 KB Output is correct
34 Correct 520 ms 231632 KB Output is correct
35 Correct 510 ms 231652 KB Output is correct
36 Correct 531 ms 231860 KB Output is correct
37 Correct 579 ms 231832 KB Output is correct
38 Correct 513 ms 231920 KB Output is correct
39 Correct 549 ms 231708 KB Output is correct
40 Correct 591 ms 229580 KB Output is correct
41 Correct 576 ms 231608 KB Output is correct
42 Correct 554 ms 231632 KB Output is correct
43 Correct 586 ms 231732 KB Output is correct
44 Correct 714 ms 231576 KB Output is correct
45 Correct 554 ms 231772 KB Output is correct
46 Correct 552 ms 231676 KB Output is correct
47 Correct 501 ms 231836 KB Output is correct
48 Correct 482 ms 231828 KB Output is correct
49 Correct 430 ms 231696 KB Output is correct
50 Correct 474 ms 231508 KB Output is correct
51 Correct 1 ms 1236 KB Output is correct
52 Correct 6 ms 5216 KB Output is correct
53 Correct 558 ms 231396 KB Output is correct
54 Correct 661 ms 231524 KB Output is correct
55 Correct 563 ms 229320 KB Output is correct
56 Correct 593 ms 231528 KB Output is correct
57 Correct 1 ms 1236 KB Output is correct
58 Correct 5 ms 5184 KB Output is correct
59 Correct 510 ms 231392 KB Output is correct
60 Correct 589 ms 231700 KB Output is correct
61 Correct 580 ms 231500 KB Output is correct
62 Correct 560 ms 231440 KB Output is correct
63 Correct 552 ms 231460 KB Output is correct
64 Correct 567 ms 231500 KB Output is correct
65 Correct 564 ms 231568 KB Output is correct
66 Correct 616 ms 231392 KB Output is correct
67 Correct 601 ms 231420 KB Output is correct
68 Correct 641 ms 229104 KB Output is correct
69 Correct 582 ms 231244 KB Output is correct
70 Correct 560 ms 231248 KB Output is correct
71 Correct 632 ms 231368 KB Output is correct