oj.uz

Submission #595038

# Submission time Handle Problem Language Result Execution time Memory
595038 2022-07-13T09:26:21 Z pakhomovee Dreaming (IOI13_dreaming) C++17
47 / 100
 455 ms 16944 KB 
#include "dreaming.h"
#include <vector>
#include <unordered_map>
#include <deque>
#include <iostream>
#include <set>

using namespace std;

const int maxn = 1e5;
const int inf = 2e9;
bool used[maxn];
int cnt = 0;

unordered_map<int, int> dst(int v, vector<vector<pair<int, int>>> &g) {
    unordered_map<int, int> d;
    deque<int> q;
    q.push_back(v);
    d[v] = 0;
    while (!q.empty()) {
        int v = q.front();
        q.pop_front();
        for (auto [u, w] : g[v]) {
            if (!d.count(u)) {
                d[u] = d[v] + w;
                q.push_back(u);
            }
        }
    }
    return d;
}

pair<int, int> goFar(int v, vector<vector<pair<int, int>>> &g) {
    auto d1 = dst(v, g);
    int best = v;
    for (auto [u, x] : d1) {
        if (d1[best] < x) {
            best = u;
        }
        ++cnt;
        used[u] = true;
    }
    return { best, d1[best] };
}

pair<int, int> findDiam(int v, vector<vector<pair<int, int>>> &g) {
    int leafe = goFar(v, g).first;
    int best = goFar(leafe, g).first;
    int best1 = goFar(best, g).first;
    return { best, best1 };
}

