답안 #1038479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038479 2024-07-29T20:53:47 Z ArthuroWich 꿈 (IOI13_dreaming) C++17
47 / 100
64 ms 17648 KB
#include "dreaming.h"
#include<bits/stdc++.h>
using namespace std;
vector<pair<int, int>> adj[100005];
int proc[100005], no, nod, dist[100005][2];
void dfs(int i, int p, 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(int i, int p, 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(int i, 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<int, int> calc(int i) {
    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 = INT_MAX;
    ch(i, -1);
    return {nod, no};
}
int travelTime(int n, int m, int l, int A[], int B[], int T[]) {
    vector<pair<int, int>> comp;
    for (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 (int i = 0; i < n; i++) {
        if (proc[i]) {
            continue;
        }
        comp.push_back(calc(i));
    }
    sort(comp.rbegin(), comp.rend());
    deque<pair<int, int>> a;
    bool f = 0;
    for (int i = 0; i < comp.size(); i += 2) {
        if (f) {
            a.push_front(comp[i]);
            if (i+1 < comp.size()) {
                a.push_back(comp[i+1]);
            }
        } else {
            a.push_back(comp[i]);
            if (i+1 < comp.size()) {
                a.push_front(comp[i+1]);
            }
        }
        f ^= 1;
    }
    for (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});
    }
    int a1, b1;
    no = 0, nod = 0;
    for (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:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for (int i = 0; i < comp.size(); i += 2) {
      |                     ~~^~~~~~~~~~~~~
dreaming.cpp:69:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |             if (i+1 < comp.size()) {
      |                 ~~~~^~~~~~~~~~~~~
dreaming.cpp:74:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |             if (i+1 < comp.size()) {
      |                 ~~~~^~~~~~~~~~~~~
dreaming.cpp:80:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for (int i = 1; i < a.size(); i++) {
      |                     ~~^~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 16208 KB Output is correct
2 Correct 38 ms 16144 KB Output is correct
3 Correct 33 ms 12372 KB Output is correct
4 Correct 6 ms 6488 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 12 ms 7532 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 23 ms 8668 KB Output is correct
9 Correct 30 ms 10428 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 42 ms 12124 KB Output is correct
12 Correct 47 ms 13916 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4960 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 1 ms 4956 KB Output is correct
24 Correct 1 ms 4956 KB Output is correct
25 Correct 1 ms 4956 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 16208 KB Output is correct
2 Correct 38 ms 16144 KB Output is correct
3 Correct 33 ms 12372 KB Output is correct
4 Correct 6 ms 6488 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 12 ms 7532 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 23 ms 8668 KB Output is correct
9 Correct 30 ms 10428 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 42 ms 12124 KB Output is correct
12 Correct 47 ms 13916 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 1 ms 4956 KB Output is correct
24 Correct 1 ms 4960 KB Output is correct
25 Correct 1 ms 4956 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Correct 1 ms 4956 KB Output is correct
28 Correct 1 ms 2908 KB Output is correct
29 Correct 1 ms 4956 KB Output is correct
30 Correct 1 ms 4956 KB Output is correct
31 Correct 1 ms 4956 KB Output is correct
32 Correct 1 ms 4956 KB Output is correct
33 Correct 1 ms 4956 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 1 ms 4956 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4956 KB Output is correct
39 Correct 40 ms 16108 KB Output is correct
40 Correct 37 ms 16208 KB Output is correct
41 Correct 26 ms 12380 KB Output is correct
42 Correct 6 ms 6492 KB Output is correct
43 Correct 1 ms 4956 KB Output is correct
44 Correct 1 ms 4956 KB Output is correct
45 Correct 1 ms 4956 KB Output is correct
46 Correct 1 ms 4956 KB Output is correct
47 Correct 1 ms 4956 KB Output is correct
48 Correct 1 ms 4956 KB Output is correct
49 Correct 1 ms 4956 KB Output is correct
50 Correct 1 ms 4952 KB Output is correct
51 Correct 1 ms 4956 KB Output is correct
52 Correct 1 ms 4956 KB Output is correct
53 Correct 1 ms 4956 KB Output is correct
54 Correct 1 ms 4956 KB Output is correct
55 Correct 1 ms 4956 KB Output is correct
56 Correct 1 ms 4956 KB Output is correct
57 Correct 52 ms 10460 KB Output is correct
58 Correct 48 ms 10332 KB Output is correct
59 Correct 54 ms 10324 KB Output is correct
60 Correct 51 ms 10332 KB Output is correct
61 Correct 51 ms 10328 KB Output is correct
62 Correct 48 ms 10484 KB Output is correct
63 Correct 44 ms 9944 KB Output is correct
64 Correct 46 ms 9928 KB Output is correct
65 Correct 44 ms 10328 KB Output is correct
66 Correct 44 ms 10332 KB Output is correct
67 Correct 50 ms 10332 KB Output is correct
68 Correct 51 ms 10328 KB Output is correct
69 Correct 53 ms 10580 KB Output is correct
70 Correct 52 ms 10576 KB Output is correct
71 Correct 1 ms 2908 KB Output is correct
72 Correct 2 ms 4956 KB Output is correct
73 Correct 2 ms 4956 KB Output is correct
74 Correct 2 ms 4956 KB Output is correct
75 Correct 3 ms 4952 KB Output is correct
76 Correct 2 ms 4952 KB Output is correct
77 Correct 2 ms 4952 KB Output is correct
78 Correct 2 ms 4956 KB Output is correct
79 Correct 2 ms 4956 KB Output is correct
80 Correct 52 ms 10332 KB Output is correct
81 Correct 51 ms 10192 KB Output is correct
82 Correct 46 ms 10480 KB Output is correct
83 Correct 50 ms 10328 KB Output is correct
84 Correct 2 ms 4992 KB Output is correct
85 Correct 2 ms 4956 KB Output is correct
86 Correct 2 ms 4952 KB Output is correct
87 Correct 2 ms 4956 KB Output is correct
88 Correct 2 ms 4956 KB Output is correct
89 Correct 2 ms 4956 KB Output is correct
90 Correct 2 ms 4956 KB Output is correct
91 Correct 2 ms 4956 KB Output is correct
92 Correct 2 ms 4956 KB Output is correct
93 Correct 3 ms 5212 KB Output is correct
94 Correct 1 ms 4956 KB Output is correct
95 Correct 1 ms 4956 KB Output is correct
96 Correct 1 ms 4956 KB Output is correct
97 Correct 1 ms 4956 KB Output is correct
98 Correct 1 ms 4952 KB Output is correct
99 Correct 1 ms 4956 KB Output is correct
100 Correct 1 ms 4960 KB Output is correct
101 Correct 1 ms 4956 KB Output is correct
102 Correct 1 ms 4956 KB Output is correct
103 Correct 1 ms 4956 KB Output is correct
104 Correct 5 ms 5844 KB Output is correct
105 Correct 13 ms 7416 KB Output is correct
106 Correct 1 ms 4956 KB Output is correct
107 Correct 24 ms 8596 KB Output is correct
108 Correct 30 ms 10460 KB Output is correct
109 Correct 1 ms 4956 KB Output is correct
110 Correct 47 ms 12124 KB Output is correct
111 Correct 49 ms 14036 KB Output is correct
112 Correct 1 ms 4952 KB Output is correct
113 Correct 64 ms 17648 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 27 ms 14800 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4956 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4960 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 2908 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 1 ms 4956 KB Output is correct
24 Correct 1 ms 4956 KB Output is correct
25 Correct 1 ms 4956 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Incorrect 1 ms 4968 KB Output isn't correct
28 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 16208 KB Output is correct
2 Correct 38 ms 16144 KB Output is correct
3 Correct 33 ms 12372 KB Output is correct
4 Correct 6 ms 6488 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 12 ms 7532 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 23 ms 8668 KB Output is correct
9 Correct 30 ms 10428 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 42 ms 12124 KB Output is correct
12 Correct 47 ms 13916 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 1 ms 4956 KB Output is correct
24 Correct 1 ms 4960 KB Output is correct
25 Correct 1 ms 4956 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Correct 1 ms 4956 KB Output is correct
28 Correct 1 ms 2908 KB Output is correct
29 Correct 1 ms 4956 KB Output is correct
30 Correct 1 ms 4956 KB Output is correct
31 Correct 1 ms 4956 KB Output is correct
32 Correct 1 ms 4956 KB Output is correct
33 Correct 1 ms 4956 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 1 ms 4956 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4956 KB Output is correct
39 Correct 40 ms 16108 KB Output is correct
40 Correct 37 ms 16208 KB Output is correct
41 Correct 26 ms 12380 KB Output is correct
42 Correct 6 ms 6492 KB Output is correct
43 Correct 1 ms 4956 KB Output is correct
44 Correct 1 ms 4956 KB Output is correct
45 Correct 1 ms 4956 KB Output is correct
46 Correct 1 ms 4956 KB Output is correct
47 Correct 1 ms 4956 KB Output is correct
48 Correct 1 ms 4956 KB Output is correct
49 Correct 1 ms 4956 KB Output is correct
50 Correct 1 ms 4952 KB Output is correct
51 Correct 1 ms 4956 KB Output is correct
52 Correct 1 ms 4956 KB Output is correct
53 Correct 1 ms 4956 KB Output is correct
54 Correct 1 ms 4956 KB Output is correct
55 Correct 1 ms 4956 KB Output is correct
56 Correct 1 ms 4956 KB Output is correct
57 Correct 52 ms 10460 KB Output is correct
58 Correct 48 ms 10332 KB Output is correct
59 Correct 54 ms 10324 KB Output is correct
60 Correct 51 ms 10332 KB Output is correct
61 Correct 51 ms 10328 KB Output is correct
62 Correct 48 ms 10484 KB Output is correct
63 Correct 44 ms 9944 KB Output is correct
64 Correct 46 ms 9928 KB Output is correct
65 Correct 44 ms 10328 KB Output is correct
66 Correct 44 ms 10332 KB Output is correct
67 Correct 50 ms 10332 KB Output is correct
68 Correct 51 ms 10328 KB Output is correct
69 Correct 53 ms 10580 KB Output is correct
70 Correct 52 ms 10576 KB Output is correct
71 Correct 1 ms 2908 KB Output is correct
72 Correct 2 ms 4956 KB Output is correct
73 Correct 2 ms 4956 KB Output is correct
74 Correct 2 ms 4956 KB Output is correct
75 Correct 3 ms 4952 KB Output is correct
76 Correct 2 ms 4952 KB Output is correct
77 Correct 2 ms 4952 KB Output is correct
78 Correct 2 ms 4956 KB Output is correct
79 Correct 2 ms 4956 KB Output is correct
80 Correct 52 ms 10332 KB Output is correct
81 Correct 51 ms 10192 KB Output is correct
82 Correct 46 ms 10480 KB Output is correct
83 Correct 50 ms 10328 KB Output is correct
84 Correct 2 ms 4992 KB Output is correct
85 Correct 2 ms 4956 KB Output is correct
86 Correct 2 ms 4952 KB Output is correct
87 Correct 2 ms 4956 KB Output is correct
88 Correct 2 ms 4956 KB Output is correct
89 Correct 2 ms 4956 KB Output is correct
90 Correct 2 ms 4956 KB Output is correct
91 Correct 2 ms 4956 KB Output is correct
92 Correct 2 ms 4956 KB Output is correct
93 Correct 3 ms 5212 KB Output is correct
94 Correct 1 ms 4956 KB Output is correct
95 Correct 1 ms 4956 KB Output is correct
96 Correct 1 ms 4956 KB Output is correct
97 Correct 1 ms 4956 KB Output is correct
98 Correct 1 ms 4952 KB Output is correct
99 Correct 1 ms 4956 KB Output is correct
100 Correct 1 ms 4960 KB Output is correct
101 Correct 1 ms 4956 KB Output is correct
102 Correct 1 ms 4956 KB Output is correct
103 Correct 1 ms 4956 KB Output is correct
104 Correct 5 ms 5844 KB Output is correct
105 Correct 13 ms 7416 KB Output is correct
106 Correct 1 ms 4956 KB Output is correct
107 Correct 24 ms 8596 KB Output is correct
108 Correct 30 ms 10460 KB Output is correct
109 Correct 1 ms 4956 KB Output is correct
110 Correct 47 ms 12124 KB Output is correct
111 Correct 49 ms 14036 KB Output is correct
112 Correct 1 ms 4952 KB Output is correct
113 Correct 64 ms 17648 KB Output is correct
114 Incorrect 27 ms 14800 KB Output isn't correct
115 Halted 0 ms 0 KB -