답안 #297537

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297537	2020-09-11T15:48:33 Z	Haunted_Cpp	꿈 (IOI13_dreaming)	C++17	47 / 100	333 ms	23800 KB

dreaming

#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;

const int MAX_N = 1e5 + 5;

vector<vector<pair<int, int>>> g(MAX_N);
vector<vector<pair<int, int>>> tree(MAX_N);
vector<int> par(MAX_N);

bitset<MAX_N> vis;

pair<int, int> best_way = {-1, -1};
void find_diam(const vector<vector<pair<int, int>>>& graph, int node, int p, int w) {
  par[node] = p;
  vis[node] = 1;
  best_way = max(best_way, {w, node});
  for (auto [to, cost] : graph[node]) {
    if (to != p) {
      find_diam(graph, to, node, w + cost);
    }
  }
}

vector<int> dp_down(MAX_N);
vector<int> dp_up(MAX_N);

int calc_down(const vector<vector<pair<int, int>>>& graph, int node, int p) {
  for (auto [to, cost] : graph[node]) {
    if (to != p) {
      dp_down[node] = max(dp_down[node], calc_down(graph, to, node) + cost);
    }
  }
  return dp_down[node];
}

void calc_up(const vector<vector<pair<int, int>>>& graph, int node, int p) {
  int best = -1, second_best = -1;
  for (auto [to, cost] : graph[node]) {
    if (to != p) {
      const int w = dp_down[to] + cost;
      if (w > best) {
        swap(best, second_best);
        best = w;
      } else {
        second_best = max(second_best, w);
      }
    }
  }
  for (auto [to, cost] : graph[node]) {
    if (to != p) {
      const int w = dp_down[to] + cost;
      dp_up[to] = max({dp_up[to], cost + dp_up[node], cost + (w == best ? second_best : best)});
      calc_up(graph, to, node);
    }
  }
}

pair<int, int> opt = {2e9, 2e9};

void find_optimal(const vector<vector<pair<int, int>>>& graph, int node, int p) {
  opt = min(opt, { max(dp_down[node], dp_up[node]), node } );
  //~ cout << node << ' ' << dp_down[node] << ' ' << dp_up[node] << '\n';
  for (auto [to, cost] : graph[node]) {
    if (to != p) {
      find_optimal(graph, to, node);
    }
  }
  //~ return mn;
}

tuple<int, int, int> find_center(const vector<vector<pair<int, int>>>& graph, int node) {
  best_way = {-1, -1};
  find_diam(graph, node, -1, 0);
  int L = best_way.second;
  best_way = {-1, -1};
  find_diam(graph, L, -1, 0);
  int longest_path = best_way.first;
  calc_down(graph, node, -1);
  calc_up(graph, node, -1);
  opt = {2e9, 2e9};
  find_optimal(graph, node, -1);
  //~ cout << opt.second << ' ' << longest_path << '\n';
  return make_tuple(opt.first, opt.second, longest_path);
}

int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
  for (int i = 0; i < M; i++) {
    //~ cout << A[i] << ' ' << B[i] << ' ' << T[i] << '\n';
    g[A[i]].emplace_back(B[i], T[i]);
    g[B[i]].emplace_back(A[i], T[i]);
    tree[A[i]].emplace_back(B[i], T[i]);
    tree[B[i]].emplace_back(A[i], T[i]);
  }
  int nxt = -1;
  vector<tuple<int, int, int>> best;
  for (int i = 0; i < N; i++) {
    if (!vis[i]) {
      best.emplace_back(find_center(g, i));
      //~ auto w = ;
      //~ if (nxt != -1) {
        //~ cout << nxt << ' ' << w.first << '\n';
        //~ tree[nxt].emplace_back(w.first, L);
        //~ tree[w.first].emplace_back(nxt, L);
      //~ }
      //~ nxt = w.first;
      //~ return 0;
    }
  }
  sort(best.begin(), best.end(), [&](auto a, auto b) {
    return get<0>(a) < get<0>(b); 
  });
  for (int i = 1; i < (int) best.size(); i++) {
    tree[ get<1>(best[i - 1]) ].emplace_back( get<1>(best[i]), L);
    tree[ get<1>(best[i]) ].emplace_back( get<1>(best[i - 1]), L);
  }
  return get<2>(find_center(tree, 0));
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:95:7: warning: unused variable 'nxt' [-Wunused-variable]
   95 |   int nxt = -1;
      |       ^~~

