oj.uz

답안 #768709

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
768709 2023-06-28T13:05:29 Z danikoynov Passport (JOI23_passport) C++14
54 / 100
 2000 ms 67000 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});
    }

    void bfs(int st)
    {
        for (int i = 1; i <= fict; i ++)
        {
            dist[i] = 1e9;
        }

        deque < int > q;
        dist[st] = 0;
        q.push_back(st);
        while(!q.empty())
        {
            int v = q.front();
            q.pop_front();
            ///cout << "here " << v << " " << dist[v] << endl;
            for (pair < int, int > nb : adj[v])
            {
                if (dist[nb.first] > dist[v] + nb.second)
                {
                    dist[nb.first] = dist[v] + nb.second;
                    if (nb.second == 0)
                        q.push_front(nb.first);
                    else
                        q.push_back(nb.first);
                }
            }
        }
    }


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);
    /**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 5 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 393 ms 59528 KB Output is correct
5 Correct 182 ms 39060 KB Output is correct
6 Correct 113 ms 33864 KB Output is correct
7 Correct 129 ms 57132 KB Output is correct
8 Correct 95 ms 52004 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 9676 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9744 KB Output is correct
5 Correct 5 ms 9684 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 5 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 6 ms 9800 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9800 KB Output is correct
14 Correct 4 ms 9812 KB Output is correct
15 Correct 5 ms 9684 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 9676 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9744 KB Output is correct
5 Correct 5 ms 9684 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 5 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 6 ms 9800 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9800 KB Output is correct
14 Correct 4 ms 9812 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 10196 KB Output is correct
17 Correct 6 ms 10108 KB Output is correct
18 Correct 7 ms 10324 KB Output is correct
19 Correct 8 ms 10324 KB Output is correct
20 Correct 5 ms 10012 KB Output is correct
21 Correct 20 ms 10068 KB Output is correct
22 Correct 6 ms 10324 KB Output is correct
23 Correct 6 ms 10240 KB Output is correct
24 Correct 6 ms 10196 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 9676 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 4 ms 9744 KB Output is correct
5 Correct 5 ms 9684 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 5 ms 9684 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 6 ms 9800 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9800 KB Output is correct
14 Correct 4 ms 9812 KB Output is correct
15 Correct 5 ms 9684 KB Output is correct
16 Correct 6 ms 10196 KB Output is correct
17 Correct 6 ms 10108 KB Output is correct
18 Correct 7 ms 10324 KB Output is correct
19 Correct 8 ms 10324 KB Output is correct
20 Correct 5 ms 10012 KB Output is correct
21 Correct 20 ms 10068 KB Output is correct
22 Correct 6 ms 10324 KB Output is correct
23 Correct 6 ms 10240 KB Output is correct
24 Correct 6 ms 10196 KB Output is correct
25 Correct 4 ms 9640 KB Output is correct
26 Correct 5 ms 9684 KB Output is correct
27 Correct 6 ms 10196 KB Output is correct
28 Correct 7 ms 10068 KB Output is correct
29 Correct 7 ms 10068 KB Output is correct
30 Correct 19 ms 10140 KB Output is correct
31 Correct 6 ms 10212 KB Output is correct

Subtask #5
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 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 393 ms 59528 KB Output is correct
5 Correct 182 ms 39060 KB Output is correct
6 Correct 113 ms 33864 KB Output is correct
7 Correct 129 ms 57132 KB Output is correct
8 Correct 95 ms 52004 KB Output is correct
9 Correct 4 ms 9684 KB Output is correct
10 Correct 4 ms 9676 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 4 ms 9744 KB Output is correct
13 Correct 5 ms 9684 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 5 ms 9684 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 6 ms 9800 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 5 ms 9800 KB Output is correct
22 Correct 4 ms 9812 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 6 ms 10196 KB Output is correct
25 Correct 6 ms 10108 KB Output is correct
26 Correct 7 ms 10324 KB Output is correct
27 Correct 8 ms 10324 KB Output is correct
28 Correct 5 ms 10012 KB Output is correct
29 Correct 20 ms 10068 KB Output is correct
30 Correct 6 ms 10324 KB Output is correct
31 Correct 6 ms 10240 KB Output is correct
32 Correct 6 ms 10196 KB Output is correct
33 Correct 4 ms 9640 KB Output is correct
34 Correct 5 ms 9684 KB Output is correct
35 Correct 6 ms 10196 KB Output is correct
36 Correct 7 ms 10068 KB Output is correct
37 Correct 7 ms 10068 KB Output is correct
38 Correct 19 ms 10140 KB Output is correct
39 Correct 6 ms 10212 KB Output is correct
40 Correct 444 ms 59736 KB Output is correct
41 Correct 191 ms 40456 KB Output is correct
42 Execution timed out 2067 ms 67000 KB Time limit exceeded
43 Halted 0 ms 0 KB -