oj.uz

답안 #527693

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527693 2022-02-18T03:33:55 Z CSQ31 Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 705 ms 103008 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
const int MAXN = 1e5+2;
int l[18][MAXN],r[18][MAXN];
vector<int>e[MAXN],f[MAXN];

struct seg{
	int n;
	vector<int>mn,mx;
	vector<pair<int,int>>a;
	seg(){}
	seg(int _n,vector<pair<int,int>>_a){
		n = _n;
		a = _a;
		mn.assign(4*n+1,1e9);
		mx.assign(4*n+1,0);
	}
	void build(int v,int l,int r){
		if(l==r){
			mn[v] = a[l].first;
			mx[v] = a[l].second;
		}
		else{
			int tm = (l+r)/2;
			build(2*v,l,tm);
			build(2*v+1,tm+1,r);
			mn[v] = min(mn[2*v],mn[2*v+1]);
			mx[v] = max(mx[2*v],mx[2*v+1]);
		}
	}
	pair<int,int>query(int v,int l,int r,int tl,int tr){
		if(l > r)return {1e9,-1e9};
		if(l==tl && r==tr)return {mn[v],mx[v]};
		int tm = (tl+tr)/2;
		pair<int,int>a = query(2*v,l,min(r,tm),tl,tm);
		pair<int,int>b = query(2*v+1,max(l,tm+1),r,tm+1,tr);
		a.first = min(a.first,b.first);
		a.second = max(a.second,b.second);
		return a;
	}
};
int main()
{
	owo
	int n,k,m,q;
	cin>>n>>k>>m;
	for(int i=0;i<m;i++){
		int s,t;
		cin>>s>>t;
		if(s < t){
			e[s].pb(t);
			e[min(s+k,t+1)].pb(-t);
		}else{
			f[s].pb(t);
			f[max(s-k,t-1)].pb(-t);
		}
	}
	multiset<int,greater<int>>ss;
	for(int i=1;i<=n;i++){
		for(int x:e[i]){
			if(x>0)ss.insert(x);
			else ss.erase(ss.find(-x));
		}
		if(ss.empty())r[0][i] = i;
		else r[0][i] = *ss.begin();
	}
	ss.clear();
	for(int i=n;i>=1;i--){
		for(int x:f[i]){
			if(x>0)ss.insert(-x);
			else ss.erase(ss.find(x));
		}
		if(ss.empty())l[0][i] = i;
		else l[0][i] = -(*ss.begin());
	}
	vector<seg>p(18);
	for(int i=0;i<=17;i++){
		if(i){
			for(int j=1;j<=n;j++){
				pair<int,int>res = p[i-1].query(1,l[i-1][j],r[i-1][j],1,n);
				l[i][j] = res.first;
				r[i][j] = res.second;
			}
		}
		vector<pair<int,int>>a(n+1);
		for(int j=1;j<=n;j++){
			a[j].first = l[i][j];
			a[j].second = r[i][j];
		}
		p[i] = seg(n,a);
		p[i].build(1,1,n);
		
	}
	cin>>q;
	while(q--){
		int s,t;
		cin>>s>>t;
		if(t < l[17][s] || t > r[17][s]){
			cout<<-1<<'\n';
			continue;
		}
		int ans = 0;
		int L = s,R = s;
		for(int i=17;i>=0;i--){
			pair<int,int>res = p[i].query(1,L,R,1,n);
			if(res.first > t || res.second < t){
				ans+=(1<<i);
				L = res.first;
				R = res.second;
			}
		}
		cout<<ans+1<<'\n';
	}

	
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5452 KB Output is correct
2 Correct 5 ms 5360 KB Output is correct
3 Correct 3 ms 5452 KB Output is correct
4 Correct 3 ms 5452 KB Output is correct
5 Correct 4 ms 5452 KB Output is correct
6 Correct 3 ms 5420 KB Output is correct
7 Correct 4 ms 5372 KB Output is correct
8 Correct 4 ms 5452 KB Output is correct
9 Correct 4 ms 5452 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 3 ms 5580 KB Output is correct
12 Correct 4 ms 5452 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5452 KB Output is correct
2 Correct 5 ms 5360 KB Output is correct
3 Correct 3 ms 5452 KB Output is correct
4 Correct 3 ms 5452 KB Output is correct
5 Correct 4 ms 5452 KB Output is correct
6 Correct 3 ms 5420 KB Output is correct
7 Correct 4 ms 5372 KB Output is correct
8 Correct 4 ms 5452 KB Output is correct
9 Correct 4 ms 5452 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 3 ms 5580 KB Output is correct
12 Correct 4 ms 5452 KB Output is correct
13 Correct 13 ms 6972 KB Output is correct
14 Correct 10 ms 6860 KB Output is correct
15 Correct 9 ms 6928 KB Output is correct
16 Correct 7 ms 6988 KB Output is correct
17 Correct 11 ms 6988 KB Output is correct
18 Correct 7 ms 6988 KB Output is correct
19 Correct 9 ms 6888 KB Output is correct
20 Correct 6 ms 6988 KB Output is correct
21 Correct 5 ms 6988 KB Output is correct
22 Correct 9 ms 6988 KB Output is correct
23 Correct 10 ms 6988 KB Output is correct
24 Correct 10 ms 6900 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 424 ms 94112 KB Output is correct
2 Correct 345 ms 94184 KB Output is correct
3 Correct 440 ms 94252 KB Output is correct
4 Correct 350 ms 94036 KB Output is correct
5 Correct 220 ms 97352 KB Output is correct
6 Correct 379 ms 97360 KB Output is correct
7 Correct 219 ms 102868 KB Output is correct
8 Correct 140 ms 95308 KB Output is correct
9 Correct 137 ms 96144 KB Output is correct
10 Correct 426 ms 96768 KB Output is correct
11 Correct 317 ms 96672 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 525 ms 96620 KB Output is correct
2 Correct 355 ms 98024 KB Output is correct
3 Correct 612 ms 97680 KB Output is correct
4 Correct 315 ms 103008 KB Output is correct
5 Correct 315 ms 98032 KB Output is correct
6 Correct 301 ms 99116 KB Output is correct
7 Correct 532 ms 96964 KB Output is correct
8 Correct 505 ms 96956 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 439 ms 96424 KB Output is correct
2 Correct 705 ms 94484 KB Output is correct
3 Correct 660 ms 93052 KB Output is correct
4 Correct 648 ms 92128 KB Output is correct
5 Correct 483 ms 91612 KB Output is correct
6 Correct 526 ms 91424 KB Output is correct
7 Correct 376 ms 95548 KB Output is correct
8 Correct 3 ms 5452 KB Output is correct
9 Correct 10 ms 6944 KB Output is correct
10 Correct 363 ms 97024 KB Output is correct
11 Correct 531 ms 97444 KB Output is correct
12 Correct 463 ms 95788 KB Output is correct
13 Correct 468 ms 97756 KB Output is correct
14 Correct 5 ms 5452 KB Output is correct
15 Correct 12 ms 6948 KB Output is correct
16 Correct 376 ms 95316 KB Output is correct
17 Correct 648 ms 95560 KB Output is correct
18 Correct 617 ms 95536 KB Output is correct
19 Correct 618 ms 95544 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5452 KB Output is correct
2 Correct 5 ms 5360 KB Output is correct
3 Correct 3 ms 5452 KB Output is correct
4 Correct 3 ms 5452 KB Output is correct
5 Correct 4 ms 5452 KB Output is correct
6 Correct 3 ms 5420 KB Output is correct
7 Correct 4 ms 5372 KB Output is correct
8 Correct 4 ms 5452 KB Output is correct
9 Correct 4 ms 5452 KB Output is correct
10 Correct 4 ms 5068 KB Output is correct
11 Correct 3 ms 5580 KB Output is correct
12 Correct 4 ms 5452 KB Output is correct
13 Correct 13 ms 6972 KB Output is correct
14 Correct 10 ms 6860 KB Output is correct
15 Correct 9 ms 6928 KB Output is correct
16 Correct 7 ms 6988 KB Output is correct
17 Correct 11 ms 6988 KB Output is correct
18 Correct 7 ms 6988 KB Output is correct
19 Correct 9 ms 6888 KB Output is correct
20 Correct 6 ms 6988 KB Output is correct
21 Correct 5 ms 6988 KB Output is correct
22 Correct 9 ms 6988 KB Output is correct
23 Correct 10 ms 6988 KB Output is correct
24 Correct 10 ms 6900 KB Output is correct
25 Correct 424 ms 94112 KB Output is correct
26 Correct 345 ms 94184 KB Output is correct
27 Correct 440 ms 94252 KB Output is correct
28 Correct 350 ms 94036 KB Output is correct
29 Correct 220 ms 97352 KB Output is correct
30 Correct 379 ms 97360 KB Output is correct
31 Correct 219 ms 102868 KB Output is correct
32 Correct 140 ms 95308 KB Output is correct
33 Correct 137 ms 96144 KB Output is correct
34 Correct 426 ms 96768 KB Output is correct
35 Correct 317 ms 96672 KB Output is correct
36 Correct 525 ms 96620 KB Output is correct
37 Correct 355 ms 98024 KB Output is correct
38 Correct 612 ms 97680 KB Output is correct
39 Correct 315 ms 103008 KB Output is correct
40 Correct 315 ms 98032 KB Output is correct
41 Correct 301 ms 99116 KB Output is correct
42 Correct 532 ms 96964 KB Output is correct
43 Correct 505 ms 96956 KB Output is correct
44 Correct 439 ms 96424 KB Output is correct
45 Correct 705 ms 94484 KB Output is correct
46 Correct 660 ms 93052 KB Output is correct
47 Correct 648 ms 92128 KB Output is correct
48 Correct 483 ms 91612 KB Output is correct
49 Correct 526 ms 91424 KB Output is correct
50 Correct 376 ms 95548 KB Output is correct
51 Correct 3 ms 5452 KB Output is correct
52 Correct 10 ms 6944 KB Output is correct
53 Correct 363 ms 97024 KB Output is correct
54 Correct 531 ms 97444 KB Output is correct
55 Correct 463 ms 95788 KB Output is correct
56 Correct 468 ms 97756 KB Output is correct
57 Correct 5 ms 5452 KB Output is correct
58 Correct 12 ms 6948 KB Output is correct
59 Correct 376 ms 95316 KB Output is correct
60 Correct 648 ms 95560 KB Output is correct
61 Correct 617 ms 95536 KB Output is correct
62 Correct 618 ms 95544 KB Output is correct
63 Correct 578 ms 94248 KB Output is correct
64 Correct 658 ms 94368 KB Output is correct
65 Correct 596 ms 94204 KB Output is correct
66 Correct 284 ms 97932 KB Output is correct
67 Correct 586 ms 97624 KB Output is correct
68 Correct 480 ms 96152 KB Output is correct
69 Correct 329 ms 98952 KB Output is correct
70 Correct 471 ms 96908 KB Output is correct
71 Correct 704 ms 97004 KB Output is correct