oj.uz

Submission #673539

# Submission time Handle Problem Language Result Execution time Memory
673539 2022-12-20T22:12:10 Z YENGOYAN Evacuation plan (IZhO18_plan) C++17
100 / 100
 550 ms 46328 KB 
// eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee //
// 271828___182845__904523__53602__ //
// 87___47____13______52____66__24_ //
// 97___75____72______47____09___36 // 
// 999595_____74______96____69___67 // 
// 62___77____24______07____66__30_ // 
// 35___35____47______59____45713__ //
// eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee //
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_map>
#include <cmath>
#include <climits>
#include <algorithm>
#include <random>
#include <queue>
#include <deque>
#include <iomanip>
#include <string>
#include <tuple>
#include <bitset>
#include <chrono>
#include <ctime>
#include <fstream>
#include <stack>
#include <cstdio>

using namespace std;
using ll = long long;
const int N = 1e5 + 5;
const ll mod = 1e9 + 7, inf = 1e18;

int n, m, k, q;
vector<vector<pair<int, ll>>> gp;
vector<vector<int>> tree;
vector<ll> g, mind, par, sizes, d, isok;
vector<pair<ll, int>> vp;
vector<pair<pair<int, int>, pair<int, int>>> vp_;
int get(int u) {
    if (u == par[u]) return u;
    return get(par[u]);
}

void union_sets(int u, int v) {
    int a = get(u), b = get(v);
    if (a == b) return;
    if (sizes[a] < sizes[b]) swap(a, b), swap(u, v);
    par[b] = a;
    sizes[a] += sizes[b];
    isok[b] = min(mind[v], mind[u]);
}

void build_tree() {
    for (int i = 0; i < vp_.size(); ++i) {
        int u = vp_[i].second.first, v = vp_[i].second.second;
        if (get(u) == get(v)) continue;
        tree[u].push_back(v);
        tree[v].push_back(u);
        union_sets(u, v);
    }
}


bool check(ll mnd, int x, int y) {
    if (mind[x] < mnd || mind[y] < mnd) return 0;
    int p1 = x, p2 = y;
    while (isok[x] >= mnd && x != par[x]) x = par[x];
    while (isok[y] >= mnd && y != par[y]) y = par[y];
    return x == y;
}

int main() {
  scanf("%d%d", &n, &m);
    gp = vector<vector<pair<int, ll>>>(n);
    mind = vector<ll>(n, 1e18);
    for (int i = 0; i < m; ++i) {
        int u, v, w; scanf("%d%d%d", &u, &v, &w);
        gp[--u].push_back({ --v, w });
        gp[v].push_back({ u, w });
        vp_.push_back({ {0, 0}, {u, v} });
    }
    scanf("%d", &k);
    g = vector<ll>(k);
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
    for (int i = 0; i < k; ++i) scanf("%d", &g[i]), --g[i], pq.push({0, g[i]}), mind[g[i]] = 0;
    while (pq.size()) {
        pair<ll, int> p = pq.top();
        pq.pop();
        ll d = p.first, u = p.second;
        if (mind[u] < d) continue;
        for (pair<int, ll> v : gp[u]) {
            if (mind[v.first] > mind[u] + v.second) {
                mind[v.first] = mind[u] + v.second;
                pq.push({ mind[v.first], v.first });
            }
        }
    }
    for (int i = 0; i < vp_.size(); ++i) {
        int u = vp_[i].second.first, v = vp_[i].second.second;
        if (mind[u] > mind[v]) swap(u, v);
        vp_[i] = { {mind[u], mind[v]}, {u, v} };
    }
    sort(vp_.rbegin(), vp_.rend());
    tree = vector<vector<int>>(n);
    isok = par = sizes = vector <ll>(n, 1);
    for (int i = 0; i < n; ++i) par[i] = i;
    build_tree();
    scanf("%d", &q);
    while (q--) {
        int s, t; scanf("%d%d", &s, &t); --s, --t;
        ll l = 0, r = 1e15 + 5;
        while (l + 1 < r) {
            ll m = (l + r) / 2;
            if (!check(m, s, t)) r = m;
            else l = m;
        }
        printf("%d\n", l);
    }
}

Compilation message

