oj.uz

Submission #594088

# Submission time Handle Problem Language Result Execution time Memory
594088 2022-07-12T05:08:44 Z PoPularPlusPlus Railway Trip 2 (JOI22_ho_t4) C++17
100 / 100
 798 ms 77520 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);

const int N = 200001;

struct item {
	int mx , mn;
};

struct Seg {
	ll siz = 1;
	vector<item> val;
	void init(int n){
		while(siz < n)siz*=2;
		
		val.resize(siz * 2);
		
	}
	
	item NutralElement = {-1 , N};
	
	item merge(item a , item b){
		return {max(a.mx , b.mx) , min(a.mn , b.mn)};
	}
	
	item single(pair<int,int> a){
		return {a.vf , a.vs};
	}
	
	void build(vector<pair<int,int>>& arr  , int x , int lx , int rx){
		if(rx-lx==1){
			if(lx < (int)arr.size()){
				val[x] = single(arr[lx]);
			}
			else val[x] = NutralElement;
			return;
		}
		int m = (lx + rx) / 2;
		build(arr , 2 * x + 1 , lx , m);
		build(arr, 2 * x + 2 , m , rx);
		val[x]=merge(val[2 * x + 1] , val[2 * x + 2]);
	}
	
	void build(vector<pair<int,int>>& arr){
		build(arr , 0 , 0 , siz);
	}
	
	item sum(int l , int r , int x , int lx , int rx){
		if(lx >= r  || l >= rx)return NutralElement;
		if(lx >= l && rx <= r)return val[x];
		int m = (lx + rx) / 2;
		item s1 = sum(l , r , 2 * x + 1 ,lx , m);
		item s2 = sum(l , r , 2 * x + 2, m , rx);
		return merge(s1,s2);
	}
	
	item sum(int l , int r){
		return sum(l , r , 0 , 0 , siz);
	}
	
};

