oj.uz

Submission #1038482

# Submission time Handle Problem Language Result Execution time Memory
1038482 2024-07-29T20:58:14 Z ArthuroWich Dreaming (IOI13_dreaming) C++17
47 / 100
 68 ms 19316 KB 
#include "dreaming.h"
#include<bits/stdc++.h>
using namespace std;
vector<pair<long long int, long long int>> adj[100005];
long long int proc[100005], no, nod, dist[100005][2];
void dfs(long long int i, long long int p, long long int d) {
    if (d > nod) {
        no = i, nod = d;
    }
    proc[i] = 1;
    for (auto [j, w] : adj[i]) {
        if (j == p) {
            continue;
        }
        dfs(j, i, d+w);
    }
}
void dfsdist(long long int i, long long int p, long long int id) {
    for (auto [j, w] : adj[i]) {
        if (j == p) {
            continue;
        }
        dist[j][id] = dist[i][id]+w;
        dfsdist(j, i, id);
    }
}
void ch(long long int i, long long int p) {
    if (max(dist[i][0], dist[i][1]) < nod) {
        no = i, nod = max(dist[i][0], dist[i][1]);
    }
    for (auto [j, _] : adj[i]) {
        if (j == p) {
            continue;
        }
        ch(j, i);
    }
}
pair<long long int, long long int> calc(long long int i) {
    long long int a, b;
    no = i, nod = 0;
    dfs(i, -1, 0);
    a = no, no = i, nod = 0;
    dfs(a, -1, 0);
    b = no;
    dfsdist(a, -1, 0);
    dfsdist(b, -1, 1);
    no = i, nod = INT64_MAX;
    ch(i, -1);
    return {nod, no};
}
int travelTime(int n, int m, int l, int A[], int B[], int T[]) {
    vector<pair<long long int, long long int>> comp;
    for (long long int i = 0; i < m; i++) {
        adj[A[i]].push_back({B[i], T[i]});
        adj[B[i]].push_back({A[i], T[i]});
    }
    for (long long int i = 0; i < n; i++) {
        if (proc[i]) {
            continue;
        }
        comp.push_back(calc(i));
    }
    sort(comp.rbegin(), comp.rend());
    deque<pair<long long int, long long int>> a;
    bool f = 0;
    for (long long int i = 0; i < comp.size(); i++) {
        a.push_back(comp[i]);
    }
    for (long long int i = 1; i < a.size(); i++) {
        adj[a[i-1].second].push_back({a[i].second, l});
        adj[a[i].second].push_back({a[i-1].second, l});
    }
    long long int a1, b1;
    no = 0, nod = 0;
    for (long long int i = 0; i < n; i++) {
        dist[i][0] = 0;
    }
    dfs(0, -1, 0);
    a1 = no, no = 0, nod = 0;
    dfs(a1, -1, 0);
    b1 = no;
    dfsdist(a1, -1, 0);
    return dist[b1][0];
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:66:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (long long int i = 0; i < comp.size(); i++) {
      |                               ~~^~~~~~~~~~~~~
dreaming.cpp:69:33: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::deque<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |     for (long long int i = 1; i < a.size(); i++) {
      |                               ~~^~~~~~~~~~
dreaming.cpp:65:10: warning: unused variable 'f' [-Wunused-variable]
   65 |     bool f = 0;
      |          ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 17556 KB Output is correct
2 Correct 40 ms 17496 KB Output is correct
3 Correct 28 ms 13660 KB Output is correct
4 Correct 7 ms 7772 KB Output is correct
5 Correct 6 ms 7028 KB Output is correct
6 Correct 13 ms 8864 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 25 ms 10084 KB Output is correct
9 Correct 32 ms 11868 KB Output is correct
10 Correct 1 ms 5980 KB Output is correct
11 Correct 50 ms 13564 KB Output is correct
12 Correct 50 ms 15700 KB Output is correct
13 Correct 2 ms 6232 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5976 KB Output is correct
2 Correct 1 ms 5980 KB Output is correct
3 Correct 1 ms 5980 KB Output is correct
4 Correct 1 ms 5980 KB Output is correct
5 Correct 1 ms 5980 KB Output is correct
6 Correct 1 ms 5980 KB Output is correct
7 Correct 1 ms 5980 KB Output is correct
8 Correct 1 ms 5964 KB Output is correct
9 Correct 1 ms 5980 KB Output is correct
10 Correct 1 ms 5980 KB Output is correct
11 Correct 1 ms 5980 KB Output is correct
12 Correct 1 ms 5980 KB Output is correct
13 Correct 1 ms 5980 KB Output is correct
14 Correct 1 ms 6044 KB Output is correct
15 Correct 1 ms 3932 KB Output is correct
16 Correct 1 ms 5980 KB Output is correct
17 Correct 1 ms 5980 KB Output is correct
18 Correct 1 ms 5980 KB Output is correct
19 Correct 1 ms 5980 KB Output is correct
20 Correct 1 ms 5980 KB Output is correct
21 Correct 1 ms 5980 KB Output is correct
22 Correct 1 ms 5980 KB Output is correct
23 Correct 1 ms 5980 KB Output is correct
24 Correct 1 ms 5980 KB Output is correct
25 Correct 1 ms 5980 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 17556 KB Output is correct
2 Correct 40 ms 17496 KB Output is correct
3 Correct 28 ms 13660 KB Output is correct
4 Correct 7 ms 7772 KB Output is correct
5 Correct 6 ms 7028 KB Output is correct
6 Correct 13 ms 8864 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 25 ms 10084 KB Output is correct
9 Correct 32 ms 11868 KB Output is correct
10 Correct 1 ms 5980 KB Output is correct
11 Correct 50 ms 13564 KB Output is correct
12 Correct 50 ms 15700 KB Output is correct
13 Correct 2 ms 6232 KB Output is correct
14 Correct 1 ms 5976 KB Output is correct
15 Correct 1 ms 5980 KB Output is correct
16 Correct 1 ms 5980 KB Output is correct
17 Correct 1 ms 5980 KB Output is correct
18 Correct 1 ms 5980 KB Output is correct
19 Correct 1 ms 5980 KB Output is correct
20 Correct 1 ms 5980 KB Output is correct
21 Correct 1 ms 5964 KB Output is correct
22 Correct 1 ms 5980 KB Output is correct
23 Correct 1 ms 5980 KB Output is correct
24 Correct 1 ms 5980 KB Output is correct
25 Correct 1 ms 5980 KB Output is correct
26 Correct 1 ms 5980 KB Output is correct
27 Correct 1 ms 6044 KB Output is correct
28 Correct 1 ms 3932 KB Output is correct
29 Correct 1 ms 5980 KB Output is correct
30 Correct 1 ms 5980 KB Output is correct
31 Correct 1 ms 5980 KB Output is correct
32 Correct 1 ms 5980 KB Output is correct
33 Correct 1 ms 5980 KB Output is correct
34 Correct 1 ms 5980 KB Output is correct
35 Correct 1 ms 5980 KB Output is correct
36 Correct 1 ms 5980 KB Output is correct
37 Correct 1 ms 5980 KB Output is correct
38 Correct 1 ms 5980 KB Output is correct
39 Correct 41 ms 17692 KB Output is correct
40 Correct 42 ms 17492 KB Output is correct
41 Correct 30 ms 13652 KB Output is correct
42 Correct 7 ms 7772 KB Output is correct
43 Correct 1 ms 5980 KB Output is correct
44 Correct 1 ms 5980 KB Output is correct
45 Correct 1 ms 5980 KB Output is correct
46 Correct 1 ms 5980 KB Output is correct
47 Correct 1 ms 5980 KB Output is correct
48 Correct 2 ms 5980 KB Output is correct
49 Correct 2 ms 5976 KB Output is correct
50 Correct 1 ms 5980 KB Output is correct
51 Correct 1 ms 5980 KB Output is correct
52 Correct 1 ms 5980 KB Output is correct
53 Correct 1 ms 5980 KB Output is correct
54 Correct 1 ms 5980 KB Output is correct
55 Correct 1 ms 5980 KB Output is correct
56 Correct 1 ms 5980 KB Output is correct
57 Correct 58 ms 12120 KB Output is correct
58 Correct 56 ms 12120 KB Output is correct
59 Correct 68 ms 11860 KB Output is correct
60 Correct 59 ms 11856 KB Output is correct
61 Correct 50 ms 11728 KB Output is correct
62 Correct 51 ms 11604 KB Output is correct
63 Correct 46 ms 11352 KB Output is correct
64 Correct 49 ms 11356 KB Output is correct
65 Correct 48 ms 11448 KB Output is correct
66 Correct 50 ms 11352 KB Output is correct
67 Correct 55 ms 11868 KB Output is correct
68 Correct 55 ms 11728 KB Output is correct
69 Correct 55 ms 11752 KB Output is correct
70 Correct 63 ms 11928 KB Output is correct
71 Correct 1 ms 3928 KB Output is correct
72 Correct 2 ms 6236 KB Output is correct
73 Correct 2 ms 6236 KB Output is correct
74 Correct 2 ms 6232 KB Output is correct
75 Correct 2 ms 6236 KB Output is correct
76 Correct 2 ms 6236 KB Output is correct
77 Correct 2 ms 6236 KB Output is correct
78 Correct 2 ms 6236 KB Output is correct
79 Correct 2 ms 6236 KB Output is correct
80 Correct 54 ms 11676 KB Output is correct
81 Correct 55 ms 11868 KB Output is correct
82 Correct 52 ms 11604 KB Output is correct
83 Correct 49 ms 11600 KB Output is correct
84 Correct 2 ms 6236 KB Output is correct
85 Correct 1 ms 6236 KB Output is correct
86 Correct 2 ms 6236 KB Output is correct
87 Correct 2 ms 6236 KB Output is correct
88 Correct 2 ms 6236 KB Output is correct
89 Correct 2 ms 6236 KB Output is correct
90 Correct 3 ms 6236 KB Output is correct
91 Correct 2 ms 6236 KB Output is correct
92 Correct 2 ms 6236 KB Output is correct
93 Correct 2 ms 6236 KB Output is correct
94 Correct 1 ms 5980 KB Output is correct
95 Correct 1 ms 5980 KB Output is correct
96 Correct 1 ms 5980 KB Output is correct
97 Correct 1 ms 5980 KB Output is correct
98 Correct 1 ms 5980 KB Output is correct
99 Correct 1 ms 5980 KB Output is correct
100 Correct 1 ms 5980 KB Output is correct
101 Correct 1 ms 5980 KB Output is correct
102 Correct 1 ms 5980 KB Output is correct
103 Correct 1 ms 5980 KB Output is correct
104 Correct 7 ms 7000 KB Output is correct
105 Correct 13 ms 8868 KB Output is correct
106 Correct 1 ms 5980 KB Output is correct
107 Correct 25 ms 10288 KB Output is correct
108 Correct 33 ms 11868 KB Output is correct
109 Correct 1 ms 5980 KB Output is correct
110 Correct 46 ms 13660 KB Output is correct
111 Correct 50 ms 15800 KB Output is correct
112 Correct 2 ms 6232 KB Output is correct
113 Correct 68 ms 19316 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 17556 KB Output is correct
2 Correct 40 ms 17496 KB Output is correct
3 Correct 28 ms 13660 KB Output is correct
4 Correct 7 ms 7772 KB Output is correct
5 Correct 6 ms 7028 KB Output is correct
6 Correct 13 ms 8864 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 25 ms 10084 KB Output is correct
9 Correct 32 ms 11868 KB Output is correct
10 Correct 1 ms 5980 KB Output is correct
11 Correct 50 ms 13564 KB Output is correct
12 Correct 50 ms 15700 KB Output is correct
13 Correct 2 ms 6232 KB Output is correct
14 Correct 1 ms 5976 KB Output is correct
15 Correct 1 ms 5980 KB Output is correct
16 Correct 1 ms 5980 KB Output is correct
17 Correct 1 ms 5980 KB Output is correct
18 Correct 1 ms 5980 KB Output is correct
19 Correct 1 ms 5980 KB Output is correct
20 Correct 1 ms 5980 KB Output is correct
21 Correct 1 ms 5964 KB Output is correct
22 Correct 1 ms 5980 KB Output is correct
23 Correct 1 ms 5980 KB Output is correct
24 Correct 1 ms 5980 KB Output is correct
25 Correct 1 ms 5980 KB Output is correct
26 Correct 1 ms 5980 KB Output is correct
27 Correct 1 ms 6044 KB Output is correct
28 Correct 1 ms 3932 KB Output is correct
29 Correct 1 ms 5980 KB Output is correct
30 Correct 1 ms 5980 KB Output is correct
31 Correct 1 ms 5980 KB Output is correct
32 Correct 1 ms 5980 KB Output is correct
33 Correct 1 ms 5980 KB Output is correct
34 Correct 1 ms 5980 KB Output is correct
35 Correct 1 ms 5980 KB Output is correct
36 Correct 1 ms 5980 KB Output is correct
37 Correct 1 ms 5980 KB Output is correct
38 Correct 1 ms 5980 KB Output is correct
39 Correct 41 ms 17692 KB Output is correct
40 Correct 42 ms 17492 KB Output is correct
41 Correct 30 ms 13652 KB Output is correct
42 Correct 7 ms 7772 KB Output is correct
43 Correct 1 ms 5980 KB Output is correct
44 Correct 1 ms 5980 KB Output is correct
45 Correct 1 ms 5980 KB Output is correct
46 Correct 1 ms 5980 KB Output is correct
47 Correct 1 ms 5980 KB Output is correct
48 Correct 2 ms 5980 KB Output is correct
49 Correct 2 ms 5976 KB Output is correct
50 Correct 1 ms 5980 KB Output is correct
51 Correct 1 ms 5980 KB Output is correct
52 Correct 1 ms 5980 KB Output is correct
53 Correct 1 ms 5980 KB Output is correct
54 Correct 1 ms 5980 KB Output is correct
55 Correct 1 ms 5980 KB Output is correct
56 Correct 1 ms 5980 KB Output is correct
57 Correct 58 ms 12120 KB Output is correct
58 Correct 56 ms 12120 KB Output is correct
59 Correct 68 ms 11860 KB Output is correct
60 Correct 59 ms 11856 KB Output is correct
61 Correct 50 ms 11728 KB Output is correct
62 Correct 51 ms 11604 KB Output is correct
63 Correct 46 ms 11352 KB Output is correct
64 Correct 49 ms 11356 KB Output is correct
65 Correct 48 ms 11448 KB Output is correct
66 Correct 50 ms 11352 KB Output is correct
67 Correct 55 ms 11868 KB Output is correct
68 Correct 55 ms 11728 KB Output is correct
69 Correct 55 ms 11752 KB Output is correct
70 Correct 63 ms 11928 KB Output is correct
71 Correct 1 ms 3928 KB Output is correct
72 Correct 2 ms 6236 KB Output is correct
73 Correct 2 ms 6236 KB Output is correct
74 Correct 2 ms 6232 KB Output is correct
75 Correct 2 ms 6236 KB Output is correct
76 Correct 2 ms 6236 KB Output is correct
77 Correct 2 ms 6236 KB Output is correct
78 Correct 2 ms 6236 KB Output is correct
79 Correct 2 ms 6236 KB Output is correct
80 Correct 54 ms 11676 KB Output is correct
81 Correct 55 ms 11868 KB Output is correct
82 Correct 52 ms 11604 KB Output is correct
83 Correct 49 ms 11600 KB Output is correct
84 Correct 2 ms 6236 KB Output is correct
85 Correct 1 ms 6236 KB Output is correct
86 Correct 2 ms 6236 KB Output is correct
87 Correct 2 ms 6236 KB Output is correct
88 Correct 2 ms 6236 KB Output is correct
89 Correct 2 ms 6236 KB Output is correct
90 Correct 3 ms 6236 KB Output is correct
91 Correct 2 ms 6236 KB Output is correct
92 Correct 2 ms 6236 KB Output is correct
93 Correct 2 ms 6236 KB Output is correct
94 Correct 1 ms 5980 KB Output is correct
95 Correct 1 ms 5980 KB Output is correct
96 Correct 1 ms 5980 KB Output is correct
97 Correct 1 ms 5980 KB Output is correct
98 Correct 1 ms 5980 KB Output is correct
99 Correct 1 ms 5980 KB Output is correct
100 Correct 1 ms 5980 KB Output is correct
101 Correct 1 ms 5980 KB Output is correct
102 Correct 1 ms 5980 KB Output is correct
103 Correct 1 ms 5980 KB Output is correct
104 Correct 7 ms 7000 KB Output is correct
105 Correct 13 ms 8868 KB Output is correct
106 Correct 1 ms 5980 KB Output is correct
107 Correct 25 ms 10288 KB Output is correct
108 Correct 33 ms 11868 KB Output is correct
109 Correct 1 ms 5980 KB Output is correct
110 Correct 46 ms 13660 KB Output is correct
111 Correct 50 ms 15800 KB Output is correct
112 Correct 2 ms 6232 KB Output is correct
113 Correct 68 ms 19316 KB Output is correct
114 Incorrect 29 ms 18380 KB Output isn't correct
115 Halted 0 ms 0 KB -