plan.cpp: In function 'void build_tree()':
plan.cpp:58:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for (int i = 0; i < vp_.size(); ++i) {
      |                     ~~^~~~~~~~~~~~
plan.cpp: In function 'bool check(ll, int, int)':
plan.cpp:70:9: warning: unused variable 'p1' [-Wunused-variable]
   70 |     int p1 = x, p2 = y;
      |         ^~
plan.cpp:70:17: warning: unused variable 'p2' [-Wunused-variable]
   70 |     int p1 = x, p2 = y;
      |                 ^~
plan.cpp: In function 'int main()':
plan.cpp:89:41: warning: format '%d' expects argument of type 'int*', but argument 2 has type '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type*' {aka 'long long int*'} [-Wformat=]
   89 |     for (int i = 0; i < k; ++i) scanf("%d", &g[i]), --g[i], pq.push({0, g[i]}), mind[g[i]] = 0;
      |                                        ~^
      |                                         |
      |                                         int*
      |                                        %lld
plan.cpp:102:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |     for (int i = 0; i < vp_.size(); ++i) {
      |                     ~~^~~~~~~~~~~~
plan.cpp:121:18: warning: format '%d' expects argument of type 'int', but argument 2 has type 'll' {aka 'long long int'} [-Wformat=]
  121 |         printf("%d\n", l);
      |                 ~^     ~
      |                  |     |
      |                  int   ll {aka long long int}
      |                 %lld
plan.cpp:77:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   77 |   scanf("%d%d", &n, &m);
      |   ~~~~~^~~~~~~~~~~~~~~~
plan.cpp:81:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         int u, v, w; scanf("%d%d%d", &u, &v, &w);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~~~
plan.cpp:86:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |     scanf("%d", &k);
      |     ~~~~~^~~~~~~~~~
plan.cpp:89:38: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     for (int i = 0; i < k; ++i) scanf("%d", &g[i]), --g[i], pq.push({0, g[i]}), mind[g[i]] = 0;
      |                                 ~~~~~^~~~~~~~~~~~~
plan.cpp:112:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
plan.cpp:114:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |         int s, t; scanf("%d%d", &s, &t); --s, --t;
      |                   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 161 ms 16236 KB Output is correct
17 Correct 519 ms 44916 KB Output is correct
18 Correct 31 ms 4544 KB Output is correct
19 Correct 143 ms 19844 KB Output is correct
20 Correct 470 ms 45000 KB Output is correct
21 Correct 248 ms 25844 KB Output is correct
22 Correct 132 ms 18372 KB Output is correct
23 Correct 495 ms 44864 KB Output is correct
24 Correct 484 ms 44872 KB Output is correct
25 Correct 479 ms 44956 KB Output is correct
26 Correct 147 ms 19780 KB Output is correct
27 Correct 142 ms 19756 KB Output is correct
28 Correct 130 ms 19652 KB Output is correct
29 Correct 134 ms 19836 KB Output is correct
30 Correct 140 ms 19880 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 211 ms 25012 KB Output is correct
2 Correct 434 ms 44384 KB Output is correct
3 Correct 425 ms 44524 KB Output is correct
4 Correct 72 ms 17432 KB Output is correct
5 Correct 419 ms 44368 KB Output is correct
6 Correct 442 ms 44456 KB Output is correct
7 Correct 438 ms 44456 KB Output is correct
8 Correct 472 ms 44456 KB Output is correct
9 Correct 425 ms 44404 KB Output is correct
10 Correct 410 ms 44400 KB Output is correct
11 Correct 440 ms 44532 KB Output is correct
12 Correct 434 ms 44396 KB Output is correct
13 Correct 446 ms 44400 KB Output is correct
14 Correct 418 ms 44472 KB Output is correct
15 Correct 439 ms 44592 KB Output is correct
16 Correct 534 ms 44444 KB Output is correct
17 Correct 480 ms 44412 KB Output is correct
18 Correct 485 ms 44456 KB Output is correct
19 Correct 84 ms 17432 KB Output is correct
20 Correct 415 ms 44436 KB Output is correct
21 Correct 406 ms 44504 KB Output is correct
22 Correct 94 ms 19448 KB Output is correct
23 Correct 82 ms 17860 KB Output is correct
24 Correct 108 ms 19444 KB Output is correct
25 Correct 89 ms 19452 KB Output is correct
26 Correct 89 ms 18088 KB Output is correct
27 Correct 74 ms 17416 KB Output is correct
28 Correct 87 ms 19444 KB Output is correct
29 Correct 83 ms 17492 KB Output is correct
30 Correct 99 ms 19472 KB Output is correct
31 Correct 76 ms 17464 KB Output is correct

Subtask #5
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 2 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 161 ms 16236 KB Output is correct
17 Correct 519 ms 44916 KB Output is correct
18 Correct 31 ms 4544 KB Output is correct
19 Correct 143 ms 19844 KB Output is correct
20 Correct 470 ms 45000 KB Output is correct
21 Correct 248 ms 25844 KB Output is correct
22 Correct 132 ms 18372 KB Output is correct
23 Correct 495 ms 44864 KB Output is correct
24 Correct 484 ms 44872 KB Output is correct
25 Correct 479 ms 44956 KB Output is correct
26 Correct 147 ms 19780 KB Output is correct
27 Correct 142 ms 19756 KB Output is correct
28 Correct 130 ms 19652 KB Output is correct
29 Correct 134 ms 19836 KB Output is correct
30 Correct 140 ms 19880 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 296 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 296 KB Output is correct
40 Correct 1 ms 304 KB Output is correct
41 Correct 211 ms 25012 KB Output is correct
42 Correct 434 ms 44384 KB Output is correct
43 Correct 425 ms 44524 KB Output is correct
44 Correct 72 ms 17432 KB Output is correct
45 Correct 419 ms 44368 KB Output is correct
46 Correct 442 ms 44456 KB Output is correct
47 Correct 438 ms 44456 KB Output is correct
48 Correct 472 ms 44456 KB Output is correct
49 Correct 425 ms 44404 KB Output is correct
50 Correct 410 ms 44400 KB Output is correct
51 Correct 440 ms 44532 KB Output is correct
52 Correct 434 ms 44396 KB Output is correct
53 Correct 446 ms 44400 KB Output is correct
54 Correct 418 ms 44472 KB Output is correct
55 Correct 439 ms 44592 KB Output is correct
56 Correct 534 ms 44444 KB Output is correct
57 Correct 480 ms 44412 KB Output is correct
58 Correct 485 ms 44456 KB Output is correct
59 Correct 84 ms 17432 KB Output is correct
60 Correct 415 ms 44436 KB Output is correct
61 Correct 406 ms 44504 KB Output is correct
62 Correct 94 ms 19448 KB Output is correct
63 Correct 82 ms 17860 KB Output is correct
64 Correct 108 ms 19444 KB Output is correct
65 Correct 89 ms 19452 KB Output is correct
66 Correct 89 ms 18088 KB Output is correct
67 Correct 74 ms 17416 KB Output is correct
68 Correct 87 ms 19444 KB Output is correct
69 Correct 83 ms 17492 KB Output is correct
70 Correct 99 ms 19472 KB Output is correct
71 Correct 76 ms 17464 KB Output is correct
72 Correct 294 ms 26756 KB Output is correct
73 Correct 491 ms 46196 KB Output is correct
74 Correct 475 ms 46232 KB Output is correct
75 Correct 468 ms 46248 KB Output is correct
76 Correct 471 ms 46220 KB Output is correct
77 Correct 483 ms 46244 KB Output is correct
78 Correct 492 ms 46160 KB Output is correct
79 Correct 484 ms 46224 KB Output is correct
80 Correct 486 ms 46328 KB Output is correct
81 Correct 508 ms 46160 KB Output is correct
82 Correct 507 ms 46200 KB Output is correct
83 Correct 484 ms 46208 KB Output is correct
84 Correct 498 ms 46248 KB Output is correct
85 Correct 524 ms 46196 KB Output is correct
86 Correct 471 ms 46232 KB Output is correct
87 Correct 502 ms 46236 KB Output is correct
88 Correct 550 ms 46160 KB Output is correct
89 Correct 130 ms 19672 KB Output is correct
90 Correct 482 ms 46296 KB Output is correct
91 Correct 446 ms 45892 KB Output is correct
92 Correct 136 ms 20972 KB Output is correct
93 Correct 163 ms 19896 KB Output is correct
94 Correct 168 ms 20832 KB Output is correct
95 Correct 141 ms 20916 KB Output is correct
96 Correct 164 ms 19476 KB Output is correct
97 Correct 142 ms 19120 KB Output is correct
98 Correct 144 ms 20788 KB Output is correct
99 Correct 139 ms 19292 KB Output is correct
100 Correct 149 ms 20776 KB Output is correct