#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 = 1e5+5, base = (1<<17), rozmiar_drzewa = base * 2, INF = 1e9+50, LG = 17;
int n = 0, k = 0, m = 0, q = 0, a = 0, b = 0;
vector<int> tree_min;
vector<int> tree_max;
int lewy[MAXN];
int prawy[MAXN];
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(j,rozmiar_drzewa)
{
tree_minn[LG][j] = INF, tree_maxx[LG][j] = -INF;
}
rep(j,n)
{
tree_minn[LG][j+base] = A_min[LG][j], tree_maxx[LG][j+base] = A_max[LG][j];
}
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]);
}
return 0;
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(wyn == 262143) cout << "-1" << '\n';
else cout << wyn+1 << '\n';
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
53852 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
53852 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
222 ms |
53972 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
129 ms |
53840 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
308 ms |
54236 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
12 ms |
53852 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
