oj.uz

답안 #768720

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768720 2023-06-28T13:55:20 Z danikoynov Passport (JOI23_passport) C++14
100 / 100
 620 ms 73076 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 2e5 + 10;


vector < pair < int, int > > adj[maxn * 2];
int dist[maxn * 2], lf[maxn * 2], rf[maxn * 2];
int fict, root, toi;


int build(int left, int right)
{
    ///cout << left << " :: " << right << " " << fict << endl;
    if (left == right)
        return left;
    int mid = (left + right) / 2;
    int left_child = build(left, mid);
    int right_child = build(mid + 1, right);
    int ver = ++ fict;
    adj[left_child].push_back({ver, 0});
    adj[right_child].push_back({ver, 0});
    //cout << left_child << " " << ver << " " << 0 << endl;
    //cout << right_child << " " << ver << " " << 0 << endl;
    lf[ver] = left_child;
    rf[ver] = right_child;
    return ver;
}
void graph(int _n)
{
    toi = _n;
    fict = _n;
    root = build(1, _n);

}

void range_update(int node, int l, int r, int ql, int qr, int v)
{
    if (l > qr || r < ql)
        return;

    if (l >= ql && r <= qr)
    {
        adj[node].push_back({v, 1});
        ///cout << "make edge " << node << " " << l << " " << r << " " << v << endl;
        ///cout << node << " " << v << " " << 1 << endl;
        return;
    }

    int m = (l + r) / 2;
    range_update(lf[node], l, m, ql, qr, v);
    range_update(rf[node], m + 1, r, ql, qr, v);
}
void add_range_edge(int l, int r, int v)
{
    range_update(root, 1, toi, l, r, v);
}
void add_edge(int v, int u, int w)
{
    adj[v].push_back({u, w});
    ///adj[u].push_back({v, w});
}
int used[4 * maxn];
struct edge
{
    int v, len;
    edge(int _v = 0, int _len = 0)
    {
        v = _v;
        len = _len;
    }
    bool operator < (const edge &e) const
    {
        return len > e.len;
    }
};

void bfs(int st, bool tf = false)
{
    for (int i = 1; i <= fict; i ++)
    {
        dist[i] = 1e9;
        used[i] = 0;
    }

    priority_queue < edge > q;
    q.push(edge(st, 0));
    dist[st] = 0;

    while(!q.empty())
    {
        edge cur = q.top();
        q.pop();
        if (used[cur.v])
            continue;
        used[cur.v] = 1;
        //if (tf)
          //  cout << "here " << v << " " << dist[v] << endl;
        for (pair < int, int > nb : adj[cur.v])
        {
            edge to_go;
            to_go.v = nb.first;
            to_go.len = cur.len + nb.second;
            if (dist[nb.first] > to_go.len)
            {
                dist[nb.first] = to_go.len;
                q.push(to_go);
            }
        }
    }
}


int n, q, l[maxn], r[maxn];
int a[maxn], b[maxn];
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i ++)
    {
        cin >> l[i] >> r[i];
    }

    graph(n + 1);
    for (int i = 1; i <= n; i ++)
    {
        add_range_edge(l[i], r[i], i);
        ///for (int j = l[i]; j <= r[i]; j ++)
        ///add_edge(j, i, 1);
        ///cout << j << " " << i << " " << 1 << endl;
    }

    bfs(1);
    for (int i = 1; i <= n; i ++)
        a[i] = dist[i];
    bfs(n);
    for (int i = 1; i <= n; i ++)
        b[i] = dist[i];

    /**for (int i = 1; i <= n; i ++)
        cout << b[i] << " ";
    cout << endl;
    return;*/
    ///cout << "------------" << endl;

    for (int i = 1; i <= n; i ++)
    {
        int edge = a[i] + b[i];
        if (a[i] > 0 && b[i] > 0)
            edge --;
        add_edge(n + 1, i, edge);
        ///cout << n + 1 << " " << i << " " << a[i] << " " << b[i] << endl;
    }

    bfs(n + 1, 1);
    /**for (int i = 1; i <= n; i ++)
        cout << dist[i] << " ";
    cout << endl;*/
    cin >> q;
    for (int i = 1; i <= q; i ++)
    {
        int x;
        cin >> x;
        int ans = dist[x];
        if (ans > n)
            cout << -1 << endl;
        else
            cout << ans << endl;
    }



}

