oj.uz

답안 #894678

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
894678 2023-12-28T16:52:14 Z CyberCow Evacuation plan (IZhO18_plan) C++17
100 / 100
 314 ms 34292 KB 
#include <random>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <chrono>
#define fr first
#define sc second
#define ad push_back
using namespace std;
using ll = long long;
mt19937 rnd(348502);

const int N = 100005;

vector<pair<int, int>> v[N];
int dist[N];

int p[N], sz[N];
int mecpapa;
int has[N];
int gggg[N];

void make_set(int i)
{
    p[i] = i;
    sz[i] = 1;
    gggg[i] = dist[i];
}

int get_papa(int i)
{
    if (p[i] == i)
        return i;
    return get_papa(p[i]);
}

vector<int> mde[N];


void union_set(int a, int b, int ggg)
{
    a = get_papa(a);
    b = get_papa(b);
    if (a == b) return;
    if (sz[a] < sz[b])
        swap(a, b);
    p[b] = a;
    sz[a] += sz[b];
    mde[a].push_back(b);
    has[b] = a;
    gggg[b] = ggg;
    mecpapa = a;
}


int xorutyun[N];

void Dfs(int g, int xr)
{
    xorutyun[g] = xr;
    for (auto to : mde[g])
    {
        Dfs(to, xr + 1);
    }
}

