Submission #118679

# Submission time Handle Problem Language Result Execution time Memory
118679 2019-06-19T11:04:43 Z Alexa2001 Evacuation plan (IZhO18_plan) C++17
100 / 100
2556 ms 29492 KB
#include <bits/stdc++.h>

using namespace std;

const int Nmax = 1e5 + 5, Mmax = 5e5 + 5;
typedef pair<int,int> Pair;

Pair edge[Mmax], query[Nmax];
vector<Pair> v[Nmax];
bitset<Nmax> bad;
int res[Nmax], dist[Nmax], cost[Mmax];
int n, q, m;


struct 
{
    int t[Nmax];

    int boss(int x)
    {
        if(x == t[x]) return x;
        return t[x] = boss(t[x]);
    }

    void init()
    {
        int i;
        for(i=1; i<=n; ++i) t[i] = i;
    }

    bool same(int x, int y)
    {
        return boss(x) == boss(y);
    }

    bool unite(int x, int y)
    {
        x = boss(x);
        y = boss(y);
        if(x == y) return 0;
        t[x] = y;
        return 1;
    }
} uf;

void dijkstra()
{
    priority_queue<Pair, vector<Pair>, greater<Pair>> heap;

    int i;
    for(i=1; i<=n; ++i)
        if(bad[i]) dist[i] = 0, heap.push({0, i});
            else dist[i] = 1e9;

    while(heap.size())
    {
        int node, act_dist;
        tie(act_dist, node) = heap.top();
        heap.pop();

        if(dist[node] != act_dist) continue;

        for(auto it : v[node])
            if(dist[it.first] > act_dist + it.second)
            {
                dist[it.first] = act_dist + it.second;
                heap.push({dist[it.first], it.first});
            }
     }
}

void solve()
{
    int step, i;
    for(i=1; i<=q; ++i) res[i] = 0;
    
    vector<int> ord, ord_edges;
    for(i=1; i<=q; ++i) ord.push_back(i);
    for(i=1; i<=m; ++i) ord_edges.push_back(i), cost[i] = min(dist[edge[i].first], dist[edge[i].second]);

    ord_edges.push_back(m+1);
    cost[m+1] = 0;
    edge[m+1] = {1, 1};

    auto qcmp = [] (int x, int y)
    {
        return res[x] < res[y];
    };

    auto edge_cmp = [] (int x, int y)
    {
        return cost[x] > cost[y];
    };

    sort(ord_edges.begin(), ord_edges.end(), edge_cmp);

    for(step = (1<<30); step; step >>= 1)
    {
        vector<int> old = ord;

        uf.init();
        sort(ord.begin(), ord.end(), qcmp);

        for(auto it : ord_edges)
        {
            while(ord.size() && cost[it] < res[ord.back()] + step)
            {
                int id = ord.back();
                if(uf.same(query[id].first, query[id].second))
                    res[id] += step;
                ord.pop_back();
            }
            
            int x, y;
            tie(x, y) = edge[it];
            uf.unite(x, y);
        }
        
        assert(ord.empty());
        ord = old;
    }
    
  //  cerr << "W"; cerr << q << '\n';
    for(i=1; i<=q; ++i) cout << res[i] << '\n';
}

