oj.uz

답안 #952646

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952646 2024-03-24T12:40:37 Z LOLOLO Passport (JOI23_passport) C++17
48 / 100
 2000 ms 673760 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())

const int N = 2e5 + 10;
int lst, ss[N];
vector <pair <int, int>> ed[N * 5];

void build(int id, int l, int r) {
    if (l == r) {
        ss[l] = id;
        return;
    }

    int m = (l + r) / 2;
    ed[id * 2].pb({id, 0});
    ed[id * 2 + 1].pb({id, 0});
    build(id * 2, l, m);
    build(id * 2 + 1, m + 1, r);
}

void dfs(int id, int l, int r, int u, int v, int cur) {
    if (l > v || r < u)
        return;

    if (l >= r && u <= v) {
        ed[id].pb({cur, 0});
        return;
    }

    int m = (l + r) / 2;
    dfs(id * 2, l, m, u, v, cur);
    dfs(id * 2 + 1, m + 1, r, u, v, cur);
}

void dijkstra(vector <int> &dis, vector <int> save, vector <int> cc) {
    dis.assign(lst + 1, 2e8);
    priority_queue <pair <int, int>, vector <pair <int, int>>, greater <pair <int, int>>> pq;

    for (auto x : save) {
        pq.push({cc[x], x});
        dis[x] = cc[x];
    }

    while (sz(pq)) {
        auto t = pq.top();
        pq.pop();
        if (dis[t.s] < t.f) 
            continue;

        for (auto x : ed[t.s]) {
            if (dis[x.f] > t.f + x.s) {
                dis[x.f] = t.f + x.s;
                pq.push({dis[x.f], x.f});
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;

    lst = n * 4;
    build(1, 1, n);

    for (int i = 1; i <= n; i++) {
        int l, r;
        cin >> l >> r;
        lst++;
        ed[lst].pb({ss[i], 1});
        dfs(1, 1, n, l, r, lst);
    }

    vector <int> d1, d2, d3, cst(lst + 1, 0), id;
    dijkstra(d1, {ss[1]}, cst);
    dijkstra(d2, {ss[n]}, cst);

    for (int i = 1; i <= lst; i++) {
        id.pb(i);
        cst[i] = d1[i] + d2[i];
    }

    dijkstra(d3, id, cst);

    int q;
    cin >> q;

    while (q--) {
        int x;
        cin >> x;
        if (d3[ss[x]] >= 1e8) {
            cout << -1 << '\n';
        } else {
            cout << d3[ss[x]] << '\n';
        }
    }


    return 0;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 23896 KB Output is correct
2 Correct 5 ms 23900 KB Output is correct
3 Correct 6 ms 23900 KB Output is correct
4 Execution timed out 2112 ms 673760 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 23900 KB Output is correct
2 Correct 6 ms 23900 KB Output is correct
3 Correct 7 ms 23900 KB Output is correct
4 Correct 6 ms 23900 KB Output is correct
5 Correct 6 ms 23900 KB Output is correct
6 Correct 6 ms 23900 KB Output is correct
7 Correct 6 ms 23900 KB Output is correct
8 Correct 6 ms 23900 KB Output is correct
9 Correct 5 ms 23896 KB Output is correct
10 Correct 6 ms 23900 KB Output is correct
11 Correct 7 ms 24156 KB Output is correct
12 Correct 6 ms 23900 KB Output is correct
13 Correct 8 ms 24412 KB Output is correct
14 Correct 7 ms 24420 KB Output is correct
15 Correct 6 ms 23896 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 23900 KB Output is correct
2 Correct 6 ms 23900 KB Output is correct
3 Correct 7 ms 23900 KB Output is correct
4 Correct 6 ms 23900 KB Output is correct
5 Correct 6 ms 23900 KB Output is correct
6 Correct 6 ms 23900 KB Output is correct
7 Correct 6 ms 23900 KB Output is correct
8 Correct 6 ms 23900 KB Output is correct
9 Correct 5 ms 23896 KB Output is correct
10 Correct 6 ms 23900 KB Output is correct
11 Correct 7 ms 24156 KB Output is correct
12 Correct 6 ms 23900 KB Output is correct
13 Correct 8 ms 24412 KB Output is correct
14 Correct 7 ms 24420 KB Output is correct
15 Correct 6 ms 23896 KB Output is correct
16 Correct 41 ms 41040 KB Output is correct
17 Correct 10 ms 24924 KB Output is correct
18 Correct 78 ms 57016 KB Output is correct
19 Correct 74 ms 55380 KB Output is correct
20 Correct 9 ms 24664 KB Output is correct
21 Correct 18 ms 29276 KB Output is correct
22 Correct 73 ms 61844 KB Output is correct
23 Correct 62 ms 51284 KB Output is correct
24 Correct 60 ms 52304 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 23900 KB Output is correct
2 Correct 6 ms 23900 KB Output is correct
3 Correct 7 ms 23900 KB Output is correct
4 Correct 6 ms 23900 KB Output is correct
5 Correct 6 ms 23900 KB Output is correct
6 Correct 6 ms 23900 KB Output is correct
7 Correct 6 ms 23900 KB Output is correct
8 Correct 6 ms 23900 KB Output is correct
9 Correct 5 ms 23896 KB Output is correct
10 Correct 6 ms 23900 KB Output is correct
11 Correct 7 ms 24156 KB Output is correct
12 Correct 6 ms 23900 KB Output is correct
13 Correct 8 ms 24412 KB Output is correct
14 Correct 7 ms 24420 KB Output is correct
15 Correct 6 ms 23896 KB Output is correct
16 Correct 41 ms 41040 KB Output is correct
17 Correct 10 ms 24924 KB Output is correct
18 Correct 78 ms 57016 KB Output is correct
19 Correct 74 ms 55380 KB Output is correct
20 Correct 9 ms 24664 KB Output is correct
21 Correct 18 ms 29276 KB Output is correct
22 Correct 73 ms 61844 KB Output is correct
23 Correct 62 ms 51284 KB Output is correct
24 Correct 60 ms 52304 KB Output is correct
25 Correct 7 ms 23900 KB Output is correct
26 Correct 6 ms 23900 KB Output is correct
27 Correct 45 ms 42332 KB Output is correct
28 Correct 10 ms 24924 KB Output is correct
29 Correct 10 ms 24664 KB Output is correct
30 Correct 18 ms 29012 KB Output is correct
31 Correct 46 ms 44668 KB Output is correct

Subtask #5
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 23896 KB Output is correct
2 Correct 5 ms 23900 KB Output is correct
3 Correct 6 ms 23900 KB Output is correct
4 Execution timed out 2112 ms 673760 KB Time limit exceeded
5 Halted 0 ms 0 KB -