Submission #1250967

#	Time	Username	Problem	Language	Result	Execution time	Memory
1250967		hainam2k9	Passport (JOI23_passport)	C++20	100 / 100	530 ms	79648 KiB

passport

#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,pos[MAXN];
int dist1[MAXN<<2],distn[MAXN<<2],rs[MAXN<<2];
vector<pair<int,int>> adj[MAXN<<2];
void build(int id, int l, int r){
    if(l==r) return pos[l]=id, void();
    int mid=(l+r)>>1;
    build(id<<1,l,mid);
    build(id<<1|1,mid+1,r);
    adj[id<<1].pb(id,0), adj[id<<1|1].pb(id,0);
}
void update(int id, int l, int r, int u, int v, int pos){
    if(v<l||r<u) return;
    if(u<=l&&r<=v) return adj[id].pb(pos,1), void();
    int mid=(l+r)>>1;
    update(id<<1,l,mid,u,v,pos);
    update(id<<1|1,mid+1,r,u,v,pos);
}
void bfs1(int u, int dist[]){
    deque<int> dq;
    dist[u]=0, dq.pb(u);
    while(!dq.empty()){
        u=dq.front(), dq.pof();
        for(pair<int,int>& e : adj[u]){
            if(dist[e.fi]>dist[u]+e.se){
                dist[e.fi]=dist[u]+e.se;
                if(e.se) dq.pb(e.fi);
                else dq.pf(e.fi);
            }
        }
    }
}
void dijkstra(){
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
    for(int i = 1; i<=n; ++i)
        rs[pos[i]]=dist1[pos[i]]+distn[pos[i]]-(i!=1&&i!=n), pq.ins(rs[pos[i]],pos[i]);
    while(!pq.empty()){
        pair<int,int> top = pq.top();
        pq.pop();
        if(top.fi>rs[top.se]) continue;
        for(pair<int,int>& e : adj[top.se])
            if(rs[e.fi]>top.fi+e.se) rs[e.fi]=top.fi+e.se, pq.ins(rs[e.fi],e.fi);
    }
}
int main()
{
    tt;
    if(fopen((NAME + ".INP").c_str(), "r")) fo;
    cin >> n;
    build(1,1,n);
    for(int i = 1; i<=n; ++i){
        int l,r;
        cin >> l >> r;
        update(1,1,n,l,r,pos[i]);
    }
    memset(dist1,0x3f,sizeof(dist1));
    memset(distn,0x3f,sizeof(distn));
    memset(rs,0x3f,sizeof(rs));
    bfs1(pos[1],dist1);
    bfs1(pos[n],distn);
    dijkstra();
    cin >> q;
    while(q--){
        int x;
        cin >> x;
        cout << (rs[pos[x]]>n ? -1 : rs[pos[x]]) << "\n";
    }
}

Compilation message (stderr)

passport.cpp: In function 'int main()':
passport.cpp:3:19: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    3 | #define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
      |            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
passport.cpp:68:45: note: in expansion of macro 'fo'
   68 |     if(fopen((NAME + ".INP").c_str(), "r")) fo;
      |                                             ^~
passport.cpp:3:63: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    3 | #define fo freopen((NAME+".INP").c_str(), "r", stdin), freopen((NAME+".OUT").c_str(), "w", stdout)
      |                                                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
passport.cpp:68:45: note: in expansion of macro 'fo'
   68 |     if(fopen((NAME + ".INP").c_str(), "r")) fo;
      |                                             ^~

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