int main()
{
  //  freopen("data.in", "r", stdin);
    cin.sync_with_stdio(false);
    cin.tie(0);

    int x, y, i, len;

    cin >> n >> m;
    for(i=1; i<=m; ++i)
    {
        cin >> x >> y >> len;
        v[x].push_back({y, len});
        v[y].push_back({x, len});
        edge[i] = {x, y};
    }
    
//    cerr << "#";

    int k;
    cin >> k;
    while(k--)
    {
        cin >> x;
        bad[x] = 1;
    }

    dijkstra();

    cin >> q;
    for(i=1; i<=q; ++i)
    {
        cin >> x >> y;
        query[i] = {x, y};
    }

    solve();

    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 6 ms 2808 KB Output is correct
3 Correct 6 ms 2808 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 6 ms 2808 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2744 KB Output is correct
9 Correct 7 ms 2844 KB Output is correct
10 Correct 6 ms 2808 KB Output is correct
11 Correct 6 ms 2808 KB Output is correct
12 Correct 6 ms 2808 KB Output is correct
13 Correct 6 ms 2808 KB Output is correct
14 Correct 6 ms 2808 KB Output is correct
15 Correct 7 ms 2880 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 6 ms 2808 KB Output is correct
3 Correct 6 ms 2808 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 6 ms 2808 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2744 KB Output is correct
9 Correct 7 ms 2844 KB Output is correct
10 Correct 6 ms 2808 KB Output is correct
11 Correct 6 ms 2808 KB Output is correct
12 Correct 6 ms 2808 KB Output is correct
13 Correct 6 ms 2808 KB Output is correct
14 Correct 6 ms 2808 KB Output is correct
15 Correct 7 ms 2880 KB Output is correct
16 Correct 543 ms 11012 KB Output is correct
17 Correct 2101 ms 29380 KB Output is correct
18 Correct 113 ms 5264 KB Output is correct
19 Correct 317 ms 12972 KB Output is correct
20 Correct 2328 ms 29396 KB Output is correct
21 Correct 864 ms 15896 KB Output is correct
22 Correct 509 ms 12540 KB Output is correct
23 Correct 2334 ms 29328 KB Output is correct
24 Correct 2161 ms 29384 KB Output is correct
25 Correct 2122 ms 29252 KB Output is correct
26 Correct 299 ms 12556 KB Output is correct
27 Correct 302 ms 12632 KB Output is correct
28 Correct 323 ms 12632 KB Output is correct
29 Correct 265 ms 12752 KB Output is correct
30 Correct 305 ms 12764 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2680 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2680 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 781 ms 13332 KB Output is correct
2 Correct 1917 ms 25496 KB Output is correct
3 Correct 1861 ms 25496 KB Output is correct
4 Correct 156 ms 9072 KB Output is correct
5 Correct 2068 ms 25484 KB Output is correct
6 Correct 1904 ms 25664 KB Output is correct
7 Correct 1950 ms 25640 KB Output is correct
8 Correct 1817 ms 25536 KB Output is correct
9 Correct 1808 ms 25512 KB Output is correct
10 Correct 2005 ms 25716 KB Output is correct
11 Correct 1861 ms 25544 KB Output is correct
12 Correct 1910 ms 25456 KB Output is correct
13 Correct 1806 ms 25452 KB Output is correct
14 Correct 1938 ms 25412 KB Output is correct
15 Correct 2134 ms 27368 KB Output is correct
16 Correct 2138 ms 25612 KB Output is correct
17 Correct 1885 ms 25480 KB Output is correct
18 Correct 1826 ms 25460 KB Output is correct
19 Correct 112 ms 8816 KB Output is correct
20 Correct 1946 ms 25572 KB Output is correct
21 Correct 1287 ms 25476 KB Output is correct
22 Correct 156 ms 10064 KB Output is correct
23 Correct 186 ms 8944 KB Output is correct
24 Correct 194 ms 10968 KB Output is correct
25 Correct 169 ms 10308 KB Output is correct
26 Correct 215 ms 8852 KB Output is correct
27 Correct 168 ms 9072 KB Output is correct
28 Correct 154 ms 10844 KB Output is correct
29 Correct 166 ms 9076 KB Output is correct
30 Correct 184 ms 10760 KB Output is correct
31 Correct 161 ms 9100 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 6 ms 2808 KB Output is correct
3 Correct 6 ms 2808 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 6 ms 2808 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2744 KB Output is correct
9 Correct 7 ms 2844 KB Output is correct
10 Correct 6 ms 2808 KB Output is correct
11 Correct 6 ms 2808 KB Output is correct
12 Correct 6 ms 2808 KB Output is correct
13 Correct 6 ms 2808 KB Output is correct
14 Correct 6 ms 2808 KB Output is correct
15 Correct 7 ms 2880 KB Output is correct
16 Correct 543 ms 11012 KB Output is correct
17 Correct 2101 ms 29380 KB Output is correct
18 Correct 113 ms 5264 KB Output is correct
19 Correct 317 ms 12972 KB Output is correct
20 Correct 2328 ms 29396 KB Output is correct
21 Correct 864 ms 15896 KB Output is correct
22 Correct 509 ms 12540 KB Output is correct
23 Correct 2334 ms 29328 KB Output is correct
24 Correct 2161 ms 29384 KB Output is correct
25 Correct 2122 ms 29252 KB Output is correct
26 Correct 299 ms 12556 KB Output is correct
27 Correct 302 ms 12632 KB Output is correct
28 Correct 323 ms 12632 KB Output is correct
29 Correct 265 ms 12752 KB Output is correct
30 Correct 305 ms 12764 KB Output is correct
31 Correct 4 ms 2680 KB Output is correct
32 Correct 4 ms 2680 KB Output is correct
33 Correct 4 ms 2680 KB Output is correct
34 Correct 4 ms 2680 KB Output is correct
35 Correct 4 ms 2680 KB Output is correct
36 Correct 4 ms 2680 KB Output is correct
37 Correct 4 ms 2680 KB Output is correct
38 Correct 4 ms 2680 KB Output is correct
39 Correct 4 ms 2680 KB Output is correct
40 Correct 4 ms 2680 KB Output is correct
41 Correct 781 ms 13332 KB Output is correct
42 Correct 1917 ms 25496 KB Output is correct
43 Correct 1861 ms 25496 KB Output is correct
44 Correct 156 ms 9072 KB Output is correct
45 Correct 2068 ms 25484 KB Output is correct
46 Correct 1904 ms 25664 KB Output is correct
47 Correct 1950 ms 25640 KB Output is correct
48 Correct 1817 ms 25536 KB Output is correct
49 Correct 1808 ms 25512 KB Output is correct
50 Correct 2005 ms 25716 KB Output is correct
51 Correct 1861 ms 25544 KB Output is correct
52 Correct 1910 ms 25456 KB Output is correct
53 Correct 1806 ms 25452 KB Output is correct
54 Correct 1938 ms 25412 KB Output is correct
55 Correct 2134 ms 27368 KB Output is correct
56 Correct 2138 ms 25612 KB Output is correct
57 Correct 1885 ms 25480 KB Output is correct
58 Correct 1826 ms 25460 KB Output is correct
59 Correct 112 ms 8816 KB Output is correct
60 Correct 1946 ms 25572 KB Output is correct
61 Correct 1287 ms 25476 KB Output is correct
62 Correct 156 ms 10064 KB Output is correct
63 Correct 186 ms 8944 KB Output is correct
64 Correct 194 ms 10968 KB Output is correct
65 Correct 169 ms 10308 KB Output is correct
66 Correct 215 ms 8852 KB Output is correct
67 Correct 168 ms 9072 KB Output is correct
68 Correct 154 ms 10844 KB Output is correct
69 Correct 166 ms 9076 KB Output is correct
70 Correct 184 ms 10760 KB Output is correct
71 Correct 161 ms 9100 KB Output is correct
72 Correct 1051 ms 16308 KB Output is correct
73 Correct 2194 ms 29388 KB Output is correct
74 Correct 2255 ms 29424 KB Output is correct
75 Correct 2344 ms 29404 KB Output is correct
76 Correct 2265 ms 29388 KB Output is correct
77 Correct 2278 ms 29396 KB Output is correct
78 Correct 2556 ms 29392 KB Output is correct
79 Correct 2351 ms 29392 KB Output is correct
80 Correct 2191 ms 29380 KB Output is correct
81 Correct 2374 ms 29492 KB Output is correct
82 Correct 2367 ms 29380 KB Output is correct
83 Correct 2148 ms 29384 KB Output is correct
84 Correct 2082 ms 29360 KB Output is correct
85 Correct 2336 ms 29228 KB Output is correct
86 Correct 2249 ms 29404 KB Output is correct
87 Correct 2249 ms 29384 KB Output is correct
88 Correct 2124 ms 29380 KB Output is correct
89 Correct 648 ms 12296 KB Output is correct
90 Correct 2294 ms 29372 KB Output is correct
91 Correct 1417 ms 29096 KB Output is correct
92 Correct 289 ms 12608 KB Output is correct
93 Correct 517 ms 11540 KB Output is correct
94 Correct 286 ms 12748 KB Output is correct
95 Correct 274 ms 12624 KB Output is correct
96 Correct 382 ms 11088 KB Output is correct
97 Correct 465 ms 10920 KB Output is correct
98 Correct 306 ms 12632 KB Output is correct
99 Correct 455 ms 11188 KB Output is correct
100 Correct 300 ms 12780 KB Output is correct