oj.uz

답안 #878358

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
878358 2023-11-24T08:37:18 Z heeheeheehaaw Evacuation plan (IZhO18_plan) C++17
100 / 100
 325 ms 38396 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")

using namespace std;

int n, m, k, q;
const int INF = 1e9;
vector<pair<int, int>> adj[100005];
int dist[100005];
priority_queue<pair<int, int>> pq;
vector<int> qry[100005], parent;
vector<int> moment[100005], minm[100005];
int hei[100005], minn[100005], tin[100005];

void init()
{
    parent.resize(n + 1);
    for(int i = 1; i <= n; i++)
        parent[i] = i, hei[i] = 1, tin[i] = 0, minn[i] = dist[i];
}

int cauta(int u, int timer)
{
    if(parent[u] == u || tin[u] > timer)
        return u;
    return cauta(parent[u], timer);
}

bool cmp(int a, int b)
{
    return dist[a] > dist[b];
}

void unite(int u, int v, int t)
{
    u = cauta(u, t);
    v = cauta(v, t);
    if(u == v)
        return;
    if(hei[u] > hei[v])
        swap(u, v);
    moment[v].push_back(t);
    minn[v] = min(minn[v], minn[u]);
    minm[v].push_back(minn[v]);
    tin[u] = t;
    parent[u] = v;
    hei[v] = max(hei[v], hei[u] + 1);
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    cin>>n>>m;
    for(int i = 1; i <= m; i++)
    {
        int a, b, c;
        cin>>a>>b>>c;
        adj[a].push_back({b, c});
        adj[b].push_back({a, c});
    }

    cin>>k;
    vector<int> aux;
    for(int i = 1; i <= n; i++)
        dist[i] = INF, aux.push_back(i);

    for(int i = 1; i <= k; i++)
    {
        int a;
        cin>>a;
        pq.push({0, a});
        dist[a] = 0;
    }

    while(!pq.empty())
    {
        int nod = pq.top().second;
        int d = -pq.top().first;
        pq.pop();
        if(dist[nod] != d)
            continue;
        for(auto it : adj[nod])
            if(dist[nod] + it.second < dist[it.first])
                dist[it.first] = dist[nod] + it.second, pq.push({-dist[it.first], it.first});
    }

    init();
    sort(aux.begin(), aux.end(), cmp);
    int cnt = 0;
    for(int i = 0; i < n; i++)
    {
        for(auto it : adj[aux[i]])
            if(dist[it.first] >= dist[aux[i]])
                unite(it.first, aux[i], ++cnt);
    }

    cin>>q;
    for(int i = 1; i <= q; i++)
    {
        int a, b;
        cin>>a>>b;
        int st = 1, dr = cnt, rez, nod;
        while(st <= dr)
        {
            int mij = (st + dr) / 2;
            int u = cauta(a, mij), v = cauta(b, mij);
            if(u != v) st = mij + 1;
            else dr = mij - 1, rez = mij, nod = u;
        }

        int poz = upper_bound(moment[nod].begin(), moment[nod].end(), rez) - moment[nod].begin();
        cout<<min(min(dist[a], dist[b]), minm[nod][poz - 1])<<'\n';
    }


    return 0;
}