Subtask #1
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	136 ms	19320 KB	Output is correct
2	Correct	136 ms	19192 KB	Output is correct
3	Correct	82 ms	15992 KB	Output is correct
4	Correct	16 ms	8192 KB	Output is correct
5	Correct	15 ms	7424 KB	Output is correct
6	Correct	29 ms	9216 KB	Output is correct
7	Correct	5 ms	6272 KB	Output is correct
8	Correct	70 ms	11640 KB	Output is correct
9	Correct	108 ms	14328 KB	Output is correct
10	Correct	5 ms	6272 KB	Output is correct
11	Correct	189 ms	15608 KB	Output is correct
12	Correct	218 ms	17328 KB	Output is correct
13	Correct	5 ms	6400 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	136 ms	19320 KB	Output is correct
2	Correct	136 ms	19192 KB	Output is correct
3	Correct	82 ms	15992 KB	Output is correct
4	Correct	16 ms	8192 KB	Output is correct
5	Correct	15 ms	7424 KB	Output is correct
6	Correct	29 ms	9216 KB	Output is correct
7	Correct	5 ms	6272 KB	Output is correct
8	Correct	70 ms	11640 KB	Output is correct
9	Correct	108 ms	14328 KB	Output is correct
10	Correct	5 ms	6272 KB	Output is correct
11	Correct	189 ms	15608 KB	Output is correct
12	Correct	218 ms	17328 KB	Output is correct
13	Correct	5 ms	6400 KB	Output is correct
14	Correct	5 ms	6272 KB	Output is correct
15	Correct	5 ms	6272 KB	Output is correct
16	Correct	5 ms	6272 KB	Output is correct
17	Correct	5 ms	6272 KB	Output is correct
18	Correct	4 ms	6272 KB	Output is correct
19	Correct	5 ms	6272 KB	Output is correct
20	Correct	5 ms	6272 KB	Output is correct
21	Correct	5 ms	6272 KB	Output is correct
22	Correct	5 ms	6272 KB	Output is correct
23	Correct	5 ms	6272 KB	Output is correct
24	Correct	5 ms	6272 KB	Output is correct
25	Correct	5 ms	6272 KB	Output is correct
26	Correct	5 ms	6272 KB	Output is correct
27	Correct	5 ms	6400 KB	Output is correct
28	Correct	6 ms	6272 KB	Output is correct
29	Correct	5 ms	6272 KB	Output is correct
30	Correct	5 ms	6272 KB	Output is correct
31	Correct	5 ms	6272 KB	Output is correct
32	Correct	5 ms	6272 KB	Output is correct
33	Correct	5 ms	6272 KB	Output is correct
34	Correct	4 ms	6272 KB	Output is correct
35	Correct	5 ms	6272 KB	Output is correct
36	Correct	5 ms	6272 KB	Output is correct
37	Correct	5 ms	6272 KB	Output is correct
38	Correct	5 ms	6272 KB	Output is correct