void solve()
{
    int n, i, j, m, x, y, w;
    cin >> n >> m;
    for ( i = 0; i < m; i++)
    {
        cin >> x >> y >> w;
        v[x].push_back({ y, w });
        v[y].push_back({ x, w });
    }
    for ( i = 1; i <= n; i++)
    {
        dist[i] = 1e9;
    }
    int k;
    cin >> k;
    priority_queue<pair<int, int>> q;
    for ( i = 0; i < k; i++)
    {
        cin >> x;
        q.push({ 0, x });
        dist[x] = 0;
    }
    while (!q.empty())
    {
        pair<int, int> gag = q.top();
        q.pop();
        gag.first *= -1;
        if (gag.first > dist[gag.second])
            continue;
        for (auto to : v[gag.second])
        {
            if (gag.first + to.second < dist[to.first])
            {
                dist[to.first] = gag.first + to.second;
                q.push({-dist[to.first], to.first });
            }
        }
    }
    vector<pair<int, int>> hert;
    for ( i = 1; i <= n; i++)
    {
        hert.push_back({ dist[i], i });
        make_set(i);
    }
    sort(hert.begin(), hert.end());
    for ( i = hert.size() - 1; i >= 0; i--)
    {
        for (auto to : v[hert[i].second])
        {
            if (dist[to.first] >= hert[i].first)
            {
                union_set(to.first, hert[i].second, hert[i].first);
            }
        }
    }
    Dfs(mecpapa, 0);
    int qq;
    cin >> qq;
    for ( i = 0; i < qq; i++)
    {
        cin >> x >> y;
        int res = 1e9;
        while (x != y)
        {
            if (xorutyun[x] > xorutyun[y])
            {
                res = min(res, gggg[x]);
                x = has[x];
            }
            else
            {
                res = min(res, gggg[y]);
                y = has[y];
            }
        }
        cout << res << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int tt = 1;
    //cin >> tt;
    while (tt--) {
        solve();
    }
    return 0;
}

Compilation message

plan.cpp: In function 'void solve()':
plan.cpp:84:15: warning: unused variable 'j' [-Wunused-variable]
   84 |     int n, i, j, m, x, y, w;
      |               ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 1 ms 7296 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7512 KB Output is correct
9 Correct 3 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 7352 KB Output is correct
14 Correct 2 ms 7260 KB Output is correct
15 Correct 2 ms 7260 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 1 ms 7296 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7512 KB Output is correct
9 Correct 3 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 7352 KB Output is correct
14 Correct 2 ms 7260 KB Output is correct
15 Correct 2 ms 7260 KB Output is correct
16 Correct 79 ms 14292 KB Output is correct
17 Correct 259 ms 29524 KB Output is correct
18 Correct 19 ms 9308 KB Output is correct
19 Correct 83 ms 16076 KB Output is correct
20 Correct 256 ms 29352 KB Output is correct
21 Correct 140 ms 18500 KB Output is correct
22 Correct 69 ms 14940 KB Output is correct
23 Correct 285 ms 29408 KB Output is correct
24 Correct 247 ms 29228 KB Output is correct
25 Correct 249 ms 29156 KB Output is correct
26 Correct 69 ms 15684 KB Output is correct
27 Correct 87 ms 15920 KB Output is correct
28 Correct 77 ms 15768 KB Output is correct
29 Correct 76 ms 15972 KB Output is correct
30 Correct 70 ms 15824 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7256 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7336 KB Output is correct
4 Correct 2 ms 7260 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7300 KB Output is correct
8 Correct 2 ms 7260 KB Output is correct
9 Correct 2 ms 7260 KB Output is correct
10 Correct 2 ms 7336 KB Output is correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 15968 KB Output is correct
2 Correct 260 ms 24112 KB Output is correct
3 Correct 288 ms 24116 KB Output is correct
4 Correct 49 ms 11972 KB Output is correct
5 Correct 254 ms 24028 KB Output is correct
6 Correct 217 ms 24140 KB Output is correct
7 Correct 247 ms 24072 KB Output is correct
8 Correct 252 ms 24224 KB Output is correct
9 Correct 246 ms 24112 KB Output is correct
10 Correct 247 ms 24132 KB Output is correct
11 Correct 259 ms 24084 KB Output is correct
12 Correct 212 ms 23996 KB Output is correct
13 Correct 243 ms 24048 KB Output is correct
14 Correct 241 ms 24144 KB Output is correct
15 Correct 228 ms 24692 KB Output is correct
16 Correct 233 ms 24088 KB Output is correct
17 Correct 217 ms 24136 KB Output is correct
18 Correct 237 ms 24148 KB Output is correct
19 Correct 40 ms 12240 KB Output is correct
20 Correct 264 ms 24144 KB Output is correct
21 Correct 195 ms 23632 KB Output is correct
22 Correct 50 ms 13812 KB Output is correct
23 Correct 51 ms 12644 KB Output is correct
24 Correct 56 ms 13768 KB Output is correct
25 Correct 55 ms 13768 KB Output is correct
26 Correct 55 ms 12740 KB Output is correct
27 Correct 44 ms 11972 KB Output is correct
28 Correct 67 ms 13820 KB Output is correct
29 Correct 41 ms 11972 KB Output is correct
30 Correct 53 ms 13776 KB Output is correct
31 Correct 46 ms 11880 KB Output is correct

Subtask #5
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 7260 KB Output is correct
2 Correct 2 ms 7260 KB Output is correct
3 Correct 2 ms 7260 KB Output is correct
4 Correct 1 ms 7296 KB Output is correct
5 Correct 2 ms 7260 KB Output is correct
6 Correct 2 ms 7260 KB Output is correct
7 Correct 2 ms 7260 KB Output is correct
8 Correct 2 ms 7512 KB Output is correct
9 Correct 3 ms 7260 KB Output is correct
10 Correct 2 ms 7260 KB Output is correct
11 Correct 2 ms 7260 KB Output is correct
12 Correct 2 ms 7260 KB Output is correct
13 Correct 2 ms 7352 KB Output is correct
14 Correct 2 ms 7260 KB Output is correct
15 Correct 2 ms 7260 KB Output is correct
16 Correct 79 ms 14292 KB Output is correct
17 Correct 259 ms 29524 KB Output is correct
18 Correct 19 ms 9308 KB Output is correct
19 Correct 83 ms 16076 KB Output is correct
20 Correct 256 ms 29352 KB Output is correct
21 Correct 140 ms 18500 KB Output is correct
22 Correct 69 ms 14940 KB Output is correct
23 Correct 285 ms 29408 KB Output is correct
24 Correct 247 ms 29228 KB Output is correct
25 Correct 249 ms 29156 KB Output is correct
26 Correct 69 ms 15684 KB Output is correct
27 Correct 87 ms 15920 KB Output is correct
28 Correct 77 ms 15768 KB Output is correct
29 Correct 76 ms 15972 KB Output is correct
30 Correct 70 ms 15824 KB Output is correct
31 Correct 2 ms 7256 KB Output is correct
32 Correct 2 ms 7260 KB Output is correct
33 Correct 2 ms 7336 KB Output is correct
34 Correct 2 ms 7260 KB Output is correct
35 Correct 2 ms 7260 KB Output is correct
36 Correct 2 ms 7260 KB Output is correct
37 Correct 2 ms 7300 KB Output is correct
38 Correct 2 ms 7260 KB Output is correct
39 Correct 2 ms 7260 KB Output is correct
40 Correct 2 ms 7336 KB Output is correct
41 Correct 106 ms 15968 KB Output is correct
42 Correct 260 ms 24112 KB Output is correct
43 Correct 288 ms 24116 KB Output is correct
44 Correct 49 ms 11972 KB Output is correct
45 Correct 254 ms 24028 KB Output is correct
46 Correct 217 ms 24140 KB Output is correct
47 Correct 247 ms 24072 KB Output is correct
48 Correct 252 ms 24224 KB Output is correct
49 Correct 246 ms 24112 KB Output is correct
50 Correct 247 ms 24132 KB Output is correct
51 Correct 259 ms 24084 KB Output is correct
52 Correct 212 ms 23996 KB Output is correct
53 Correct 243 ms 24048 KB Output is correct
54 Correct 241 ms 24144 KB Output is correct
55 Correct 228 ms 24692 KB Output is correct
56 Correct 233 ms 24088 KB Output is correct
57 Correct 217 ms 24136 KB Output is correct
58 Correct 237 ms 24148 KB Output is correct
59 Correct 40 ms 12240 KB Output is correct
60 Correct 264 ms 24144 KB Output is correct
61 Correct 195 ms 23632 KB Output is correct
62 Correct 50 ms 13812 KB Output is correct
63 Correct 51 ms 12644 KB Output is correct
64 Correct 56 ms 13768 KB Output is correct
65 Correct 55 ms 13768 KB Output is correct
66 Correct 55 ms 12740 KB Output is correct
67 Correct 44 ms 11972 KB Output is correct
68 Correct 67 ms 13820 KB Output is correct
69 Correct 41 ms 11972 KB Output is correct
70 Correct 53 ms 13776 KB Output is correct
71 Correct 46 ms 11880 KB Output is correct
72 Correct 125 ms 20940 KB Output is correct
73 Correct 240 ms 33704 KB Output is correct
74 Correct 231 ms 33864 KB Output is correct
75 Correct 259 ms 33788 KB Output is correct
76 Correct 268 ms 33748 KB Output is correct
77 Correct 249 ms 33808 KB Output is correct
78 Correct 247 ms 33864 KB Output is correct
79 Correct 244 ms 33656 KB Output is correct
80 Correct 244 ms 33728 KB Output is correct
81 Correct 257 ms 33864 KB Output is correct
82 Correct 230 ms 33776 KB Output is correct
83 Correct 233 ms 33720 KB Output is correct
84 Correct 244 ms 33872 KB Output is correct
85 Correct 288 ms 34292 KB Output is correct
86 Correct 243 ms 33792 KB Output is correct
87 Correct 258 ms 33776 KB Output is correct
88 Correct 314 ms 33944 KB Output is correct
89 Correct 63 ms 15964 KB Output is correct
90 Correct 261 ms 33864 KB Output is correct
91 Correct 246 ms 33660 KB Output is correct
92 Correct 82 ms 16924 KB Output is correct
93 Correct 80 ms 16328 KB Output is correct
94 Correct 71 ms 16844 KB Output is correct
95 Correct 73 ms 16852 KB Output is correct
96 Correct 97 ms 15812 KB Output is correct
97 Correct 78 ms 15580 KB Output is correct
98 Correct 70 ms 16872 KB Output is correct
99 Correct 66 ms 15556 KB Output is correct
100 Correct 74 ms 16840 KB Output is correct