void solve(){
	int n;
	cin >> n;
	int k;
	cin >> k;
	int m;
	cin >> m;
	int arr[m][2];
	for(int i = 0; i < m; i++){cin >> arr[i][0] >> arr[i][1]; arr[i][0]--,arr[i][1]--;}
	int L = 20;
	pair<int,int> range[n][L];
	Seg st[L];
	for(int i = 0; i < L; i++)
		st[i].init(n + 1);
	vector<pair<int,int>> v(n);
	int mx[n] , mn[n];
	set<pair<int,int> , greater<pair<int,int>>> s;
	vector<vector<int>> add(n+1) , remove(n+1);
	for(int i = 0; i < m; i++){
		if(arr[i][0] < arr[i][1]){
			add[arr[i][0]].pb(i);
			remove[min(arr[i][0] + k , arr[i][1])].pb(i);
		}
	}
	for(int i = 0; i < n; i++)mx[i] = mn[i] = i;
	for(int i = 0; i < n; i++){
		for(int j : add[i]){
			s.insert(mp(arr[j][1] , j));
		}
		for(int j : remove[i]){
			s.erase(mp(arr[j][1] , j));
		}
		if(s.size())
		mx[i] = (*(s.begin())).vf;
	}
	s.clear();
	for(int i = 0; i <= n; i++)add[i].clear(),remove[i].clear();
	for(int i = 0; i < m; i++){
		if(arr[i][0] > arr[i][1]){
			add[arr[i][0]].pb(i);
			remove[max(0,max(arr[i][0] - k + 1 , arr[i][1] + 1))].pb(i);
		}
	}
	set<pair<int,int>> s1;
	for(int i = n - 1; i >=0; i--){
		for(int j : add[i]){
			s1.insert(mp(arr[j][1] , j));
		}
		if(s1.size())
		mn[i] = (*(s1.begin())).vf;
		for(int j : remove[i]){
			s1.erase(mp(arr[j][1] , j));
		}
	}
	//for(int i = 0; i < n; i++)cout << mx[i] << ' ' << mn[i] << '\n';
	for(int j = 0; j < L; j++){
		for(int i = 0; i < n; i++){
			if(j == 0)v[i] = range[i][j] = mp(mx[i] , mn[i]);
			else {
				if(v[i].vf == N && v[i].vs == -1){
					range[i][j] = v[i];
					continue;
				}
				item it = st[j-1].sum(v[i].vs, v[i].vf + 1);
				v[i] = mp(it.mx , it.mn);
				range[i][j] = v[i];
			}
		}
		st[j].build(v);
	}
	int q;
	cin >> q;
	
	while(q--){
		int s2 , t;
		cin >> s2 >> t;
		s2--;
		t--;
		int ans = 0;
		int l = s2 , r = s2;
		for(int i = L - 1; i >= 0; i--){
			item it = st[i].sum(l,r+1);
			if(it.mx == r && it.mn == l){
				ans = -2;
				break;
			}
			if(it.mx >= t && it.mn <= t)continue;
			ans += (1 << i);
			l = min(l , it.mn);
			r = max(r , it.mx);
		}
		ans++;
		cout << ans << '\n';
	}
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 444 KB Output is correct
9 Correct 2 ms 452 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 10 ms 1552 KB Output is correct
14 Correct 11 ms 1528 KB Output is correct
15 Correct 6 ms 1492 KB Output is correct
16 Correct 5 ms 1492 KB Output is correct
17 Correct 9 ms 1544 KB Output is correct
18 Correct 6 ms 1568 KB Output is correct
19 Correct 10 ms 1480 KB Output is correct
20 Correct 7 ms 1484 KB Output is correct
21 Correct 4 ms 1492 KB Output is correct
22 Correct 10 ms 1556 KB Output is correct
23 Correct 8 ms 1520 KB Output is correct
24 Correct 12 ms 1492 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 70028 KB Output is correct
2 Correct 443 ms 69960 KB Output is correct
3 Correct 420 ms 71248 KB Output is correct
4 Correct 379 ms 69452 KB Output is correct
5 Correct 409 ms 73880 KB Output is correct
6 Correct 406 ms 73540 KB Output is correct
7 Correct 370 ms 75684 KB Output is correct
8 Correct 292 ms 70096 KB Output is correct
9 Correct 288 ms 70496 KB Output is correct
10 Correct 431 ms 72676 KB Output is correct
11 Correct 449 ms 72688 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 520 ms 71896 KB Output is correct
2 Correct 465 ms 74508 KB Output is correct
3 Correct 691 ms 70648 KB Output is correct
4 Correct 490 ms 76304 KB Output is correct
5 Correct 477 ms 75416 KB Output is correct
6 Correct 467 ms 75520 KB Output is correct
7 Correct 599 ms 73368 KB Output is correct
8 Correct 612 ms 73284 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 577 ms 75244 KB Output is correct
2 Correct 747 ms 72332 KB Output is correct
3 Correct 711 ms 68160 KB Output is correct
4 Correct 668 ms 65828 KB Output is correct
5 Correct 515 ms 64484 KB Output is correct
6 Correct 561 ms 64208 KB Output is correct
7 Correct 569 ms 74136 KB Output is correct
8 Correct 2 ms 572 KB Output is correct
9 Correct 9 ms 1492 KB Output is correct
10 Correct 566 ms 75616 KB Output is correct
11 Correct 649 ms 77520 KB Output is correct
12 Correct 797 ms 75516 KB Output is correct
13 Correct 666 ms 77452 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 11 ms 1520 KB Output is correct
16 Correct 468 ms 72916 KB Output is correct
17 Correct 777 ms 73604 KB Output is correct
18 Correct 763 ms 73656 KB Output is correct
19 Correct 679 ms 73600 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 2 ms 444 KB Output is correct
9 Correct 2 ms 452 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 10 ms 1552 KB Output is correct
14 Correct 11 ms 1528 KB Output is correct
15 Correct 6 ms 1492 KB Output is correct
16 Correct 5 ms 1492 KB Output is correct
17 Correct 9 ms 1544 KB Output is correct
18 Correct 6 ms 1568 KB Output is correct
19 Correct 10 ms 1480 KB Output is correct
20 Correct 7 ms 1484 KB Output is correct
21 Correct 4 ms 1492 KB Output is correct
22 Correct 10 ms 1556 KB Output is correct
23 Correct 8 ms 1520 KB Output is correct
24 Correct 12 ms 1492 KB Output is correct
25 Correct 409 ms 70028 KB Output is correct
26 Correct 443 ms 69960 KB Output is correct
27 Correct 420 ms 71248 KB Output is correct
28 Correct 379 ms 69452 KB Output is correct
29 Correct 409 ms 73880 KB Output is correct
30 Correct 406 ms 73540 KB Output is correct
31 Correct 370 ms 75684 KB Output is correct
32 Correct 292 ms 70096 KB Output is correct
33 Correct 288 ms 70496 KB Output is correct
34 Correct 431 ms 72676 KB Output is correct
35 Correct 449 ms 72688 KB Output is correct
36 Correct 520 ms 71896 KB Output is correct
37 Correct 465 ms 74508 KB Output is correct
38 Correct 691 ms 70648 KB Output is correct
39 Correct 490 ms 76304 KB Output is correct
40 Correct 477 ms 75416 KB Output is correct
41 Correct 467 ms 75520 KB Output is correct
42 Correct 599 ms 73368 KB Output is correct
43 Correct 612 ms 73284 KB Output is correct
44 Correct 577 ms 75244 KB Output is correct
45 Correct 747 ms 72332 KB Output is correct
46 Correct 711 ms 68160 KB Output is correct
47 Correct 668 ms 65828 KB Output is correct
48 Correct 515 ms 64484 KB Output is correct
49 Correct 561 ms 64208 KB Output is correct
50 Correct 569 ms 74136 KB Output is correct
51 Correct 2 ms 572 KB Output is correct
52 Correct 9 ms 1492 KB Output is correct
53 Correct 566 ms 75616 KB Output is correct
54 Correct 649 ms 77520 KB Output is correct
55 Correct 797 ms 75516 KB Output is correct
56 Correct 666 ms 77452 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 11 ms 1520 KB Output is correct
59 Correct 468 ms 72916 KB Output is correct
60 Correct 777 ms 73604 KB Output is correct
61 Correct 763 ms 73656 KB Output is correct
62 Correct 679 ms 73600 KB Output is correct
63 Correct 635 ms 70016 KB Output is correct
64 Correct 798 ms 71688 KB Output is correct
65 Correct 690 ms 70268 KB Output is correct
66 Correct 420 ms 74572 KB Output is correct
67 Correct 631 ms 74296 KB Output is correct
68 Correct 518 ms 73384 KB Output is correct
69 Correct 518 ms 75468 KB Output is correct
70 Correct 573 ms 73388 KB Output is correct
71 Correct 764 ms 73472 KB Output is correct