Submission #745099

#	Time	Username	Problem	Language	Result	Execution time	Memory
745099		onebit1024	Passport (JOI23_passport)	C++17	0 / 100	1 ms	212 KiB

passport

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define all(c) c.begin(), c.end()
#define endl "\n"

const double PI=3.141592653589;


void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define dbg(x...) cerr << "LINE(" << __LINE__ << ") -> " <<"[" << #x << "] = ["; _print(x)
#else
#define dbg(x...)
#endif



void solve()
{
    int n;
    cin >> n;
    vector<pair<int,int>>range(n+1);
    for(int i = 1;i<=n;++i){
        int l,r;
        cin >> l >> r;
        range[i] = {l,r};
    }

    int Q;
    cin >> Q;
    while(Q--){
        int x;
        cin >> x;
        vector<vector<int>>dist(n+1, vector<int>(n+1,1e18));
        vector<vector<int>>visited(n+1, vector<int>(n+1,0));

        priority_queue<vector<int>,vector<vector<int>>,greater<vector<int>>>pq;
        dist[range[x].first][range[x].second] = 1;
        pq.push({1,range[x].first,range[x].second});
        while(!pq.empty()){
            int l = pq.top()[1] ,r = pq.top()[2];
            pq.pop();
            if(visited[l][r])continue;
            visited[l][r] = 1;
            for(int i = l;i<=r;++i){
                for(int j = r+1;j<=range[i].second;++j){
                    for(int k = j-1;k>=range[i].first;--k){
                        int curr_dist = dist[k][j], new_dist = dist[l][r]+1;
                        if(new_dist < curr_dist){
                            pq.push({new_dist,k,j});
                            dist[k][j] = new_dist;
                        }
                    }
                }
            }
        }
        int res = dist[1][n];
        if(res>=1e18)res = -1;
        cout << res << endl;
    }
}   
/*
5
1 1
2 3
1 5
3 4
5 5
1
2
*/
int32_t main()
{

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);


    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    

    int T=1;
    for(int i = 1;i<=T;++i)
    {
        // cout << "Case #" << i << ": ";
        solve();
    }
}

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