#include <bits/stdc++.h>
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
using namespace std;
#define int long long
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(int i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(int i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) (int)v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>
const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 1;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (gcd)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (lcm)
// HERE IS THE SOLUTION
vi mxTree , mnTree ;
int n;
pii comb(pii a , pii b)
{
return {min(a.fi , b.fi) , max(a.se , b.se)};
}
void build()
{
while(__builtin_popcount(n) != 1)
n++;
mxTree.assign(2*n , 0);
mnTree.assign(2*n , n + 1);
}
void upd(int node , int L , int R , int l , int r , int x , bool type)
{
if(l <= L && R <= r)
{
if(!type)
mxTree[node] = max(mxTree[node] , x);
else
mnTree[node] = min(mnTree[node] , x);
return ;
}
if(l > R || L > r)
return ;
int mid = (L + R)/2;
upd(2*node , L , mid , l , r , x , type);
upd(2*node + 1 , mid + 1 , R , l , r , x , type);
}
int getMax(int i)
{
int ans = i;
for(int j = (i + n); j>= 1;j/=2)
{
ans = max(ans , mxTree[j]);
}
return ans;
}
int getMin(int i)
{
int ans = i;
for(int j = (i + n); j>= 1;j/=2)
{
ans = min(ans , mnTree[j]);
}
return ans;
}
struct
{
vii tree;
int lim;
void init(int N , vii a)
{
lim = N + 1;
while(__builtin_popcount(lim) != 1)
{
a.pb({INF , -INF});
lim++;
}
tree.resize(2*lim);
forr(i , 0 , lim - 1)
{
tree[i + lim] = a[i];
}
forn(i , lim - 1 ,0)
{
tree[i] = comb(tree[2*i] , tree[2*i +1 ]);
}
}
pii query(int node , int L , int R , int l , int r)
{
if(l <= L && R <= r)
{
return tree[node];
}
if(l > R || L > r)
return {INF , -INF};
int mid = (L + R)/2;
return comb(query(2*node , L , mid , l , r) , query(2*node+ 1 , mid + 1 , R , l , r));
}
pii query(int l , int r)
{
return query(1 , 0 , lim - 1 , l , r);
}
} tree[20];
signed main()
{
boost;
cin.tie(0);
cout.tie(0);
int N , K , M;
cin>>N>>K>>M;
n = N +1;
build();
vector<vector<pii>> adj(20, vii(N + 1));
forr(i , 1 , N)
{
adj[0][i] = {i , i};
}
fore(i , M)
{
int A , B;
cin>>A>>B;
if(A < B)
{
upd(1 , 0 , n - 1 , A , min(B - 1 , A + K - 1) , B , 0);
}
else
{
upd(1 , 0 , n - 1 , max(B + 1 , A - K + 1) , A , B , 1);
}
}
forr(i , 1 , N)
{
adj[0][i].first = getMin(i);
adj[0][i].second = getMax(i);
}
forr(lg , 1 , 19)
{
tree[lg - 1].init(N , adj[lg - 1]);
forr(i , 1 , N)
{
adj[lg][i] = tree[lg - 1].query(adj[lg - 1][i].first , adj[lg- 1][i].second);
}
}
int Q;
cin>>Q;
while(Q--)
{
int S , T;
cin>>S>>T;
int ans = 0;
pii cur = {S , S};
forn(i , 18 , 0)
{
pii ncur = tree[i].query(cur.first , cur.second);
if(ncur.first <= T && T <= ncur.second)
continue;
cur = ncur ;
ans+=(1<<i);
}
if(ans >= 524287)
cout<<-1<<nl;
else
cout<<ans + 1<<nl;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1016 KB |
Output is correct |
2 |
Correct |
2 ms |
860 KB |
Output is correct |
3 |
Correct |
1 ms |
1012 KB |
Output is correct |
4 |
Correct |
1 ms |
860 KB |
Output is correct |
5 |
Correct |
1 ms |
856 KB |
Output is correct |
6 |
Correct |
1 ms |
856 KB |
Output is correct |
7 |
Correct |
2 ms |
860 KB |
Output is correct |
8 |
Correct |
1 ms |
860 KB |
Output is correct |
9 |
Correct |
2 ms |
860 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
2 ms |
856 KB |
Output is correct |
12 |
Correct |
2 ms |
860 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1016 KB |
Output is correct |
2 |
Correct |
2 ms |
860 KB |
Output is correct |
3 |
Correct |
1 ms |
1012 KB |
Output is correct |
4 |
Correct |
1 ms |
860 KB |
Output is correct |
5 |
Correct |
1 ms |
856 KB |
Output is correct |
6 |
Correct |
1 ms |
856 KB |
Output is correct |
7 |
Correct |
2 ms |
860 KB |
Output is correct |
8 |
Correct |
1 ms |
860 KB |
Output is correct |
9 |
Correct |
2 ms |
860 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
2 ms |
856 KB |
Output is correct |
12 |
Correct |
2 ms |
860 KB |
Output is correct |
13 |
Correct |
9 ms |
2396 KB |
Output is correct |
14 |
Correct |
9 ms |
2392 KB |
Output is correct |
15 |
Correct |
5 ms |
2396 KB |
Output is correct |
16 |
Correct |
9 ms |
2392 KB |
Output is correct |
17 |
Correct |
9 ms |
2468 KB |
Output is correct |
18 |
Correct |
7 ms |
2392 KB |
Output is correct |
19 |
Correct |
8 ms |
2396 KB |
Output is correct |
20 |
Correct |
7 ms |
2464 KB |
Output is correct |
21 |
Correct |
5 ms |
2396 KB |
Output is correct |
22 |
Correct |
7 ms |
2396 KB |
Output is correct |
23 |
Correct |
8 ms |
2396 KB |
Output is correct |
24 |
Correct |
7 ms |
2268 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
371 ms |
118588 KB |
Output is correct |
2 |
Correct |
383 ms |
118480 KB |
Output is correct |
3 |
Correct |
387 ms |
118616 KB |
Output is correct |
4 |
Correct |
343 ms |
118288 KB |
Output is correct |
5 |
Correct |
385 ms |
119888 KB |
Output is correct |
6 |
Correct |
386 ms |
119860 KB |
Output is correct |
7 |
Correct |
401 ms |
120164 KB |
Output is correct |
8 |
Correct |
349 ms |
119100 KB |
Output is correct |
9 |
Correct |
398 ms |
118920 KB |
Output is correct |
10 |
Correct |
360 ms |
119820 KB |
Output is correct |
11 |
Correct |
349 ms |
119652 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
581 ms |
120332 KB |
Output is correct |
2 |
Correct |
549 ms |
120608 KB |
Output is correct |
3 |
Correct |
522 ms |
120180 KB |
Output is correct |
4 |
Correct |
487 ms |
120160 KB |
Output is correct |
5 |
Correct |
501 ms |
121012 KB |
Output is correct |
6 |
Correct |
475 ms |
120372 KB |
Output is correct |
7 |
Correct |
492 ms |
121356 KB |
Output is correct |
8 |
Correct |
604 ms |
120764 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
708 ms |
121440 KB |
Output is correct |
2 |
Correct |
692 ms |
120700 KB |
Output is correct |
3 |
Correct |
702 ms |
119600 KB |
Output is correct |
4 |
Correct |
589 ms |
118456 KB |
Output is correct |
5 |
Correct |
477 ms |
118540 KB |
Output is correct |
6 |
Correct |
479 ms |
118068 KB |
Output is correct |
7 |
Correct |
463 ms |
119584 KB |
Output is correct |
8 |
Correct |
2 ms |
856 KB |
Output is correct |
9 |
Correct |
8 ms |
2396 KB |
Output is correct |
10 |
Correct |
395 ms |
120360 KB |
Output is correct |
11 |
Correct |
486 ms |
120212 KB |
Output is correct |
12 |
Correct |
479 ms |
120412 KB |
Output is correct |
13 |
Correct |
500 ms |
120388 KB |
Output is correct |
14 |
Correct |
1 ms |
856 KB |
Output is correct |
15 |
Correct |
9 ms |
2396 KB |
Output is correct |
16 |
Correct |
355 ms |
119740 KB |
Output is correct |
17 |
Correct |
641 ms |
120440 KB |
Output is correct |
18 |
Correct |
607 ms |
121428 KB |
Output is correct |
19 |
Correct |
544 ms |
120492 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1016 KB |
Output is correct |
2 |
Correct |
2 ms |
860 KB |
Output is correct |
3 |
Correct |
1 ms |
1012 KB |
Output is correct |
4 |
Correct |
1 ms |
860 KB |
Output is correct |
5 |
Correct |
1 ms |
856 KB |
Output is correct |
6 |
Correct |
1 ms |
856 KB |
Output is correct |
7 |
Correct |
2 ms |
860 KB |
Output is correct |
8 |
Correct |
1 ms |
860 KB |
Output is correct |
9 |
Correct |
2 ms |
860 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
2 ms |
856 KB |
Output is correct |
12 |
Correct |
2 ms |
860 KB |
Output is correct |
13 |
Correct |
9 ms |
2396 KB |
Output is correct |
14 |
Correct |
9 ms |
2392 KB |
Output is correct |
15 |
Correct |
5 ms |
2396 KB |
Output is correct |
16 |
Correct |
9 ms |
2392 KB |
Output is correct |
17 |
Correct |
9 ms |
2468 KB |
Output is correct |
18 |
Correct |
7 ms |
2392 KB |
Output is correct |
19 |
Correct |
8 ms |
2396 KB |
Output is correct |
20 |
Correct |
7 ms |
2464 KB |
Output is correct |
21 |
Correct |
5 ms |
2396 KB |
Output is correct |
22 |
Correct |
7 ms |
2396 KB |
Output is correct |
23 |
Correct |
8 ms |
2396 KB |
Output is correct |
24 |
Correct |
7 ms |
2268 KB |
Output is correct |
25 |
Correct |
371 ms |
118588 KB |
Output is correct |
26 |
Correct |
383 ms |
118480 KB |
Output is correct |
27 |
Correct |
387 ms |
118616 KB |
Output is correct |
28 |
Correct |
343 ms |
118288 KB |
Output is correct |
29 |
Correct |
385 ms |
119888 KB |
Output is correct |
30 |
Correct |
386 ms |
119860 KB |
Output is correct |
31 |
Correct |
401 ms |
120164 KB |
Output is correct |
32 |
Correct |
349 ms |
119100 KB |
Output is correct |
33 |
Correct |
398 ms |
118920 KB |
Output is correct |
34 |
Correct |
360 ms |
119820 KB |
Output is correct |
35 |
Correct |
349 ms |
119652 KB |
Output is correct |
36 |
Correct |
581 ms |
120332 KB |
Output is correct |
37 |
Correct |
549 ms |
120608 KB |
Output is correct |
38 |
Correct |
522 ms |
120180 KB |
Output is correct |
39 |
Correct |
487 ms |
120160 KB |
Output is correct |
40 |
Correct |
501 ms |
121012 KB |
Output is correct |
41 |
Correct |
475 ms |
120372 KB |
Output is correct |
42 |
Correct |
492 ms |
121356 KB |
Output is correct |
43 |
Correct |
604 ms |
120764 KB |
Output is correct |
44 |
Correct |
708 ms |
121440 KB |
Output is correct |
45 |
Correct |
692 ms |
120700 KB |
Output is correct |
46 |
Correct |
702 ms |
119600 KB |
Output is correct |
47 |
Correct |
589 ms |
118456 KB |
Output is correct |
48 |
Correct |
477 ms |
118540 KB |
Output is correct |
49 |
Correct |
479 ms |
118068 KB |
Output is correct |
50 |
Correct |
463 ms |
119584 KB |
Output is correct |
51 |
Correct |
2 ms |
856 KB |
Output is correct |
52 |
Correct |
8 ms |
2396 KB |
Output is correct |
53 |
Correct |
395 ms |
120360 KB |
Output is correct |
54 |
Correct |
486 ms |
120212 KB |
Output is correct |
55 |
Correct |
479 ms |
120412 KB |
Output is correct |
56 |
Correct |
500 ms |
120388 KB |
Output is correct |
57 |
Correct |
1 ms |
856 KB |
Output is correct |
58 |
Correct |
9 ms |
2396 KB |
Output is correct |
59 |
Correct |
355 ms |
119740 KB |
Output is correct |
60 |
Correct |
641 ms |
120440 KB |
Output is correct |
61 |
Correct |
607 ms |
121428 KB |
Output is correct |
62 |
Correct |
544 ms |
120492 KB |
Output is correct |
63 |
Correct |
617 ms |
119460 KB |
Output is correct |
64 |
Correct |
699 ms |
120156 KB |
Output is correct |
65 |
Correct |
641 ms |
119276 KB |
Output is correct |
66 |
Correct |
567 ms |
120628 KB |
Output is correct |
67 |
Correct |
632 ms |
120876 KB |
Output is correct |
68 |
Correct |
475 ms |
120116 KB |
Output is correct |
69 |
Correct |
484 ms |
120316 KB |
Output is correct |
70 |
Correct |
513 ms |
120760 KB |
Output is correct |
71 |
Correct |
614 ms |
121108 KB |
Output is correct |