# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
887374 | HossamHero7 | Passport (JOI23_passport) | C++14 | 2068 ms | 28744 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int dp[2501][2501];
int n;
vector<pair<int,int>> v;
int solve(int l,int r){
if(l == 0 && r == n-1) return 0;
int &ret = dp[l][r];
if(~ret) return ret;
ret = 1e9;
for(int i=l;i<=r;i++){
int L = min(l , v[i].first);
int R = max(r , v[i].second);
if(l == L && r == R) continue;
ret = min(ret , solve(L,R) + 1);
}
return ret;
}
void solve(){
cin>>n;
v.resize(n);
for(auto &[a,b] : v) cin>>a>>b , a -- , b--;
memset(dp,-1,sizeof(dp));
int q;
cin>>q;
while(q--){
int x;
cin>>x;
x --;
int ans = solve(x,x);
cout<<(ans >= 1e9 ? -1 : ans)<<endl;
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int t=1;
//cin>>t;
while(t--){
solve();
}
return 0;
}
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... |