oj.uz

Submission #768704

# Submission time Handle Problem Language Result Execution time Memory
768704 2023-06-28T12:57:17 Z danikoynov Passport (JOI23_passport) C++14
54 / 100
 2000 ms 92300 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 = 2.5e5 + 10;

struct graph
{
    vector < vector < pair < int, int > > > adj;
    int dist[maxn * 4], lf[maxn * 4], rf[maxn * 4];
    int fict, root, n;
    graph() {};

    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;
    }
    graph(int _n)
    {
        n = _n;
        adj.resize(5 * 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, n, 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 st(n + 1);
    for (int i = 1; i <= n; i ++)
    {
        st.add_range_edge(l[i], r[i], i);
        ///for (int j = l[i]; j <= r[i]; j ++)
            ///st.add_edge(j, i, 1);
            ///cout << j << " " << i << " " << 1 << endl;
    }

    st.bfs(1);
    for (int i = 1; i <= n; i ++)
        a[i] = st.dist[i];
    st.bfs(n);
    for (int i = 1; i <= n; i ++)
        b[i] = st.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 --;
        st.add_edge(n + 1, i, edge);
        ///cout << n + 1 << " " << i << " " << a[i] << " " << b[i] << endl;
    }


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



}

int main()
{
    speed();
    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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 5 ms 11988 KB Output is correct
4 Correct 425 ms 81808 KB Output is correct
5 Correct 176 ms 64016 KB Output is correct
6 Correct 113 ms 59172 KB Output is correct
7 Correct 139 ms 81024 KB Output is correct
8 Correct 100 ms 71980 KB Output is correct

Subtask #2
16.0 / 16.0

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

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11988 KB Output is correct
2 Correct 4 ms 11988 KB Output is correct
3 Correct 4 ms 11988 KB Output is correct
4 Correct 4 ms 11988 KB Output is correct
5 Correct 4 ms 11988 KB Output is correct
6 Correct 5 ms 11988 KB Output is correct
7 Correct 5 ms 11988 KB Output is correct
8 Correct 5 ms 11988 KB Output is correct
9 Correct 5 ms 12052 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 12052 KB Output is correct
12 Correct 5 ms 12116 KB Output is correct
13 Correct 5 ms 12116 KB Output is correct
14 Correct 5 ms 12116 KB Output is correct
15 Correct 5 ms 12116 KB Output is correct
16 Correct 6 ms 12744 KB Output is correct
17 Correct 6 ms 12628 KB Output is correct
18 Correct 7 ms 12884 KB Output is correct
19 Correct 7 ms 12884 KB Output is correct
20 Correct 6 ms 12692 KB Output is correct
21 Correct 22 ms 12628 KB Output is correct
22 Correct 6 ms 12900 KB Output is correct
23 Correct 6 ms 12756 KB Output is correct
24 Correct 6 ms 12756 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 11988 KB Output is correct
2 Correct 4 ms 11988 KB Output is correct
3 Correct 4 ms 11988 KB Output is correct
4 Correct 4 ms 11988 KB Output is correct
5 Correct 4 ms 11988 KB Output is correct
6 Correct 5 ms 11988 KB Output is correct
7 Correct 5 ms 11988 KB Output is correct
8 Correct 5 ms 11988 KB Output is correct
9 Correct 5 ms 12052 KB Output is correct
10 Correct 6 ms 11988 KB Output is correct
11 Correct 6 ms 12052 KB Output is correct
12 Correct 5 ms 12116 KB Output is correct
13 Correct 5 ms 12116 KB Output is correct
14 Correct 5 ms 12116 KB Output is correct
15 Correct 5 ms 12116 KB Output is correct
16 Correct 6 ms 12744 KB Output is correct
17 Correct 6 ms 12628 KB Output is correct
18 Correct 7 ms 12884 KB Output is correct
19 Correct 7 ms 12884 KB Output is correct
20 Correct 6 ms 12692 KB Output is correct
21 Correct 22 ms 12628 KB Output is correct
22 Correct 6 ms 12900 KB Output is correct
23 Correct 6 ms 12756 KB Output is correct
24 Correct 6 ms 12756 KB Output is correct
25 Correct 5 ms 11988 KB Output is correct
26 Correct 5 ms 11988 KB Output is correct
27 Correct 7 ms 12756 KB Output is correct
28 Correct 8 ms 12756 KB Output is correct
29 Correct 6 ms 12628 KB Output is correct
30 Correct 21 ms 12744 KB Output is correct
31 Correct 6 ms 12756 KB Output is correct

Subtask #5
0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 5 ms 11988 KB Output is correct
4 Correct 425 ms 81808 KB Output is correct
5 Correct 176 ms 64016 KB Output is correct
6 Correct 113 ms 59172 KB Output is correct
7 Correct 139 ms 81024 KB Output is correct
8 Correct 100 ms 71980 KB Output is correct
9 Correct 4 ms 11988 KB Output is correct
10 Correct 4 ms 11988 KB Output is correct
11 Correct 4 ms 11988 KB Output is correct
12 Correct 4 ms 11988 KB Output is correct
13 Correct 4 ms 11988 KB Output is correct
14 Correct 5 ms 11988 KB Output is correct
15 Correct 5 ms 11988 KB Output is correct
16 Correct 5 ms 11988 KB Output is correct
17 Correct 5 ms 12052 KB Output is correct
18 Correct 6 ms 11988 KB Output is correct
19 Correct 6 ms 12052 KB Output is correct
20 Correct 5 ms 12116 KB Output is correct
21 Correct 5 ms 12116 KB Output is correct
22 Correct 5 ms 12116 KB Output is correct
23 Correct 5 ms 12116 KB Output is correct
24 Correct 6 ms 12744 KB Output is correct
25 Correct 6 ms 12628 KB Output is correct
26 Correct 7 ms 12884 KB Output is correct
27 Correct 7 ms 12884 KB Output is correct
28 Correct 6 ms 12692 KB Output is correct
29 Correct 22 ms 12628 KB Output is correct
30 Correct 6 ms 12900 KB Output is correct
31 Correct 6 ms 12756 KB Output is correct
32 Correct 6 ms 12756 KB Output is correct
33 Correct 5 ms 11988 KB Output is correct
34 Correct 5 ms 11988 KB Output is correct
35 Correct 7 ms 12756 KB Output is correct
36 Correct 8 ms 12756 KB Output is correct
37 Correct 6 ms 12628 KB Output is correct
38 Correct 21 ms 12744 KB Output is correct
39 Correct 6 ms 12756 KB Output is correct
40 Correct 476 ms 85828 KB Output is correct
41 Correct 196 ms 67004 KB Output is correct
42 Execution timed out 2091 ms 92300 KB Time limit exceeded
43 Halted 0 ms 0 KB -