/**

9 12
1 9 4
1 2 5
2 3 7
2 4 3
4 3 6
3 6 4
8 7 10
6 7 5
5 8 1
9 5 7
5 4 12
6 8 2
2
4 7
5
1 6
5 3
4 8
5 8
1 5

*/

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 11096 KB Output is correct
2 Correct 4 ms 11100 KB Output is correct
3 Correct 3 ms 11128 KB Output is correct
4 Correct 2 ms 11248 KB Output is correct
5 Correct 4 ms 11096 KB Output is correct
6 Correct 4 ms 11236 KB Output is correct
7 Correct 2 ms 11100 KB Output is correct
8 Correct 3 ms 11100 KB Output is correct
9 Correct 4 ms 11356 KB Output is correct
10 Correct 3 ms 11260 KB Output is correct
11 Correct 4 ms 11356 KB Output is correct
12 Correct 3 ms 11308 KB Output is correct
13 Correct 3 ms 11100 KB Output is correct
14 Correct 3 ms 11204 KB Output is correct
15 Correct 3 ms 11344 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 11096 KB Output is correct
2 Correct 4 ms 11100 KB Output is correct
3 Correct 3 ms 11128 KB Output is correct
4 Correct 2 ms 11248 KB Output is correct
5 Correct 4 ms 11096 KB Output is correct
6 Correct 4 ms 11236 KB Output is correct
7 Correct 2 ms 11100 KB Output is correct
8 Correct 3 ms 11100 KB Output is correct
9 Correct 4 ms 11356 KB Output is correct
10 Correct 3 ms 11260 KB Output is correct
11 Correct 4 ms 11356 KB Output is correct
12 Correct 3 ms 11308 KB Output is correct
13 Correct 3 ms 11100 KB Output is correct
14 Correct 3 ms 11204 KB Output is correct
15 Correct 3 ms 11344 KB Output is correct
16 Correct 108 ms 19620 KB Output is correct
17 Correct 302 ms 38168 KB Output is correct
18 Correct 22 ms 13660 KB Output is correct
19 Correct 95 ms 21448 KB Output is correct
20 Correct 281 ms 38312 KB Output is correct
21 Correct 180 ms 25136 KB Output is correct
22 Correct 92 ms 20164 KB Output is correct
23 Correct 266 ms 37968 KB Output is correct
24 Correct 270 ms 37952 KB Output is correct
25 Correct 325 ms 37960 KB Output is correct
26 Correct 102 ms 21248 KB Output is correct
27 Correct 117 ms 21448 KB Output is correct
28 Correct 107 ms 21184 KB Output is correct
29 Correct 105 ms 21204 KB Output is correct
30 Correct 113 ms 21300 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 11100 KB Output is correct
2 Correct 3 ms 11100 KB Output is correct
3 Correct 2 ms 11100 KB Output is correct
4 Correct 3 ms 11100 KB Output is correct
5 Correct 3 ms 11100 KB Output is correct
6 Correct 3 ms 11252 KB Output is correct
7 Correct 2 ms 11244 KB Output is correct
8 Correct 2 ms 11100 KB Output is correct
9 Correct 3 ms 11248 KB Output is correct
10 Correct 2 ms 11100 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 121 ms 22296 KB Output is correct
2 Correct 262 ms 36356 KB Output is correct
3 Correct 240 ms 36492 KB Output is correct
4 Correct 46 ms 18160 KB Output is correct
5 Correct 255 ms 36424 KB Output is correct
6 Correct 255 ms 36384 KB Output is correct
7 Correct 262 ms 36816 KB Output is correct
8 Correct 225 ms 36312 KB Output is correct
9 Correct 247 ms 36396 KB Output is correct
10 Correct 231 ms 36408 KB Output is correct
11 Correct 222 ms 36436 KB Output is correct
12 Correct 220 ms 36496 KB Output is correct
13 Correct 229 ms 36424 KB Output is correct
14 Correct 220 ms 36432 KB Output is correct
15 Correct 232 ms 36688 KB Output is correct
16 Correct 221 ms 36388 KB Output is correct
17 Correct 227 ms 36424 KB Output is correct
18 Correct 229 ms 36540 KB Output is correct
19 Correct 47 ms 18124 KB Output is correct
20 Correct 230 ms 36436 KB Output is correct
21 Correct 219 ms 36568 KB Output is correct
22 Correct 51 ms 19648 KB Output is correct
23 Correct 60 ms 19108 KB Output is correct
24 Correct 52 ms 19652 KB Output is correct
25 Correct 51 ms 19680 KB Output is correct
26 Correct 62 ms 19332 KB Output is correct
27 Correct 45 ms 18116 KB Output is correct
28 Correct 61 ms 19856 KB Output is correct
29 Correct 44 ms 18344 KB Output is correct
30 Correct 52 ms 19652 KB Output is correct
31 Correct 45 ms 18120 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 11096 KB Output is correct
2 Correct 4 ms 11100 KB Output is correct
3 Correct 3 ms 11128 KB Output is correct
4 Correct 2 ms 11248 KB Output is correct
5 Correct 4 ms 11096 KB Output is correct
6 Correct 4 ms 11236 KB Output is correct
7 Correct 2 ms 11100 KB Output is correct
8 Correct 3 ms 11100 KB Output is correct
9 Correct 4 ms 11356 KB Output is correct
10 Correct 3 ms 11260 KB Output is correct
11 Correct 4 ms 11356 KB Output is correct
12 Correct 3 ms 11308 KB Output is correct
13 Correct 3 ms 11100 KB Output is correct
14 Correct 3 ms 11204 KB Output is correct
15 Correct 3 ms 11344 KB Output is correct
16 Correct 108 ms 19620 KB Output is correct
17 Correct 302 ms 38168 KB Output is correct
18 Correct 22 ms 13660 KB Output is correct
19 Correct 95 ms 21448 KB Output is correct
20 Correct 281 ms 38312 KB Output is correct
21 Correct 180 ms 25136 KB Output is correct
22 Correct 92 ms 20164 KB Output is correct
23 Correct 266 ms 37968 KB Output is correct
24 Correct 270 ms 37952 KB Output is correct
25 Correct 325 ms 37960 KB Output is correct
26 Correct 102 ms 21248 KB Output is correct
27 Correct 117 ms 21448 KB Output is correct
28 Correct 107 ms 21184 KB Output is correct
29 Correct 105 ms 21204 KB Output is correct
30 Correct 113 ms 21300 KB Output is correct
31 Correct 3 ms 11100 KB Output is correct
32 Correct 3 ms 11100 KB Output is correct
33 Correct 2 ms 11100 KB Output is correct
34 Correct 3 ms 11100 KB Output is correct
35 Correct 3 ms 11100 KB Output is correct
36 Correct 3 ms 11252 KB Output is correct
37 Correct 2 ms 11244 KB Output is correct
38 Correct 2 ms 11100 KB Output is correct
39 Correct 3 ms 11248 KB Output is correct
40 Correct 2 ms 11100 KB Output is correct
41 Correct 121 ms 22296 KB Output is correct
42 Correct 262 ms 36356 KB Output is correct
43 Correct 240 ms 36492 KB Output is correct
44 Correct 46 ms 18160 KB Output is correct
45 Correct 255 ms 36424 KB Output is correct
46 Correct 255 ms 36384 KB Output is correct
47 Correct 262 ms 36816 KB Output is correct
48 Correct 225 ms 36312 KB Output is correct
49 Correct 247 ms 36396 KB Output is correct
50 Correct 231 ms 36408 KB Output is correct
51 Correct 222 ms 36436 KB Output is correct
52 Correct 220 ms 36496 KB Output is correct
53 Correct 229 ms 36424 KB Output is correct
54 Correct 220 ms 36432 KB Output is correct
55 Correct 232 ms 36688 KB Output is correct
56 Correct 221 ms 36388 KB Output is correct
57 Correct 227 ms 36424 KB Output is correct
58 Correct 229 ms 36540 KB Output is correct
59 Correct 47 ms 18124 KB Output is correct
60 Correct 230 ms 36436 KB Output is correct
61 Correct 219 ms 36568 KB Output is correct
62 Correct 51 ms 19648 KB Output is correct
63 Correct 60 ms 19108 KB Output is correct
64 Correct 52 ms 19652 KB Output is correct
65 Correct 51 ms 19680 KB Output is correct
66 Correct 62 ms 19332 KB Output is correct
67 Correct 45 ms 18116 KB Output is correct
68 Correct 61 ms 19856 KB Output is correct
69 Correct 44 ms 18344 KB Output is correct
70 Correct 52 ms 19652 KB Output is correct
71 Correct 45 ms 18120 KB Output is correct
72 Correct 172 ms 25580 KB Output is correct
73 Correct 269 ms 37968 KB Output is correct
74 Correct 303 ms 38396 KB Output is correct
75 Correct 268 ms 37960 KB Output is correct
76 Correct 266 ms 37968 KB Output is correct
77 Correct 270 ms 38148 KB Output is correct
78 Correct 271 ms 37960 KB Output is correct
79 Correct 305 ms 38132 KB Output is correct
80 Correct 269 ms 38164 KB Output is correct
81 Correct 282 ms 38216 KB Output is correct
82 Correct 269 ms 37956 KB Output is correct
83 Correct 276 ms 38260 KB Output is correct
84 Correct 271 ms 38172 KB Output is correct
85 Correct 276 ms 38052 KB Output is correct
86 Correct 292 ms 38228 KB Output is correct
87 Correct 274 ms 38128 KB Output is correct
88 Correct 287 ms 38032 KB Output is correct
89 Correct 93 ms 20172 KB Output is correct
90 Correct 269 ms 37964 KB Output is correct
91 Correct 283 ms 37856 KB Output is correct
92 Correct 98 ms 21224 KB Output is correct
93 Correct 125 ms 21064 KB Output is correct
94 Correct 100 ms 21184 KB Output is correct
95 Correct 96 ms 21196 KB Output is correct
96 Correct 124 ms 20880 KB Output is correct
97 Correct 85 ms 19812 KB Output is correct
98 Correct 98 ms 21444 KB Output is correct
99 Correct 87 ms 19696 KB Output is correct
100 Correct 95 ms 21184 KB Output is correct