Submission #997497

#	Time	Username	Problem	Language	Result	Execution time	Memory
997497		Abito	Passport (JOI23_passport)	C++17	16 / 100	12 ms	3348 KiB

passport

#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define ll long long
#define y1 YONE
typedef unsigned long long ull;
using namespace std;
const int N=305;
int dp[N][N],L[N],R[N],n,q;
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n;
    for (int i=1;i<=n;i++) cin>>L[i]>>R[i];
    for (int i=1;i<=n;i++) for (int j=i;j<=n;j++) dp[i][j]=INT_MAX;
    dp[1][n]=0;
    for (int len=n-2;len>=0;len--){
        for (int l=1;l+len<=n;l++){
            int r=l+len;
            for (int k=l;k<=r;k++){
                int l1=min(L[k],l),r1=max(R[k],r);
                dp[l][r]=min(dp[l][r],dp[l1][r1]+1);
            }
        }
    }
    cin>>q;
    while (q--){
        int x;cin>>x;
        if (dp[x][x]>=INT_MAX) cout<<-1<<endl;
        else cout<<dp[x][x]<<endl;
    }
    return 0;
}

• Subtask 1: 0 / 6
• Subtask 2: 16 / 16
• Subtask 3: 0 / 24
• Subtask 4: 0 / 8
• Subtask 5: 0 / 46