oj.uz

Submission #879225

# Submission time Handle Problem Language Result Execution time Memory
879225 2023-11-26T23:36:13 Z samek08 Railway Trip 2 (JOI22_ho_t4) C++14
100 / 100
 585 ms 211028 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define rep(a,b) for (int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()

const int MAXN = 3e5+5, base = (1<<19), rozmiar_drzewa = base * 2, INF = 1e9+50, LG = 18;
int n = 0, k = 0, m = 0, q = 0, a = 0, b = 0;
vector<int> tree_min;
vector<int> tree_max;
int A_min[LG+1][MAXN];
int A_max[LG+1][MAXN];
int tree_minn[LG+1][rozmiar_drzewa];
int tree_maxx[LG+1][rozmiar_drzewa];

inline void update_min(int l, int p, int val)
{
	l = l + base - 1, p = p + base + 1;
	while(l / 2 != p / 2)
	{
		if(l % 2 == 0) tree_min[l+1] = min(tree_min[l+1],val);
		if(p % 2 == 1) tree_min[p-1] = min(tree_min[p-1],val);
		l /= 2, p /= 2;
	}
}

inline void update_max(int l, int p, int val)
{
	l = l + base - 1, p = p + base + 1;
	while(l / 2 != p / 2)
	{
		if(l % 2 == 0) tree_max[l+1] = max(tree_max[l+1],val);
		if(p % 2 == 1) tree_max[p-1] = max(tree_max[p-1],val);
		l /= 2, p /= 2;
	}
}

inline int query_min(int v)
{
	int res = INF;
	v += base;
	while(v > 0)
	{
		res = min(res,tree_min[v]);
		v /= 2;
	}
	return res;
}

inline int query_max(int v)
{
	int res = -INF;
	v += base;
	while(v > 0)
	{
		res = max(res,tree_max[v]);
		v /= 2;
	}
	return res;
}

inline int query_min2(int l, int p, int idx)
{
	l = l + base - 1, p = p + base + 1;
	int res = INF;
	while(l / 2 != p / 2)
	{
		if(l % 2 == 0) res = min(res,tree_minn[idx][l+1]);
		if(p % 2 == 1) res = min(res,tree_minn[idx][p-1]);
		l /= 2, p /= 2;
	}
	return res;
}

inline int query_max2(int l, int p, int idx)
{
	l = l + base - 1, p = p + base + 1;
	int res = -INF;
	while(l / 2 != p / 2)
	{
		if(l % 2 == 0) res = max(res,tree_maxx[idx][l+1]);
		if(p % 2 == 1) res = max(res,tree_maxx[idx][p-1]);
		l /= 2, p /= 2;
	}
	return res;
}


int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	cin >> n >> k >> m;

	tree_min.assign(rozmiar_drzewa,INF);
	tree_max.assign(rozmiar_drzewa,-INF);
	rep(i,n)
	{
		tree_min[i+base] = i, tree_max[i+base] = i;
	}

	while(m--)
	{
		cin >> a >> b;
		--a,--b;
		if(a < b) update_max(a,a+k-1,b);
		else update_min(a-k+1,a,b);
	}

	rep(i,n) A_min[0][i] = query_min(i);
	rep(i,n) A_max[0][i] = query_max(i);
	for(int i = 1; i <= LG; ++i)
	{
		rep(j,rozmiar_drzewa)
		{
			tree_minn[i-1][j] = INF, tree_maxx[i-1][j] = -INF;
		}
		rep(j,n)
		{
			tree_minn[i-1][j+base] = A_min[i-1][j], tree_maxx[i-1][j+base] = A_max[i-1][j];
		}
		for(int j = base-1; j > 0; --j)
		{
			tree_minn[i-1][j] = min(tree_minn[i-1][j*2],tree_minn[i-1][j*2+1]);
			tree_maxx[i-1][j] = max(tree_maxx[i-1][j*2],tree_maxx[i-1][j*2+1]);
		}
		rep(j,n)
		{
			A_min[i][j] = min(A_min[i-1][j],query_min2(A_min[i-1][j],A_max[i-1][j],i-1)), A_max[i][j] = max(A_max[i-1][j],query_max2(A_min[i-1][j],A_max[i-1][j],i-1));
		}
	}
	rep(i,rozmiar_drzewa)
	{
		tree_minn[LG][i] = INF, tree_maxx[LG][i] = -INF;
	}
	rep(i,n)
	{
		tree_minn[LG][i+base] = A_min[LG][i], tree_maxx[LG][i+base] = A_max[LG][i];
	}
	for(int i = base-1; i > 0; --i)
	{
		tree_minn[LG][i] = min(tree_minn[LG][i*2],tree_minn[LG][i*2+1]);
		tree_maxx[LG][i] = max(tree_maxx[LG][i*2],tree_maxx[LG][i*2+1]);
	}

	cin >> q;
	while(q--)
	{
		cin >> a >> b;
		--a, --b;
		if(a == b)
		{
			cout << "0" << '\n';
			continue;
		}
		int l = a, p = a, wyn = 0;
		for(int i = LG; i >= 0; --i)
		{
			int l_zap = min(l,query_min2(l,p,i)), p_zap = max(p,query_max2(l,p,i));
			if(b < l_zap or b > p_zap)
			{
				l = l_zap, p = p_zap;
				wyn += (1<<i);
				if(i == LG)
				{
					wyn = -2;
					break;
				}
			}
		}
		cout << wyn+1 << '\n';
	}

	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 207696 KB Output is correct
2 Correct 48 ms 207720 KB Output is correct
3 Correct 52 ms 207960 KB Output is correct
4 Correct 47 ms 207700 KB Output is correct
5 Correct 47 ms 207696 KB Output is correct
6 Correct 47 ms 207708 KB Output is correct
7 Correct 47 ms 207700 KB Output is correct
8 Correct 48 ms 207696 KB Output is correct
9 Correct 46 ms 207872 KB Output is correct
10 Correct 47 ms 208076 KB Output is correct
11 Correct 48 ms 207696 KB Output is correct
12 Correct 50 ms 207864 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 207696 KB Output is correct
2 Correct 48 ms 207720 KB Output is correct
3 Correct 52 ms 207960 KB Output is correct
4 Correct 47 ms 207700 KB Output is correct
5 Correct 47 ms 207696 KB Output is correct
6 Correct 47 ms 207708 KB Output is correct
7 Correct 47 ms 207700 KB Output is correct
8 Correct 48 ms 207696 KB Output is correct
9 Correct 46 ms 207872 KB Output is correct
10 Correct 47 ms 208076 KB Output is correct
11 Correct 48 ms 207696 KB Output is correct
12 Correct 50 ms 207864 KB Output is correct
13 Correct 53 ms 207700 KB Output is correct
14 Correct 52 ms 207700 KB Output is correct
15 Correct 49 ms 207772 KB Output is correct
16 Correct 48 ms 207860 KB Output is correct
17 Correct 62 ms 207700 KB Output is correct
18 Correct 51 ms 207672 KB Output is correct
19 Correct 54 ms 207676 KB Output is correct
20 Correct 54 ms 207700 KB Output is correct
21 Correct 57 ms 207832 KB Output is correct
22 Correct 51 ms 207864 KB Output is correct
23 Correct 52 ms 207832 KB Output is correct
24 Correct 53 ms 207700 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 272 ms 208196 KB Output is correct
2 Correct 254 ms 208208 KB Output is correct
3 Correct 297 ms 208208 KB Output is correct
4 Correct 240 ms 208212 KB Output is correct
5 Correct 199 ms 208108 KB Output is correct
6 Correct 226 ms 208212 KB Output is correct
7 Correct 195 ms 208208 KB Output is correct
8 Correct 173 ms 208148 KB Output is correct
9 Correct 179 ms 208108 KB Output is correct
10 Correct 211 ms 208092 KB Output is correct
11 Correct 217 ms 208212 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 208348 KB Output is correct
2 Correct 235 ms 208192 KB Output is correct
3 Correct 537 ms 210000 KB Output is correct
4 Correct 250 ms 210600 KB Output is correct
5 Correct 268 ms 210608 KB Output is correct
6 Correct 253 ms 210624 KB Output is correct
7 Correct 318 ms 210764 KB Output is correct
8 Correct 373 ms 210772 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 208212 KB Output is correct
2 Correct 543 ms 208464 KB Output is correct
3 Correct 519 ms 208540 KB Output is correct
4 Correct 515 ms 208504 KB Output is correct
5 Correct 314 ms 208380 KB Output is correct
6 Correct 462 ms 208480 KB Output is correct
7 Correct 400 ms 208208 KB Output is correct
8 Correct 48 ms 207812 KB Output is correct
9 Correct 53 ms 207700 KB Output is correct
10 Correct 345 ms 208212 KB Output is correct
11 Correct 370 ms 208208 KB Output is correct
12 Correct 396 ms 208176 KB Output is correct
13 Correct 382 ms 208328 KB Output is correct
14 Correct 47 ms 207692 KB Output is correct
15 Correct 54 ms 207696 KB Output is correct
16 Correct 296 ms 208168 KB Output is correct
17 Correct 585 ms 208492 KB Output is correct
18 Correct 543 ms 208924 KB Output is correct
19 Correct 514 ms 208480 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 207696 KB Output is correct
2 Correct 48 ms 207720 KB Output is correct
3 Correct 52 ms 207960 KB Output is correct
4 Correct 47 ms 207700 KB Output is correct
5 Correct 47 ms 207696 KB Output is correct
6 Correct 47 ms 207708 KB Output is correct
7 Correct 47 ms 207700 KB Output is correct
8 Correct 48 ms 207696 KB Output is correct
9 Correct 46 ms 207872 KB Output is correct
10 Correct 47 ms 208076 KB Output is correct
11 Correct 48 ms 207696 KB Output is correct
12 Correct 50 ms 207864 KB Output is correct
13 Correct 53 ms 207700 KB Output is correct
14 Correct 52 ms 207700 KB Output is correct
15 Correct 49 ms 207772 KB Output is correct
16 Correct 48 ms 207860 KB Output is correct
17 Correct 62 ms 207700 KB Output is correct
18 Correct 51 ms 207672 KB Output is correct
19 Correct 54 ms 207676 KB Output is correct
20 Correct 54 ms 207700 KB Output is correct
21 Correct 57 ms 207832 KB Output is correct
22 Correct 51 ms 207864 KB Output is correct
23 Correct 52 ms 207832 KB Output is correct
24 Correct 53 ms 207700 KB Output is correct
25 Correct 272 ms 208196 KB Output is correct
26 Correct 254 ms 208208 KB Output is correct
27 Correct 297 ms 208208 KB Output is correct
28 Correct 240 ms 208212 KB Output is correct
29 Correct 199 ms 208108 KB Output is correct
30 Correct 226 ms 208212 KB Output is correct
31 Correct 195 ms 208208 KB Output is correct
32 Correct 173 ms 208148 KB Output is correct
33 Correct 179 ms 208108 KB Output is correct
34 Correct 211 ms 208092 KB Output is correct
35 Correct 217 ms 208212 KB Output is correct
36 Correct 308 ms 208348 KB Output is correct
37 Correct 235 ms 208192 KB Output is correct
38 Correct 537 ms 210000 KB Output is correct
39 Correct 250 ms 210600 KB Output is correct
40 Correct 268 ms 210608 KB Output is correct
41 Correct 253 ms 210624 KB Output is correct
42 Correct 318 ms 210764 KB Output is correct
43 Correct 373 ms 210772 KB Output is correct
44 Correct 348 ms 208212 KB Output is correct
45 Correct 543 ms 208464 KB Output is correct
46 Correct 519 ms 208540 KB Output is correct
47 Correct 515 ms 208504 KB Output is correct
48 Correct 314 ms 208380 KB Output is correct
49 Correct 462 ms 208480 KB Output is correct
50 Correct 400 ms 208208 KB Output is correct
51 Correct 48 ms 207812 KB Output is correct
52 Correct 53 ms 207700 KB Output is correct
53 Correct 345 ms 208212 KB Output is correct
54 Correct 370 ms 208208 KB Output is correct
55 Correct 396 ms 208176 KB Output is correct
56 Correct 382 ms 208328 KB Output is correct
57 Correct 47 ms 207692 KB Output is correct
58 Correct 54 ms 207696 KB Output is correct
59 Correct 296 ms 208168 KB Output is correct
60 Correct 585 ms 208492 KB Output is correct
61 Correct 543 ms 208924 KB Output is correct
62 Correct 514 ms 208480 KB Output is correct
63 Correct 433 ms 209816 KB Output is correct
64 Correct 572 ms 209956 KB Output is correct
65 Correct 477 ms 209988 KB Output is correct
66 Correct 222 ms 210880 KB Output is correct
67 Correct 458 ms 210876 KB Output is correct
68 Correct 242 ms 210600 KB Output is correct
69 Correct 242 ms 210632 KB Output is correct
70 Correct 291 ms 211028 KB Output is correct
71 Correct 491 ms 211024 KB Output is correct