int findDiamLen(int v, vector<vector<pair<int, int>>> &g) {
    int leafe = goFar(v, g).first;
    int best = goFar(leafe, g).first;
    return goFar(best, g).second;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    vector<vector<pair<int, int>>> g(N);
    for (int i = 0; i < M; ++i) {
        int u = A[i], v = B[i];
        g[u].push_back({ v, T[i] });
        g[v].push_back({ u, T[i] });
    }
    vector<pair<int, int>> dims;
    multiset<pair<int, int>> s;
    for (int i = 0; i < N; ++i) {
        if (!used[i]) {
            cnt = 0;
            auto [u, v] = findDiam(i, g);
            auto d1 = dst(u, g);
            auto d2 = dst(v, g);
            int vs = -1;
            int b1 = inf;
            for (auto [u, l] : d1) {
                if (b1 > max(l, d2[u])) {
                    b1 = max(l, d2[u]);
                    vs = u;
                }
            }
            s.insert({ b1, vs });
        }
    }
    for (int i = 1; i < s.size(); ++i) {
        auto [l1, u1] = *s.begin();
        s.erase(s.begin());
        auto [l2, u2] = *s.begin();
        s.erase(s.begin());
        g[u1].push_back({ u2, L });
        g[u2].push_back({ u1, L });
        if (l1 < l2) {
            swap(l1, l2);
            swap(u1, u2);
        }
        auto [u, v] = findDiam(u1, g);
        auto d1 = dst(u, g);
        auto d2 = dst(v, g);
        int vs = -1;
        int b1 = inf;
        for (auto [u, l] : d1) {
            if (b1 > max(l, d2[u])) {
                b1 = max(l, d2[u]);
                vs = u;
            }
        }
        s.insert({ b1, vs });
    }
    return findDiamLen(0, g);
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:85:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::multiset<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |     for (int i = 1; i < s.size(); ++i) {
      |                     ~~^~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 15328 KB Output is correct
2 Correct 250 ms 15300 KB Output is correct
3 Correct 129 ms 9436 KB Output is correct
4 Correct 28 ms 2380 KB Output is correct
5 Correct 23 ms 1740 KB Output is correct
6 Correct 46 ms 3236 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 120 ms 6152 KB Output is correct
9 Correct 154 ms 8192 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 240 ms 10852 KB Output is correct
12 Correct 295 ms 12088 KB Output is correct
13 Correct 3 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 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 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 15328 KB Output is correct
2 Correct 250 ms 15300 KB Output is correct
3 Correct 129 ms 9436 KB Output is correct
4 Correct 28 ms 2380 KB Output is correct
5 Correct 23 ms 1740 KB Output is correct
6 Correct 46 ms 3236 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 120 ms 6152 KB Output is correct
9 Correct 154 ms 8192 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 240 ms 10852 KB Output is correct
12 Correct 295 ms 12088 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 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 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 235 ms 15352 KB Output is correct
40 Correct 248 ms 15308 KB Output is correct
41 Correct 140 ms 9340 KB Output is correct
42 Correct 26 ms 2352 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 455 ms 16580 KB Output is correct
58 Correct 417 ms 16844 KB Output is correct
59 Correct 399 ms 16724 KB Output is correct
60 Correct 368 ms 16660 KB Output is correct
61 Correct 348 ms 16700 KB Output is correct
62 Correct 318 ms 16676 KB Output is correct
63 Correct 429 ms 16836 KB Output is correct
64 Correct 358 ms 16944 KB Output is correct
65 Correct 335 ms 16796 KB Output is correct
66 Correct 404 ms 16796 KB Output is correct
67 Correct 355 ms 16632 KB Output is correct
68 Correct 373 ms 16720 KB Output is correct
69 Correct 334 ms 16724 KB Output is correct
70 Correct 399 ms 16660 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 6 ms 724 KB Output is correct
73 Correct 6 ms 760 KB Output is correct
74 Correct 6 ms 724 KB Output is correct
75 Correct 6 ms 696 KB Output is correct
76 Correct 9 ms 724 KB Output is correct
77 Correct 6 ms 760 KB Output is correct
78 Correct 6 ms 804 KB Output is correct
79 Correct 7 ms 724 KB Output is correct
80 Correct 357 ms 16600 KB Output is correct
81 Correct 356 ms 16648 KB Output is correct
82 Correct 373 ms 16812 KB Output is correct
83 Correct 392 ms 16784 KB Output is correct
84 Correct 4 ms 748 KB Output is correct
85 Correct 4 ms 596 KB Output is correct
86 Correct 5 ms 724 KB Output is correct
87 Correct 5 ms 724 KB Output is correct
88 Correct 6 ms 724 KB Output is correct
89 Correct 5 ms 700 KB Output is correct
90 Correct 6 ms 724 KB Output is correct
91 Correct 8 ms 724 KB Output is correct
92 Correct 9 ms 724 KB Output is correct
93 Correct 5 ms 724 KB Output is correct
94 Correct 0 ms 212 KB Output is correct
95 Correct 0 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 212 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 0 ms 212 KB Output is correct
101 Correct 1 ms 340 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 0 ms 340 KB Output is correct
104 Correct 21 ms 1768 KB Output is correct
105 Correct 43 ms 3240 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 113 ms 6180 KB Output is correct
108 Correct 140 ms 8144 KB Output is correct
109 Correct 1 ms 340 KB Output is correct
110 Correct 220 ms 10664 KB Output is correct
111 Correct 280 ms 12064 KB Output is correct
112 Correct 2 ms 340 KB Output is correct
113 Correct 387 ms 16220 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 171 ms 8292 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 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 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Incorrect 2 ms 340 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 15328 KB Output is correct
2 Correct 250 ms 15300 KB Output is correct
3 Correct 129 ms 9436 KB Output is correct
4 Correct 28 ms 2380 KB Output is correct
5 Correct 23 ms 1740 KB Output is correct
6 Correct 46 ms 3236 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 120 ms 6152 KB Output is correct
9 Correct 154 ms 8192 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 240 ms 10852 KB Output is correct
12 Correct 295 ms 12088 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 340 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 340 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 235 ms 15352 KB Output is correct
40 Correct 248 ms 15308 KB Output is correct
41 Correct 140 ms 9340 KB Output is correct
42 Correct 26 ms 2352 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 455 ms 16580 KB Output is correct
58 Correct 417 ms 16844 KB Output is correct
59 Correct 399 ms 16724 KB Output is correct
60 Correct 368 ms 16660 KB Output is correct
61 Correct 348 ms 16700 KB Output is correct
62 Correct 318 ms 16676 KB Output is correct
63 Correct 429 ms 16836 KB Output is correct
64 Correct 358 ms 16944 KB Output is correct
65 Correct 335 ms 16796 KB Output is correct
66 Correct 404 ms 16796 KB Output is correct
67 Correct 355 ms 16632 KB Output is correct
68 Correct 373 ms 16720 KB Output is correct
69 Correct 334 ms 16724 KB Output is correct
70 Correct 399 ms 16660 KB Output is correct
71 Correct 0 ms 212 KB Output is correct
72 Correct 6 ms 724 KB Output is correct
73 Correct 6 ms 760 KB Output is correct
74 Correct 6 ms 724 KB Output is correct
75 Correct 6 ms 696 KB Output is correct
76 Correct 9 ms 724 KB Output is correct
77 Correct 6 ms 760 KB Output is correct
78 Correct 6 ms 804 KB Output is correct
79 Correct 7 ms 724 KB Output is correct
80 Correct 357 ms 16600 KB Output is correct
81 Correct 356 ms 16648 KB Output is correct
82 Correct 373 ms 16812 KB Output is correct
83 Correct 392 ms 16784 KB Output is correct
84 Correct 4 ms 748 KB Output is correct
85 Correct 4 ms 596 KB Output is correct
86 Correct 5 ms 724 KB Output is correct
87 Correct 5 ms 724 KB Output is correct
88 Correct 6 ms 724 KB Output is correct
89 Correct 5 ms 700 KB Output is correct
90 Correct 6 ms 724 KB Output is correct
91 Correct 8 ms 724 KB Output is correct
92 Correct 9 ms 724 KB Output is correct
93 Correct 5 ms 724 KB Output is correct
94 Correct 0 ms 212 KB Output is correct
95 Correct 0 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 1 ms 340 KB Output is correct
98 Correct 1 ms 212 KB Output is correct
99 Correct 1 ms 340 KB Output is correct
100 Correct 0 ms 212 KB Output is correct
101 Correct 1 ms 340 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 0 ms 340 KB Output is correct
104 Correct 21 ms 1768 KB Output is correct
105 Correct 43 ms 3240 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 113 ms 6180 KB Output is correct
108 Correct 140 ms 8144 KB Output is correct
109 Correct 1 ms 340 KB Output is correct
110 Correct 220 ms 10664 KB Output is correct
111 Correct 280 ms 12064 KB Output is correct
112 Correct 2 ms 340 KB Output is correct
113 Correct 387 ms 16220 KB Output is correct
114 Incorrect 171 ms 8292 KB Output isn't correct
115 Halted 0 ms 0 KB -