Submission #1314781

#TimeUsernameProblemLanguageResultExecution timeMemory
1314781dex111222333444555Passport (JOI23_passport)C++20
100 / 100
460 ms61188 KiB
#include <bits/stdc++.h> #define all(v) begin(v), end(v) #define ii pair<int, int> #define fi first #define se second #define siz(v) (int)(v).size() #define int long long using namespace std; const int MAXN = 2e5 + 5, infINT = 1e9 + 2343; template<class X, class Y> bool minimize(X &x, const Y &y){return x > y ? x = y, 1: 0;} int numNode, n, numQuery, L[MAXN], R[MAXN], query[MAXN], dist[3][MAXN]; bool visited[MAXN << 1]; vector<int> adj[MAXN << 1]; void input(){ cin >> numNode; n = numNode; for(int i = 1; i <= numNode; i++) cin >> L[i] >> R[i]; cin >> numQuery; for(int q = 1; q <= numQuery; q++) cin >> query[q]; } void addEdge(int id, int l, int r){ l--; l += n; r += n; while(l < r){ if (l & 1) adj[l++].push_back(id); if (r & 1) adj[--r].push_back(id); l >>= 1; r >>= 1; } } void dijsktra(int dist[MAXN]){ priority_queue<ii, vector<ii>, greater<ii> > q; memset(visited, 0, sizeof visited); for(int i = 1; i <= numNode; i++) if (dist[i] < infINT) q.emplace(dist[i], i); while(q.size()){ int u = q.top().se; long long len = q.top().fi; q.pop(); if (len > dist[u]) continue; int pos = u; pos--; pos += n; while(pos > 0){ if (!visited[pos]){ for(int v: adj[pos]) if (minimize(dist[v], dist[u] + 1)) q.emplace(dist[v], v); visited[pos] = 1; } pos >>= 1; } } } void solve(){ for(int i = 1; i <= numNode; i++) addEdge(i, L[i], R[i]); for(int j = 0; j < 3; j++) for(int i = 1; i <= numNode; i++) dist[j][i] = infINT; dist[0][1] = 0; dijsktra(dist[0]); dist[1][numNode] = 0; dijsktra(dist[1]); dist[0][1] = dist[1][numNode] = 1; for(int i = 1; i <= numNode; i++) dist[2][i] = dist[0][i] + dist[1][i]; dijsktra(dist[2]); for(int q = 1; q <= numQuery; q++){ int d = dist[2][query[q]]; cout << (d < infINT ? d - 1: -1) << '\n'; } } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define task "test" if (fopen(task".inp", "r")){ freopen(task".inp", "r", stdin); freopen(task".out", "w", stdout); } input(); solve(); cerr << (1.0 * clock()) / CLOCKS_PER_SEC << ".s\n"; }

Compilation message (stderr)

passport.cpp: In function 'int main()':
passport.cpp:89:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
passport.cpp:90:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...