oj.uz

Submission #44585

# Submission time Handle Problem Language Result Execution time Memory
44585 2018-04-03T13:28:04 Z wasyl Evacuation plan (IZhO18_plan) C++11
100 / 100
 621 ms 28732 KB 
#include <bits/stdc++.h>
#ifndef dbg
#define dbg(...)
#endif
#define all(x) begin(x), end(x)
#define rsz(...) resize(__VA_ARGS__)
#define psh(...) push_back(__VA_ARGS__)
#define emp(...) emplace_back(__VA_ARGS__)
#define prt(...) print(cout, __VA_ARGS__)
#define dmp(...) print(cerr, #__VA_ARGS__, '=', __VA_ARGS__)
#define dprt(...) dbg(print(cerr,__VA_ARGS__))
#define ddmp(...) dbg(dmp(__VA_ARGS__))
using namespace std;using ll=long long;
template<typename t>void print(ostream& os, const t& a){os<<a<<'\n';}
template<typename t, typename... A>void print
(ostream& os, const t& a, A&&... b){os<<a<<' ';print(os, b...);}
template<typename t>using V=vector<t>;

constexpr int oo = 1e9 + 1;

struct Edge
{
    int v, w;
    Edge(int v, int w):
    v(v),w(w){}
};

struct Node : V< Edge >
{
    int val = oo;
};

struct Query
{
    int v, id;
    Query(int v, int id):
    v(v), id(id){}
};

struct Union
{
    V< Query > qs;
    int lid, siz = 1;
};

struct Event
{
    int v, val;
    Event(int v, int val):
    v(v), val(val){}
};

inline bool operator> (const Event& wc, const Event& mn)
{
    return wc.val > mn.val;
}

int curr = oo;
int n, m, k, q;
V< Node > gr;
V< int > odp;
V< bool > vis;
V< Union > tb;
V< Event > evs;
priority_queue< Event, V< Event >, greater< Event > > Q;

inline void dijkstra()
{
    while (not Q.empty())
    {
        int v = Q.top().v;
        int val = Q.top().val;
        Q.pop();

        if (val > gr[v].val)
            continue;
        
        for (auto& ed : gr[v])
        {
            int s = ed.v;
            int dl = ed.w;
            if (gr[s].val > gr[v].val + dl) 
            {
                gr[s].val = gr[v].val + dl;
                Q.emplace(s, gr[s].val);
            }
        }
    }
}

inline int find(int v)
{
    return tb[v].lid == tb[tb[v].lid].lid?
    tb[v].lid : tb[v].lid = find(tb[v].lid);
}

inline void join(int p, int q)
{
    p = find(p);
    q = find(q);
    
    if (p == q)
        return;

    if (tb[p].siz < tb[q].siz)
        swap(p, q);
    
    if (tb[p].qs.size() < tb[q].qs.size())
        swap(tb[p].qs, tb[q].qs);
    
    tb[p].siz += tb[q].siz;
    tb[q].lid = p;
    
    for (auto& qu : tb[q].qs)
    {
        if (find(qu.v) != p)
            tb[p].qs.psh(qu);
        else
            odp[qu.id] = max(odp[qu.id], curr);
    }
    
    tb[q].qs.clear();
    tb[q].qs.shrink_to_fit();
}

