제출 #1102931

#제출 시각아이디문제언어결과실행 시간메모리
1102931otariusPassport (JOI23_passport)C++17
0 / 100
6 ms27216 KiB
#include <bits/stdc++.h> #include <bits/extc++.h> using namespace __gnu_pbds; using namespace std; // #pragma GCC optimize("Ofast") // #pragma GCC optimize ("unroll-loops") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define ff first #define sc second #define pb push_back #define ll long long #define pll pair<ll, ll> #define pii pair<int, int> #define ull unsigned long long #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() // #define int long long // #define int unsigned long long // #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update> // #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update> void open_file(string filename) { freopen((filename + ".in").c_str(), "r", stdin); freopen((filename + ".out").c_str(), "w", stdout); } // const ll mod = 1e9 + 7; // const ll mod = 998244353; const ll inf = 1e9; const ll biginf = 1e18; const int maxN = 1e6 + 305; vector<int> g[maxN]; int n, q, d[3][maxN]; int build(int v, int tl, int tr) { if (tl == tr) return tl; int tm = (tl + tr) / 2; int x = build(2 * v, tl, tm); int y = build(2 * v + 1, tm + 1, tr); g[x].pb(v); g[y].pb(v); return v + n; } void update(int v, int tl, int tr, int l, int r, int pos) { if (r < tl || tr < l) return; if (l <= tl && tr <= r) { if (tl == tr) g[tl].pb(pos); else g[v + n].pb(pos); return; } int tm = (tl + tr) / 2; update(2 * v, tl, tm, l, r, pos); update(2 * v + 1, tm + 1, tr, l, r, pos); } void dijkstra(int _) { set<pii> st; for (int i = 1; i <= n; i++) { if (d[_][i]) st.insert({d[_][i], i}); else d[_][i] = maxN; } while (!st.empty()) { pii cur = *st.begin(); st.erase(st.begin()); int w = cur.ff, x = cur.sc; for (int u : g[x]) { if (u <= n && d[_][u] > w + 1) { st.erase({d[_][u], u}); d[_][u] = w + 1; st.insert({d[_][u], u}); } else if (d[_][u] > w) { st.erase({d[_][u], u}); d[_][u] = w; st.insert({d[_][u], u}); } } } } void solve() { cin >> n; build(1, 1, n); int l[n + 1], r[n + 1]; for (int i = 1; i <= n; i++) { cin >> l[i] >> r[i]; update(1, 1, n, l[i], r[i], i); } for (int i = 1; i <= n; i++) if (r[i] == n) d[1][i] = 1; dijkstra(1); cin >> q; while (q--) { int x; cin >> x; cout << (d[1][x] > n ? -1 : d[1][x]) << '\n'; } } int32_t main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int t = 1; // cin >> t; while (t--) { solve(); cout << '\n'; } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

passport.cpp: In function 'void open_file(std::string)':
passport.cpp:27:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
passport.cpp:28:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     freopen((filename + ".out").c_str(), "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...