#include<bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323846
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
const int N=1e6+5,lg=30,mod=1e9+7,inf=1e9;
int node,l[N],r[N],query,dp[2505][2505];
main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> node;
for(int i=1;i<=node;++i)cin >> l[i] >> r[i];
cin >> query;
while(query--){
int i;
cin >> i;
for(int j=1;j<=node;++j)
for(int k=1;k<=node;++k)dp[j][k]=inf;
dp[l[i]][r[i]]=1;
queue<ii>p;
p.push({l[i],r[i]});
while(!p.empty()){
ii x=p.front();
p.pop();
for(int i=x.fi;i<=x.se;++i){
ii y={min(x.fi,l[i]),max(x.se,r[i])};
if(dp[y.fi][y.se]>dp[x.fi][x.se]+1){
dp[y.fi][y.se]=dp[x.fi][x.se]+1;
p.push(y);
}
}
}
int ans=dp[1][node];
if(ans==inf)ans=-1;
cout<<ans<<'\n';
}
}
Compilation message (stderr)
passport.cpp:23:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
23 | main()
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |