# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1250216 | hainam2k9 | Passport (JOI23_passport) | C++20 | 756 ms | 829204 KiB |
#include <bits/stdc++.h>
#define tt cin.tie(0), cout.tie(0), ios_base::sync_with_stdio(0)
#define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define db long double
#define sz(a) ((int)(a).size())
#define pb emplace_back
#define pf emplace_front
#define pob pop_back
#define pof pop_front
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define ins emplace
#define mp make_pair
using namespace std;
const int MOD = 1e9+7, MAXN = 2e5+5;
const string NAME = "";
int n,q,rs[3005],dist[3005];
vector<int> adj[3005];
int bfs(int u){
memset(dist,0x3f,sizeof(dist));
queue<int> q;
dist[u]=0, q.ins(u);
while(!q.empty()){
u=q.front();
q.pop();
for(int& v : adj[u])
if(dist[v]>dist[u]+1) dist[v]=dist[u]+1, q.ins(v);
}
return max(dist[1],dist[n])>n ? -1 : max(dist[1],dist[n]);
}
int main()
{
tt;
if(fopen((NAME + ".INP").c_str(), "r")) fo;
cin >> n;
for(int i = 1; i<=n; ++i){
int l,r;
cin >> l >> r;
for(int j = l; j<=r; ++j)
if(j!=i) adj[i].pb(j);
}
for(int i = 1; i<=n; ++i)
rs[i]=bfs(i);
cin >> q;
while(q--){
int x;
cin >> x;
cout << rs[x] << "\n";
}
}
Compilation message (stderr)
# | 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... |