inline void add(int v)
{
    vis[v] = true;
    
    for (auto& ed : gr[v])
        if (vis[ed.v])
            join(ed.v, v);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> n >> m;    

    gr.rsz(n + 1);
    tb.rsz(n + 1);
    vis.rsz(n + 1);
    
    for (int i = 1; i <= n; ++i)
        tb[i].lid = i;
        
    for (int i = 0; i < m; ++i)
    {
        int p, q, w;
        cin >> p >> q >> w;
        gr[p].emp(q, w);
        gr[q].emp(p, w);    
    }
    
    cin >> k;
    for (int i = 0; i < k; ++i)
    {
        int v; cin >> v;
        gr[v].val = 0;
        Q.emplace(v, 0);
    }
    
    cin >> q;
    odp.rsz(q, 0);   
    for (int i = 0; i < q; ++i)
    {
        int p, q; cin >> p >> q;
        tb[p].qs.emp(q, i);
        tb[q].qs.emp(p, i);
    }

    dijkstra();
    
    for (int i = 1; i <= n; ++i)
        evs.emp(i, gr[i].val);
    
    sort(all(evs), greater< Event >());

    for (auto& ev : evs)
        curr = ev.val, add(ev.v);
 
    for (int i : odp)
        prt(i);                          
}

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 548 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 245 ms 15876 KB Output is correct
17 Correct 558 ms 27744 KB Output is correct
18 Correct 34 ms 3212 KB Output is correct
19 Correct 159 ms 18032 KB Output is correct
20 Correct 531 ms 28204 KB Output is correct
21 Correct 296 ms 20752 KB Output is correct
22 Correct 173 ms 17036 KB Output is correct
23 Correct 553 ms 28216 KB Output is correct
24 Correct 557 ms 28732 KB Output is correct
25 Correct 568 ms 28460 KB Output is correct
26 Correct 167 ms 18428 KB Output is correct
27 Correct 164 ms 18332 KB Output is correct
28 Correct 162 ms 18440 KB Output is correct
29 Correct 173 ms 18704 KB Output is correct
30 Correct 167 ms 18504 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 15212 KB Output is correct
2 Correct 459 ms 23796 KB Output is correct
3 Correct 466 ms 24232 KB Output is correct
4 Correct 95 ms 11184 KB Output is correct
5 Correct 457 ms 23696 KB Output is correct
6 Correct 456 ms 24152 KB Output is correct
7 Correct 460 ms 24152 KB Output is correct
8 Correct 458 ms 24096 KB Output is correct
9 Correct 465 ms 23992 KB Output is correct
10 Correct 462 ms 24108 KB Output is correct
11 Correct 455 ms 23816 KB Output is correct
12 Correct 469 ms 23740 KB Output is correct
13 Correct 464 ms 23496 KB Output is correct
14 Correct 451 ms 23676 KB Output is correct
15 Correct 472 ms 23916 KB Output is correct
16 Correct 475 ms 23500 KB Output is correct
17 Correct 480 ms 23640 KB Output is correct
18 Correct 465 ms 23688 KB Output is correct
19 Correct 97 ms 10924 KB Output is correct
20 Correct 489 ms 23536 KB Output is correct
21 Correct 456 ms 23268 KB Output is correct
22 Correct 111 ms 13072 KB Output is correct
23 Correct 100 ms 11704 KB Output is correct
24 Correct 105 ms 13036 KB Output is correct
25 Correct 110 ms 12992 KB Output is correct
26 Correct 108 ms 11564 KB Output is correct
27 Correct 98 ms 10896 KB Output is correct
28 Correct 105 ms 13164 KB Output is correct
29 Correct 98 ms 11136 KB Output is correct
30 Correct 110 ms 13160 KB Output is correct
31 Correct 128 ms 11176 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 548 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 504 KB Output is correct
16 Correct 245 ms 15876 KB Output is correct
17 Correct 558 ms 27744 KB Output is correct
18 Correct 34 ms 3212 KB Output is correct
19 Correct 159 ms 18032 KB Output is correct
20 Correct 531 ms 28204 KB Output is correct
21 Correct 296 ms 20752 KB Output is correct
22 Correct 173 ms 17036 KB Output is correct
23 Correct 553 ms 28216 KB Output is correct
24 Correct 557 ms 28732 KB Output is correct
25 Correct 568 ms 28460 KB Output is correct
26 Correct 167 ms 18428 KB Output is correct
27 Correct 164 ms 18332 KB Output is correct
28 Correct 162 ms 18440 KB Output is correct
29 Correct 173 ms 18704 KB Output is correct
30 Correct 167 ms 18504 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 3 ms 376 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 376 KB Output is correct
41 Correct 210 ms 15212 KB Output is correct
42 Correct 459 ms 23796 KB Output is correct
43 Correct 466 ms 24232 KB Output is correct
44 Correct 95 ms 11184 KB Output is correct
45 Correct 457 ms 23696 KB Output is correct
46 Correct 456 ms 24152 KB Output is correct
47 Correct 460 ms 24152 KB Output is correct
48 Correct 458 ms 24096 KB Output is correct
49 Correct 465 ms 23992 KB Output is correct
50 Correct 462 ms 24108 KB Output is correct
51 Correct 455 ms 23816 KB Output is correct
52 Correct 469 ms 23740 KB Output is correct
53 Correct 464 ms 23496 KB Output is correct
54 Correct 451 ms 23676 KB Output is correct
55 Correct 472 ms 23916 KB Output is correct
56 Correct 475 ms 23500 KB Output is correct
57 Correct 480 ms 23640 KB Output is correct
58 Correct 465 ms 23688 KB Output is correct
59 Correct 97 ms 10924 KB Output is correct
60 Correct 489 ms 23536 KB Output is correct
61 Correct 456 ms 23268 KB Output is correct
62 Correct 111 ms 13072 KB Output is correct
63 Correct 100 ms 11704 KB Output is correct
64 Correct 105 ms 13036 KB Output is correct
65 Correct 110 ms 12992 KB Output is correct
66 Correct 108 ms 11564 KB Output is correct
67 Correct 98 ms 10896 KB Output is correct
68 Correct 105 ms 13164 KB Output is correct
69 Correct 98 ms 11136 KB Output is correct
70 Correct 110 ms 13160 KB Output is correct
71 Correct 128 ms 11176 KB Output is correct
72 Correct 316 ms 19876 KB Output is correct
73 Correct 565 ms 27164 KB Output is correct
74 Correct 576 ms 27340 KB Output is correct
75 Correct 554 ms 26996 KB Output is correct
76 Correct 561 ms 27060 KB Output is correct
77 Correct 558 ms 27036 KB Output is correct
78 Correct 550 ms 27068 KB Output is correct
79 Correct 553 ms 26988 KB Output is correct
80 Correct 621 ms 26952 KB Output is correct
81 Correct 568 ms 27172 KB Output is correct
82 Correct 548 ms 27236 KB Output is correct
83 Correct 556 ms 27088 KB Output is correct
84 Correct 585 ms 26792 KB Output is correct
85 Correct 570 ms 27516 KB Output is correct
86 Correct 564 ms 26508 KB Output is correct
87 Correct 553 ms 26516 KB Output is correct
88 Correct 566 ms 26636 KB Output is correct
89 Correct 173 ms 16340 KB Output is correct
90 Correct 543 ms 26660 KB Output is correct
91 Correct 536 ms 26532 KB Output is correct
92 Correct 186 ms 17868 KB Output is correct
93 Correct 185 ms 17152 KB Output is correct
94 Correct 193 ms 17792 KB Output is correct
95 Correct 192 ms 17696 KB Output is correct
96 Correct 202 ms 19648 KB Output is correct
97 Correct 174 ms 16492 KB Output is correct
98 Correct 224 ms 17664 KB Output is correct
99 Correct 205 ms 17228 KB Output is correct
100 Correct 185 ms 17764 KB Output is correct