Subtask #3
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	136 ms	19320 KB	Output is correct
2	Correct	136 ms	19192 KB	Output is correct
3	Correct	82 ms	15992 KB	Output is correct
4	Correct	16 ms	8192 KB	Output is correct
5	Correct	15 ms	7424 KB	Output is correct
6	Correct	29 ms	9216 KB	Output is correct
7	Correct	5 ms	6272 KB	Output is correct
8	Correct	70 ms	11640 KB	Output is correct
9	Correct	108 ms	14328 KB	Output is correct
10	Correct	5 ms	6272 KB	Output is correct
11	Correct	189 ms	15608 KB	Output is correct
12	Correct	218 ms	17328 KB	Output is correct
13	Correct	5 ms	6400 KB	Output is correct
14	Correct	5 ms	6272 KB	Output is correct
15	Correct	5 ms	6272 KB	Output is correct
16	Correct	5 ms	6272 KB	Output is correct
17	Correct	5 ms	6272 KB	Output is correct
18	Correct	4 ms	6272 KB	Output is correct
19	Correct	5 ms	6272 KB	Output is correct
20	Correct	5 ms	6272 KB	Output is correct
21	Correct	5 ms	6272 KB	Output is correct
22	Correct	5 ms	6272 KB	Output is correct
23	Correct	5 ms	6272 KB	Output is correct
24	Correct	5 ms	6272 KB	Output is correct
25	Correct	5 ms	6272 KB	Output is correct
26	Correct	5 ms	6272 KB	Output is correct
27	Correct	5 ms	6400 KB	Output is correct
28	Correct	6 ms	6272 KB	Output is correct
29	Correct	5 ms	6272 KB	Output is correct
30	Correct	5 ms	6272 KB	Output is correct
31	Correct	5 ms	6272 KB	Output is correct
32	Correct	5 ms	6272 KB	Output is correct
33	Correct	5 ms	6272 KB	Output is correct
34	Correct	4 ms	6272 KB	Output is correct
35	Correct	5 ms	6272 KB	Output is correct
36	Correct	5 ms	6272 KB	Output is correct
37	Correct	5 ms	6272 KB	Output is correct
38	Correct	5 ms	6272 KB	Output is correct
39	Correct	148 ms	19576 KB	Output is correct
40	Correct	148 ms	19576 KB	Output is correct
41	Correct	79 ms	16376 KB	Output is correct
42	Correct	16 ms	8192 KB	Output is correct
43	Correct	4 ms	6272 KB	Output is correct
44	Correct	5 ms	6272 KB	Output is correct
45	Correct	5 ms	6400 KB	Output is correct
46	Correct	5 ms	6272 KB	Output is correct
47	Correct	4 ms	6272 KB	Output is correct
48	Correct	5 ms	6272 KB	Output is correct
49	Correct	5 ms	6272 KB	Output is correct
50	Correct	5 ms	6272 KB	Output is correct
51	Correct	5 ms	6272 KB	Output is correct
52	Correct	5 ms	6272 KB	Output is correct
53	Correct	5 ms	6272 KB	Output is correct
54	Correct	5 ms	6272 KB	Output is correct
55	Correct	6 ms	6272 KB	Output is correct
56	Correct	5 ms	6272 KB	Output is correct
57	Correct	333 ms	16248 KB	Output is correct
58	Correct	301 ms	16248 KB	Output is correct
59	Correct	307 ms	16152 KB	Output is correct
60	Correct	275 ms	16120 KB	Output is correct
61	Correct	261 ms	15976 KB	Output is correct
62	Correct	268 ms	15952 KB	Output is correct
63	Correct	257 ms	15736 KB	Output is correct
64	Correct	253 ms	15736 KB	Output is correct
65	Correct	280 ms	15736 KB	Output is correct
66	Correct	262 ms	15608 KB	Output is correct
67	Correct	269 ms	15992 KB	Output is correct
68	Correct	275 ms	16192 KB	Output is correct
69	Correct	284 ms	16068 KB	Output is correct
70	Correct	283 ms	16044 KB	Output is correct
71	Correct	5 ms	6144 KB	Output is correct
72	Correct	7 ms	6528 KB	Output is correct
73	Correct	7 ms	6528 KB	Output is correct
74	Correct	9 ms	6528 KB	Output is correct
75	Correct	7 ms	6528 KB	Output is correct
76	Correct	7 ms	6528 KB	Output is correct
77	Correct	8 ms	6528 KB	Output is correct
78	Correct	7 ms	6528 KB	Output is correct
79	Correct	7 ms	6560 KB	Output is correct
80	Correct	284 ms	16064 KB	Output is correct
81	Correct	316 ms	16044 KB	Output is correct
82	Correct	291 ms	15864 KB	Output is correct
83	Correct	285 ms	15992 KB	Output is correct
84	Correct	7 ms	6656 KB	Output is correct
85	Correct	6 ms	6400 KB	Output is correct
86	Correct	8 ms	6528 KB	Output is correct
87	Correct	9 ms	6528 KB	Output is correct
88	Correct	8 ms	6528 KB	Output is correct
89	Correct	11 ms	6528 KB	Output is correct
90	Correct	12 ms	6528 KB	Output is correct
91	Correct	9 ms	6528 KB	Output is correct
92	Correct	7 ms	6528 KB	Output is correct
93	Correct	8 ms	6528 KB	Output is correct
94	Correct	5 ms	6272 KB	Output is correct
95	Correct	5 ms	6272 KB	Output is correct
96	Correct	5 ms	6272 KB	Output is correct
97	Correct	4 ms	6272 KB	Output is correct
98	Correct	5 ms	6272 KB	Output is correct
99	Correct	5 ms	6272 KB	Output is correct
100	Correct	5 ms	6272 KB	Output is correct
101	Correct	5 ms	6176 KB	Output is correct
102	Correct	5 ms	6272 KB	Output is correct
103	Correct	5 ms	6272 KB	Output is correct
104	Correct	15 ms	7424 KB	Output is correct
105	Correct	34 ms	9216 KB	Output is correct
106	Correct	5 ms	6272 KB	Output is correct
107	Correct	80 ms	11512 KB	Output is correct
108	Correct	103 ms	14268 KB	Output is correct
109	Correct	5 ms	6272 KB	Output is correct
110	Correct	268 ms	15456 KB	Output is correct
111	Correct	236 ms	17400 KB	Output is correct
112	Correct	6 ms	6400 KB	Output is correct
113	Correct	329 ms	23800 KB	Output is correct