int main()
{
    speed();
    ///freopen("text.txt", "r", stdin);
    solve();
    return 0;
}
/**
9
1 1
2 2
3 3
1 4
2 8
5 7
4 9
8 8
9 9
1
6

*/

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 584 ms 63764 KB Output is correct
5 Correct 229 ms 42948 KB Output is correct
6 Correct 157 ms 37780 KB Output is correct
7 Correct 210 ms 60708 KB Output is correct
8 Correct 111 ms 52736 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 4 ms 9676 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 4 ms 9812 KB Output is correct
12 Correct 4 ms 9812 KB Output is correct
13 Correct 4 ms 9812 KB Output is correct
14 Correct 6 ms 9812 KB Output is correct
15 Correct 4 ms 9812 KB Output is correct
16 Correct 6 ms 10196 KB Output is correct
17 Correct 6 ms 10196 KB Output is correct
18 Correct 8 ms 10440 KB Output is correct
19 Correct 6 ms 10324 KB Output is correct
20 Correct 5 ms 10068 KB Output is correct
21 Correct 6 ms 10172 KB Output is correct
22 Correct 5 ms 10324 KB Output is correct
23 Correct 7 ms 10224 KB Output is correct
24 Correct 6 ms 10256 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9684 KB Output is correct
5 Correct 4 ms 9676 KB Output is correct
6 Correct 4 ms 9684 KB Output is correct
7 Correct 4 ms 9684 KB Output is correct
8 Correct 4 ms 9684 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 4 ms 9812 KB Output is correct
12 Correct 4 ms 9812 KB Output is correct
13 Correct 4 ms 9812 KB Output is correct
14 Correct 6 ms 9812 KB Output is correct
15 Correct 4 ms 9812 KB Output is correct
16 Correct 6 ms 10196 KB Output is correct
17 Correct 6 ms 10196 KB Output is correct
18 Correct 8 ms 10440 KB Output is correct
19 Correct 6 ms 10324 KB Output is correct
20 Correct 5 ms 10068 KB Output is correct
21 Correct 6 ms 10172 KB Output is correct
22 Correct 5 ms 10324 KB Output is correct
23 Correct 7 ms 10224 KB Output is correct
24 Correct 6 ms 10256 KB Output is correct
25 Correct 4 ms 9684 KB Output is correct
26 Correct 4 ms 9684 KB Output is correct
27 Correct 7 ms 10324 KB Output is correct
28 Correct 6 ms 10092 KB Output is correct
29 Correct 6 ms 10068 KB Output is correct
30 Correct 6 ms 10068 KB Output is correct
31 Correct 6 ms 10264 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 9684 KB Output is correct
2 Correct 4 ms 9684 KB Output is correct
3 Correct 4 ms 9684 KB Output is correct
4 Correct 584 ms 63764 KB Output is correct
5 Correct 229 ms 42948 KB Output is correct
6 Correct 157 ms 37780 KB Output is correct
7 Correct 210 ms 60708 KB Output is correct
8 Correct 111 ms 52736 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 4 ms 9684 KB Output is correct
13 Correct 4 ms 9676 KB Output is correct
14 Correct 4 ms 9684 KB Output is correct
15 Correct 4 ms 9684 KB Output is correct
16 Correct 4 ms 9684 KB Output is correct
17 Correct 4 ms 9684 KB Output is correct
18 Correct 4 ms 9684 KB Output is correct
19 Correct 4 ms 9812 KB Output is correct
20 Correct 4 ms 9812 KB Output is correct
21 Correct 4 ms 9812 KB Output is correct
22 Correct 6 ms 9812 KB Output is correct
23 Correct 4 ms 9812 KB Output is correct
24 Correct 6 ms 10196 KB Output is correct
25 Correct 6 ms 10196 KB Output is correct
26 Correct 8 ms 10440 KB Output is correct
27 Correct 6 ms 10324 KB Output is correct
28 Correct 5 ms 10068 KB Output is correct
29 Correct 6 ms 10172 KB Output is correct
30 Correct 5 ms 10324 KB Output is correct
31 Correct 7 ms 10224 KB Output is correct
32 Correct 6 ms 10256 KB Output is correct
33 Correct 4 ms 9684 KB Output is correct
34 Correct 4 ms 9684 KB Output is correct
35 Correct 7 ms 10324 KB Output is correct
36 Correct 6 ms 10092 KB Output is correct
37 Correct 6 ms 10068 KB Output is correct
38 Correct 6 ms 10068 KB Output is correct
39 Correct 6 ms 10264 KB Output is correct
40 Correct 620 ms 66504 KB Output is correct
41 Correct 249 ms 43084 KB Output is correct
42 Correct 346 ms 70352 KB Output is correct
43 Correct 349 ms 73076 KB Output is correct
44 Correct 168 ms 40388 KB Output is correct
45 Correct 183 ms 47200 KB Output is correct
46 Correct 96 ms 25144 KB Output is correct
47 Correct 392 ms 54988 KB Output is correct
48 Correct 260 ms 55088 KB Output is correct