#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define debug(x) cout<<#x<<": "<<x<<"\n"
struct node
{
int s,e,m,val,lazy;
node *l,*r;
node(int S,int E)
{
s=S;e=E;m=(s+e)/2;
val=S;lazy=1e9;
if (s!=e)
{
l=new node(s,m);
r=new node(m+1,e);
}
}
void prop()
{
if (lazy==1e9) return;
val=min(val,lazy);
if (s!=e)
{
l->lazy = min(l->lazy,lazy);
r->lazy = min(r->lazy,lazy);
}
lazy=1e9;
}
void update(int S,int E,int V)
{
if (s==S and e==E) lazy = min(lazy, V);
else
{
if (E<=m) l->update(S,E,V);
else if (S>m) r->update(S,E,V);
else
{
l->update(S,m,V);r->update(m+1,E,V);
}
l->prop();r->prop();
val=min(l->val,r->val);
}
}
int query(int S,int E)
{
prop();
if (s==S and e==E) return val;
else if (E<=m) return l->query(S,E);
else if (S>m) return r->query(S,E);
else return min(l->query(S,m), r->query(m+1,E));
}
}*lroot;
struct node2
{
int s,e,m,val,lazy;
node2 *l,*r;
node2(int S,int E)
{
s=S;e=E;m=(s+e)/2;
val=E;lazy=0;
if (s!=e)
{
l=new node2(s,m);
r=new node2(m+1,e);
}
}
void prop()
{
if (lazy==0) return;
val=max(val,lazy);
if (s!=e)
{
l->lazy = max(l->lazy,lazy);
r->lazy = max(r->lazy,lazy);
}
lazy=0;
}
void update(int S,int E,int V)
{
if (s==S and e==E) lazy = max(lazy, V);
else
{
if (E<=m) l->update(S,E,V);
else if (S>m) r->update(S,E,V);
else
{
l->update(S,m,V);r->update(m+1,E,V);
}
l->prop();r->prop();
val=max(l->val,r->val);
}
}
int query(int S,int E)
{
prop();
if (s==S and e==E) return val;
else if (E<=m) return l->query(S,E);
else if (S>m) return r->query(S,E);
else return max(l->query(S,m), r->query(m+1,E));
}
}*rroot;
signed main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// freopen("input.000","r",stdin);
// freopen("output.000","w",stdout);
// srand((unsigned)time(NULL));
// rand()
int n,k,m,a[200005],b[200005],s,t,l,lnew,r,rnew,ans,i,q;
bool stop;
cin>>n>>k>>m;
for (i=1;i<m+1;i++) cin>>a[i]>>b[i];
lroot=new node(1,n);
rroot=new node2(1,n);
for (i=1;i<m+1;i++)
if (a[i]<b[i]) rroot->update(a[i], min(a[i]+k-1,b[i]), b[i]);
else lroot->update(max(a[i]-k+1,b[i]), a[i], b[i]);
cin>>q;
for (i=1;i<q+1;i++)
{
cin>>s>>t;
ans=0;l=r=s;stop=false;
while ((t<l or t>r) and !stop)
{
lnew=lroot->query(l,r);
rnew=rroot->query(l,r);
if (l==lnew and r==rnew) stop=true;
l=lnew;r=rnew;ans++;
}
if (stop) cout<<"-1\n";else cout<<ans<<"\n";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
3540 KB |
Output is correct |
2 |
Correct |
6 ms |
3528 KB |
Output is correct |
3 |
Correct |
2 ms |
3448 KB |
Output is correct |
4 |
Correct |
2 ms |
3412 KB |
Output is correct |
5 |
Correct |
5 ms |
3412 KB |
Output is correct |
6 |
Correct |
2 ms |
3412 KB |
Output is correct |
7 |
Correct |
3 ms |
3448 KB |
Output is correct |
8 |
Correct |
2 ms |
3412 KB |
Output is correct |
9 |
Correct |
2 ms |
3444 KB |
Output is correct |
10 |
Correct |
2 ms |
3412 KB |
Output is correct |
11 |
Correct |
2 ms |
3412 KB |
Output is correct |
12 |
Correct |
2 ms |
3412 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
3540 KB |
Output is correct |
2 |
Correct |
6 ms |
3528 KB |
Output is correct |
3 |
Correct |
2 ms |
3448 KB |
Output is correct |
4 |
Correct |
2 ms |
3412 KB |
Output is correct |
5 |
Correct |
5 ms |
3412 KB |
Output is correct |
6 |
Correct |
2 ms |
3412 KB |
Output is correct |
7 |
Correct |
3 ms |
3448 KB |
Output is correct |
8 |
Correct |
2 ms |
3412 KB |
Output is correct |
9 |
Correct |
2 ms |
3444 KB |
Output is correct |
10 |
Correct |
2 ms |
3412 KB |
Output is correct |
11 |
Correct |
2 ms |
3412 KB |
Output is correct |
12 |
Correct |
2 ms |
3412 KB |
Output is correct |
13 |
Correct |
309 ms |
3964 KB |
Output is correct |
14 |
Correct |
177 ms |
3964 KB |
Output is correct |
15 |
Correct |
3 ms |
3924 KB |
Output is correct |
16 |
Correct |
5 ms |
3860 KB |
Output is correct |
17 |
Correct |
74 ms |
3924 KB |
Output is correct |
18 |
Correct |
3 ms |
3924 KB |
Output is correct |
19 |
Correct |
4 ms |
3868 KB |
Output is correct |
20 |
Correct |
4 ms |
3924 KB |
Output is correct |
21 |
Correct |
3 ms |
3924 KB |
Output is correct |
22 |
Correct |
5 ms |
3968 KB |
Output is correct |
23 |
Correct |
8 ms |
3972 KB |
Output is correct |
24 |
Correct |
8 ms |
3964 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
70 ms |
29416 KB |
Output is correct |
2 |
Correct |
76 ms |
29388 KB |
Output is correct |
3 |
Correct |
89 ms |
29592 KB |
Output is correct |
4 |
Correct |
66 ms |
29276 KB |
Output is correct |
5 |
Correct |
368 ms |
30804 KB |
Output is correct |
6 |
Correct |
157 ms |
30736 KB |
Output is correct |
7 |
Correct |
203 ms |
30428 KB |
Output is correct |
8 |
Correct |
182 ms |
29372 KB |
Output is correct |
9 |
Correct |
194 ms |
29640 KB |
Output is correct |
10 |
Correct |
190 ms |
30684 KB |
Output is correct |
11 |
Correct |
185 ms |
30776 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
2066 ms |
29612 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
350 ms |
31472 KB |
Output is correct |
2 |
Execution timed out |
2058 ms |
29784 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
3540 KB |
Output is correct |
2 |
Correct |
6 ms |
3528 KB |
Output is correct |
3 |
Correct |
2 ms |
3448 KB |
Output is correct |
4 |
Correct |
2 ms |
3412 KB |
Output is correct |
5 |
Correct |
5 ms |
3412 KB |
Output is correct |
6 |
Correct |
2 ms |
3412 KB |
Output is correct |
7 |
Correct |
3 ms |
3448 KB |
Output is correct |
8 |
Correct |
2 ms |
3412 KB |
Output is correct |
9 |
Correct |
2 ms |
3444 KB |
Output is correct |
10 |
Correct |
2 ms |
3412 KB |
Output is correct |
11 |
Correct |
2 ms |
3412 KB |
Output is correct |
12 |
Correct |
2 ms |
3412 KB |
Output is correct |
13 |
Correct |
309 ms |
3964 KB |
Output is correct |
14 |
Correct |
177 ms |
3964 KB |
Output is correct |
15 |
Correct |
3 ms |
3924 KB |
Output is correct |
16 |
Correct |
5 ms |
3860 KB |
Output is correct |
17 |
Correct |
74 ms |
3924 KB |
Output is correct |
18 |
Correct |
3 ms |
3924 KB |
Output is correct |
19 |
Correct |
4 ms |
3868 KB |
Output is correct |
20 |
Correct |
4 ms |
3924 KB |
Output is correct |
21 |
Correct |
3 ms |
3924 KB |
Output is correct |
22 |
Correct |
5 ms |
3968 KB |
Output is correct |
23 |
Correct |
8 ms |
3972 KB |
Output is correct |
24 |
Correct |
8 ms |
3964 KB |
Output is correct |
25 |
Correct |
70 ms |
29416 KB |
Output is correct |
26 |
Correct |
76 ms |
29388 KB |
Output is correct |
27 |
Correct |
89 ms |
29592 KB |
Output is correct |
28 |
Correct |
66 ms |
29276 KB |
Output is correct |
29 |
Correct |
368 ms |
30804 KB |
Output is correct |
30 |
Correct |
157 ms |
30736 KB |
Output is correct |
31 |
Correct |
203 ms |
30428 KB |
Output is correct |
32 |
Correct |
182 ms |
29372 KB |
Output is correct |
33 |
Correct |
194 ms |
29640 KB |
Output is correct |
34 |
Correct |
190 ms |
30684 KB |
Output is correct |
35 |
Correct |
185 ms |
30776 KB |
Output is correct |
36 |
Execution timed out |
2066 ms |
29612 KB |
Time limit exceeded |
37 |
Halted |
0 ms |
0 KB |
- |