Subtask #4
0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	101 ms	18288 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	136 ms	19320 KB	Output is correct
2	Correct	136 ms	19192 KB	Output is correct
3	Correct	82 ms	15992 KB	Output is correct
4	Correct	16 ms	8192 KB	Output is correct
5	Correct	15 ms	7424 KB	Output is correct
6	Correct	29 ms	9216 KB	Output is correct
7	Correct	5 ms	6272 KB	Output is correct
8	Correct	70 ms	11640 KB	Output is correct
9	Correct	108 ms	14328 KB	Output is correct
10	Correct	5 ms	6272 KB	Output is correct
11	Correct	189 ms	15608 KB	Output is correct
12	Correct	218 ms	17328 KB	Output is correct
13	Correct	5 ms	6400 KB	Output is correct
14	Incorrect	5 ms	6272 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #6
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	136 ms	19320 KB	Output is correct
2	Correct	136 ms	19192 KB	Output is correct
3	Correct	82 ms	15992 KB	Output is correct
4	Correct	16 ms	8192 KB	Output is correct
5	Correct	15 ms	7424 KB	Output is correct
6	Correct	29 ms	9216 KB	Output is correct
7	Correct	5 ms	6272 KB	Output is correct
8	Correct	70 ms	11640 KB	Output is correct
9	Correct	108 ms	14328 KB	Output is correct
10	Correct	5 ms	6272 KB	Output is correct
11	Correct	189 ms	15608 KB	Output is correct
12	Correct	218 ms	17328 KB	Output is correct
13	Correct	5 ms	6400 KB	Output is correct
14	Correct	5 ms	6272 KB	Output is correct
15	Correct	5 ms	6272 KB	Output is correct
16	Correct	5 ms	6272 KB	Output is correct
17	Correct	5 ms	6272 KB	Output is correct
18	Correct	4 ms	6272 KB	Output is correct
19	Correct	5 ms	6272 KB	Output is correct
20	Correct	5 ms	6272 KB	Output is correct
21	Correct	5 ms	6272 KB	Output is correct
22	Correct	5 ms	6272 KB	Output is correct
23	Correct	5 ms	6272 KB	Output is correct
24	Correct	5 ms	6272 KB	Output is correct
25	Correct	5 ms	6272 KB	Output is correct
26	Correct	5 ms	6272 KB	Output is correct
27	Correct	5 ms	6400 KB	Output is correct
28	Correct	6 ms	6272 KB	Output is correct
29	Correct	5 ms	6272 KB	Output is correct
30	Correct	5 ms	6272 KB	Output is correct
31	Correct	5 ms	6272 KB	Output is correct
32	Correct	5 ms	6272 KB	Output is correct
33	Correct	5 ms	6272 KB	Output is correct
34	Correct	4 ms	6272 KB	Output is correct
35	Correct	5 ms	6272 KB	Output is correct
36	Correct	5 ms	6272 KB	Output is correct
37	Correct	5 ms	6272 KB	Output is correct
38	Correct	5 ms	6272 KB	Output is correct
39	Correct	148 ms	19576 KB	Output is correct
40	Correct	148 ms	19576 KB	Output is correct
41	Correct	79 ms	16376 KB	Output is correct
42	Correct	16 ms	8192 KB	Output is correct
43	Correct	4 ms	6272 KB	Output is correct
44	Correct	5 ms	6272 KB	Output is correct
45	Correct	5 ms	6400 KB	Output is correct
46	Correct	5 ms	6272 KB	Output is correct
47	Correct	4 ms	6272 KB	Output is correct
48	Correct	5 ms	6272 KB	Output is correct
49	Correct	5 ms	6272 KB	Output is correct
50	Correct	5 ms	6272 KB	Output is correct
51	Correct	5 ms	6272 KB	Output is correct
52	Correct	5 ms	6272 KB	Output is correct
53	Correct	5 ms	6272 KB	Output is correct
54	Correct	5 ms	6272 KB	Output is correct
55	Correct	6 ms	6272 KB	Output is correct
56	Correct	5 ms	6272 KB	Output is correct
57	Correct	333 ms	16248 KB	Output is correct
58	Correct	301 ms	16248 KB	Output is correct
59	Correct	307 ms	16152 KB	Output is correct
60	Correct	275 ms	16120 KB	Output is correct
61	Correct	261 ms	15976 KB	Output is correct
62	Correct	268 ms	15952 KB	Output is correct
63	Correct	257 ms	15736 KB	Output is correct
64	Correct	253 ms	15736 KB	Output is correct
65	Correct	280 ms	15736 KB	Output is correct
66	Correct	262 ms	15608 KB	Output is correct
67	Correct	269 ms	15992 KB	Output is correct
68	Correct	275 ms	16192 KB	Output is correct
69	Correct	284 ms	16068 KB	Output is correct
70	Correct	283 ms	16044 KB	Output is correct
71	Correct	5 ms	6144 KB	Output is correct
72	Correct	7 ms	6528 KB	Output is correct
73	Correct	7 ms	6528 KB	Output is correct
74	Correct	9 ms	6528 KB	Output is correct
75	Correct	7 ms	6528 KB	Output is correct
76	Correct	7 ms	6528 KB	Output is correct
77	Correct	8 ms	6528 KB	Output is correct
78	Correct	7 ms	6528 KB	Output is correct
79	Correct	7 ms	6560 KB	Output is correct
80	Correct	284 ms	16064 KB	Output is correct
81	Correct	316 ms	16044 KB	Output is correct
82	Correct	291 ms	15864 KB	Output is correct
83	Correct	285 ms	15992 KB	Output is correct
84	Correct	7 ms	6656 KB	Output is correct
85	Correct	6 ms	6400 KB	Output is correct
86	Correct	8 ms	6528 KB	Output is correct
87	Correct	9 ms	6528 KB	Output is correct
88	Correct	8 ms	6528 KB	Output is correct
89	Correct	11 ms	6528 KB	Output is correct
90	Correct	12 ms	6528 KB	Output is correct
91	Correct	9 ms	6528 KB	Output is correct
92	Correct	7 ms	6528 KB	Output is correct
93	Correct	8 ms	6528 KB	Output is correct
94	Correct	5 ms	6272 KB	Output is correct
95	Correct	5 ms	6272 KB	Output is correct
96	Correct	5 ms	6272 KB	Output is correct
97	Correct	4 ms	6272 KB	Output is correct
98	Correct	5 ms	6272 KB	Output is correct
99	Correct	5 ms	6272 KB	Output is correct
100	Correct	5 ms	6272 KB	Output is correct
101	Correct	5 ms	6176 KB	Output is correct
102	Correct	5 ms	6272 KB	Output is correct
103	Correct	5 ms	6272 KB	Output is correct
104	Correct	15 ms	7424 KB	Output is correct
105	Correct	34 ms	9216 KB	Output is correct
106	Correct	5 ms	6272 KB	Output is correct
107	Correct	80 ms	11512 KB	Output is correct
108	Correct	103 ms	14268 KB	Output is correct
109	Correct	5 ms	6272 KB	Output is correct
110	Correct	268 ms	15456 KB	Output is correct
111	Correct	236 ms	17400 KB	Output is correct
112	Correct	6 ms	6400 KB	Output is correct
113	Correct	329 ms	23800 KB	Output is correct
114	Incorrect	101 ms	18288 KB	Output isn't correct
115	Halted	0 ms	0 KB	-

답안 #297537

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 10.0 / 10.0

Subtask #3 23.0 / 23.0

Subtask #4 0 / 18.0

Subtask #5 0 / 12.0

Subtask #6 0 / 23.0

Subtask #1
14.0 / 14.0

Subtask #2
10.0 / 10.0

Subtask #3
23.0 / 23.0

Subtask #4
0 / 18.0

Subtask #5
0 / 12.0

Subtask #6
0 / 23.0