Submission #1279843

#	Time	Username	Problem	Language	Result	Execution time	Memory
1279843		icebear	Passport (JOI23_passport)	C++20	48 / 100	2096 ms	69632 KiB

passport

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

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class T>
    bool minimize(T &a, const T &b) {
        if (a > b) return a = b, true;
        return false;
    }

template<class T>
    bool maximize(T &a, const T &b) {
        if (a < b) return a = b, true;
        return false;
    }

#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"
/*END OF TEMPLATE. ICEBEAR AND THE CAT WILL WIN VOI26 */

const int MOD = 1e9 + 7;
const int inf = 1e8 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = 2e5 + 5;
int n, leaf[N];
vector<ii> G[N << 2];

void buildGraph(int id, int l, int r) {
    if (l == r) {
        leaf[l] = id;
        return;
    }
    int mid = (l + r) >> 1;
    buildGraph(id << 1, l, mid);
    buildGraph(id << 1 | 1, mid + 1, r);
    G[id << 1].emplace_back(id, 0);
    G[id << 1 | 1].emplace_back(id, 0);
}

void buildEdge(int id, int l, int r, int u, int v, int src) {
    if (l > v || r < u) return;
    if (u <= l && r <= v) {
        G[id].emplace_back(src, 1);
        return;
    }
    int mid = (l + r) >> 1;
    buildEdge(id << 1, l, mid, u, v, src);
    buildEdge(id << 1 | 1, mid + 1, r, u, v, src);
}

int dist[2][N << 2];
ll dist_any[N << 2];

void BFS(int u, int dist[]) {
    queue<int> q;
    FOR(i, 1, 4 * n) dist[i] = inf;
    q.push(leaf[u]);
    dist[leaf[u]] = 0;

    while(!q.empty()) {
        int u = q.front(); q.pop();
        for(ii x : G[u]) {
            int v, w; tie(v, w) = x;
            if (minimize(dist[v], dist[u] + w)) q.push(v);
        }
    }
}

void dijkstra(ll d[]) {
    FOR(i, 1, 4 * n) d[i] = inf;
    FOR(i, 1, n) d[leaf[i]] = min(inf, dist[0][leaf[i]] + dist[1][leaf[i]] - (i != 1 && i != n));
    priority_queue<ii, vector<ii>, greater<ii>> Q;
    FOR(i, 1, n) Q.push(mp(d[leaf[i]], leaf[i]));
    while(!Q.empty()) {
        int du, u; tie(du, u) = Q.top(); Q.pop();
        if (du != d[u]) continue;
        for(ii x : G[u]) {
            int v, w; tie(v, w) = x;
            if (minimize(d[v], d[u] + w))
                Q.push(mp(d[v], v));
        }
    }
}

void init(void) {
    cin >> n;
    buildGraph(1, 1, n);
    FOR(i, 1, n) {
        int l, r;
        cin >> l >> r;
        buildEdge(1, 1, n, l, r, leaf[i]);
    }
}

void process(void) {
    BFS(1, dist[0]);
    BFS(n, dist[1]);
    dijkstra(dist_any);

    int q; cin >> q;
    while(q--) {
        int x; cin >> x;
        cout << (dist_any[leaf[x]] == inf ? -1 : dist_any[leaf[x]]) << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int tc = 1;
//    cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}

Compilation message (stderr)

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

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