oj.uz

Submission #944303

# Submission time Handle Problem Language Result Execution time Memory
944303 2024-03-12T14:23:13 Z becaido Passport (JOI23_passport) C++17
100 / 100
 486 ms 68308 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout(T t, U...u) {cout << t << (sizeof...(u) ? ", " : ""), dout(u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

#define lpos pos*2
#define rpos pos*2+1

const int INF = 1e9;
const int SIZE = 2e5 + 5;
const int TSIZ = SIZE << 1;

int n, m, sz;
vector<pair<int, int>> adj[TSIZ];
int id[SIZE << 2], dis1[TSIZ], disn[TSIZ], dp[TSIZ];

void build(int pos, int l, int r) {
    id[pos] = (l == r ? l : ++sz);
    if (pos > 1) adj[id[pos]].pb(id[pos >> 1], 0);
    if (l < r) {
        int mid = (l + r) / 2;
        build(lpos, l, mid);
        build(rpos, mid + 1, r);
    }
}
void add(int pos, int l, int r, int L, int R, int i) {
    if (l == L && r == R) {
        adj[id[pos]].pb(i, 1);
        return;
    }
    int mid = (L + R) / 2;
    if (r <= mid) add(lpos, l, r, L, mid, i);
    else if (l > mid) add(rpos, l, r, mid + 1, R, i);
    else {
        add(lpos, l, mid, L, mid, i);
        add(rpos, mid + 1, r, mid + 1, R, i);
    }
}

void cal_dis(int s, int *dis) {
    fill(dis + 1, dis + sz + 1, INF);
    deque<int> q;
    dis[s] = 0, q.pb(s);
    while (q.size()) {
        int pos = q.front();
        q.pop_front();
        for (auto [np, w] : adj[pos]) if (dis[pos] + w < dis[np]) {
            dis[np] = dis[pos] + w;
            if (w == 0) q.emplace_front(np);
            else q.pb(np);
        }
    }
}

void solve() {
    cin >> n;
    sz = n, build(1, 1, n);
    FOR (i, 1, n) {
        int l, r;
        cin >> l >> r;
        add(1, l, r, 1, n, i);
    }
    cal_dis(1, dis1);
    cal_dis(n, disn);
    fill(dp + 1, dp + sz + 1, INF);
    FOR (i, 1, n) dp[i] = dis1[i] + disn[i] - (i != 1 && i != n);
    iota(id + 1, id + n + 1, 1);
    sort(id + 1, id + n + 1, [&](int l, int r) {
        return dp[l] < dp[r];
    });
    deque<int> q;
    FOR (i, 1, n) q.pb(id[i]);
    while (q.size()) {
        int pos = q.front();
        q.pop_front();
        for (auto [np, w] : adj[pos]) if (dp[pos] + w < dp[np]) {
            dp[np] = dp[pos] + w;
            if (w == 0) q.emplace_front(np);
            else q.pb(np);
        }
    }
    cin >> m;
    while (m--) {
        int i;
        cin >> i;
        cout << (dp[i] >= INF ? -1 : dp[i]) << '\n';
    }
}

int main() {
    Waimai;
    solve();
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 4 ms 17500 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 432 ms 61436 KB Output is correct
5 Correct 174 ms 41288 KB Output is correct
6 Correct 104 ms 36548 KB Output is correct
7 Correct 59 ms 33716 KB Output is correct
8 Correct 66 ms 41260 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 4 ms 17508 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 5 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 4 ms 17500 KB Output is correct
10 Correct 4 ms 17500 KB Output is correct
11 Correct 4 ms 17756 KB Output is correct
12 Correct 4 ms 17500 KB Output is correct
13 Correct 4 ms 17500 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 4 ms 17508 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 5 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 4 ms 17500 KB Output is correct
10 Correct 4 ms 17500 KB Output is correct
11 Correct 4 ms 17756 KB Output is correct
12 Correct 4 ms 17500 KB Output is correct
13 Correct 4 ms 17500 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct
16 Correct 7 ms 17764 KB Output is correct
17 Correct 6 ms 17756 KB Output is correct
18 Correct 6 ms 18012 KB Output is correct
19 Correct 6 ms 18012 KB Output is correct
20 Correct 5 ms 17756 KB Output is correct
21 Correct 5 ms 17756 KB Output is correct
22 Correct 5 ms 18008 KB Output is correct
23 Correct 5 ms 17756 KB Output is correct
24 Correct 5 ms 17916 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 17500 KB Output is correct
2 Correct 4 ms 17508 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 4 ms 17500 KB Output is correct
5 Correct 4 ms 17500 KB Output is correct
6 Correct 4 ms 17500 KB Output is correct
7 Correct 5 ms 17500 KB Output is correct
8 Correct 4 ms 17496 KB Output is correct
9 Correct 4 ms 17500 KB Output is correct
10 Correct 4 ms 17500 KB Output is correct
11 Correct 4 ms 17756 KB Output is correct
12 Correct 4 ms 17500 KB Output is correct
13 Correct 4 ms 17500 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 4 ms 17500 KB Output is correct
16 Correct 7 ms 17764 KB Output is correct
17 Correct 6 ms 17756 KB Output is correct
18 Correct 6 ms 18012 KB Output is correct
19 Correct 6 ms 18012 KB Output is correct
20 Correct 5 ms 17756 KB Output is correct
21 Correct 5 ms 17756 KB Output is correct
22 Correct 5 ms 18008 KB Output is correct
23 Correct 5 ms 17756 KB Output is correct
24 Correct 5 ms 17916 KB Output is correct
25 Correct 4 ms 17500 KB Output is correct
26 Correct 4 ms 17500 KB Output is correct
27 Correct 6 ms 17752 KB Output is correct
28 Correct 6 ms 17752 KB Output is correct
29 Correct 6 ms 17756 KB Output is correct
30 Correct 5 ms 17752 KB Output is correct
31 Correct 5 ms 17752 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 17500 KB Output is correct
2 Correct 4 ms 17500 KB Output is correct
3 Correct 4 ms 17500 KB Output is correct
4 Correct 432 ms 61436 KB Output is correct
5 Correct 174 ms 41288 KB Output is correct
6 Correct 104 ms 36548 KB Output is correct
7 Correct 59 ms 33716 KB Output is correct
8 Correct 66 ms 41260 KB Output is correct
9 Correct 4 ms 17500 KB Output is correct
10 Correct 4 ms 17508 KB Output is correct
11 Correct 4 ms 17500 KB Output is correct
12 Correct 4 ms 17500 KB Output is correct
13 Correct 4 ms 17500 KB Output is correct
14 Correct 4 ms 17500 KB Output is correct
15 Correct 5 ms 17500 KB Output is correct
16 Correct 4 ms 17496 KB Output is correct
17 Correct 4 ms 17500 KB Output is correct
18 Correct 4 ms 17500 KB Output is correct
19 Correct 4 ms 17756 KB Output is correct
20 Correct 4 ms 17500 KB Output is correct
21 Correct 4 ms 17500 KB Output is correct
22 Correct 4 ms 17500 KB Output is correct
23 Correct 4 ms 17500 KB Output is correct
24 Correct 7 ms 17764 KB Output is correct
25 Correct 6 ms 17756 KB Output is correct
26 Correct 6 ms 18012 KB Output is correct
27 Correct 6 ms 18012 KB Output is correct
28 Correct 5 ms 17756 KB Output is correct
29 Correct 5 ms 17756 KB Output is correct
30 Correct 5 ms 18008 KB Output is correct
31 Correct 5 ms 17756 KB Output is correct
32 Correct 5 ms 17916 KB Output is correct
33 Correct 4 ms 17500 KB Output is correct
34 Correct 4 ms 17500 KB Output is correct
35 Correct 6 ms 17752 KB Output is correct
36 Correct 6 ms 17752 KB Output is correct
37 Correct 6 ms 17756 KB Output is correct
38 Correct 5 ms 17752 KB Output is correct
39 Correct 5 ms 17752 KB Output is correct
40 Correct 486 ms 63484 KB Output is correct
41 Correct 194 ms 43960 KB Output is correct
42 Correct 289 ms 68308 KB Output is correct
43 Correct 276 ms 68000 KB Output is correct
44 Correct 130 ms 39092 KB Output is correct
45 Correct 186 ms 45724 KB Output is correct
46 Correct 59 ms 26964 KB Output is correct
47 Correct 178 ms 46648 KB Output is correct
48 Correct 244 ms 54180 KB Output is correct