답안 #961901

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
961901	2024-04-12T17:32:11 Z	kilkuwu	즐거운 행로 (APIO20_fun)	C++17	100 / 100	185 ms	22268 KB

#include "fun.h"

#include <bits/stdc++.h>

#ifdef LOCAL
#define clog std::cerr
#else 
#define clog if (0) std::cerr
#endif

std::vector<int> createFunTour(int N, int Q) {
  std::vector<std::pair<int, int>> subtree_size(N);
  subtree_size[0] = {N, 0};
  for (int i = 1; i < N; i++) {
    subtree_size[i] = {attractionsBehind(0, i), i};
  }

  std::sort(subtree_size.begin(), subtree_size.end());

  int centroid = -1;
  for (centroid = 0; centroid < N; centroid++) {
    if (subtree_size[centroid].first >= (N + 1) / 2) {
      centroid = subtree_size[centroid].second;
      break;
    }
  }
  
  assert(centroid != -1);

  std::vector<int> adj;
  std::vector<int> d(N);
  for (int i = 0; i < N; i++) {
    if (i == centroid) {
      d[i] = 0;
    } else {
      d[i] = hoursRequired(centroid, i);
    }

    if (d[i] == 1) {
      adj.push_back(i); 
    }
  }

  std::vector<int> g(N, -1);
  std::vector<std::vector<int>> f(3);

  for (int i = 0; i < N; i++) {
    if (i == centroid) continue;

    g[i] = 0;
    while (g[i] + 1 < (int) adj.size() && hoursRequired(adj[g[i]], i) > d[i]) {
      g[i]++;
    }
    f[g[i]].push_back(i);
  }

  std::vector<int> p = {0, 1, 2};

  std::vector<int> tour;

  auto shortest = [&](int i, int j) {
    return d[i] < d[j];
  };

  for (int i = 0; i < 3; i++) {
    std::sort(f[i].begin(), f[i].end(), shortest);
  }

  auto bigger_size = [&](int i, int j) {
    return f[i].size() > f[j].size();
  };

  auto farthest = [&](int i, int j) {
    return d[f[i].back()] > d[f[j].back()];
  };

  std::sort(p.begin(), p.end(), bigger_size);

  int last = -1;
  while (f[p[0]].size() < f[p[1]].size() + f[p[2]].size()) {
    std::sort(p.begin(), p.end(), farthest);
    int now = p[p[0] == last];
    tour.push_back(f[now].back());
    f[now].pop_back();
    last = now;
    std::sort(p.begin(), p.end(), bigger_size);
  }

  f[p[1]].insert(f[p[1]].end(), f[p[2]].begin(), f[p[2]].end());
  std::sort(f[p[1]].begin(), f[p[1]].end(), shortest);

  int from = 0;
  if (tour.size() && d[tour.back()] < d[f[p[1]].back()]) {
    from = 1;
  }

  while (f[p[from]].size()) {
    tour.push_back(f[p[from]].back());
    f[p[from]].pop_back();
    from ^= 1;
  }

  tour.push_back(centroid);

  return tour;
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	436 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	436 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	600 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	436 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	692 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	600 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	344 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	99 ms	17352 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	2 ms	604 KB	Output is correct
21	Correct	3 ms	860 KB	Output is correct
22	Correct	4 ms	1372 KB	Output is correct
23	Correct	10 ms	2396 KB	Output is correct
24	Correct	16 ms	3408 KB	Output is correct
25	Correct	60 ms	9968 KB	Output is correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	436 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	436 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	344 KB	Output is correct
12	Correct	1 ms	344 KB	Output is correct
13	Correct	1 ms	560 KB	Output is correct
14	Correct	7 ms	1980 KB	Output is correct
15	Correct	115 ms	17608 KB	Output is correct
16	Correct	108 ms	17248 KB	Output is correct
17	Correct	21 ms	4184 KB	Output is correct
18	Correct	48 ms	8092 KB	Output is correct
19	Correct	83 ms	13500 KB	Output is correct
20	Correct	3 ms	860 KB	Output is correct

Subtask #5
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	344 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	344 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	436 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	600 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	436 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	1 ms	344 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	692 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	1 ms	344 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	99 ms	17352 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	2 ms	604 KB	Output is correct
47	Correct	3 ms	860 KB	Output is correct
48	Correct	4 ms	1372 KB	Output is correct
49	Correct	10 ms	2396 KB	Output is correct
50	Correct	16 ms	3408 KB	Output is correct
51	Correct	60 ms	9968 KB	Output is correct
52	Correct	1 ms	560 KB	Output is correct
53	Correct	7 ms	1980 KB	Output is correct
54	Correct	115 ms	17608 KB	Output is correct
55	Correct	108 ms	17248 KB	Output is correct
56	Correct	21 ms	4184 KB	Output is correct
57	Correct	48 ms	8092 KB	Output is correct
58	Correct	83 ms	13500 KB	Output is correct
59	Correct	3 ms	860 KB	Output is correct
60	Correct	122 ms	17352 KB	Output is correct
61	Correct	146 ms	19652 KB	Output is correct
62	Correct	133 ms	17352 KB	Output is correct
63	Correct	147 ms	21308 KB	Output is correct
64	Correct	137 ms	21196 KB	Output is correct
65	Correct	149 ms	17540 KB	Output is correct
66	Correct	150 ms	19632 KB	Output is correct
67	Correct	146 ms	21512 KB	Output is correct
68	Correct	161 ms	20732 KB	Output is correct
69	Correct	185 ms	21956 KB	Output is correct
70	Correct	141 ms	17444 KB	Output is correct
71	Correct	133 ms	21204 KB	Output is correct
72	Correct	168 ms	20068 KB	Output is correct
73	Correct	155 ms	20848 KB	Output is correct
74	Correct	184 ms	22252 KB	Output is correct
75	Correct	128 ms	17612 KB	Output is correct
76	Correct	136 ms	21192 KB	Output is correct
77	Correct	156 ms	21244 KB	Output is correct
78	Correct	150 ms	20716 KB	Output is correct
79	Correct	151 ms	21960 KB	Output is correct
80	Correct	160 ms	22268 KB	Output is correct
81	Correct	126 ms	17356 KB	Output is correct
82	Correct	130 ms	17352 KB	Output is correct
83	Correct	173 ms	17616 KB	Output is correct
84	Correct	50 ms	7848 KB	Output is correct

답안 #961901

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 19.0 / 19.0

Subtask #5 34.0 / 34.0

Subtask #1
10.0 / 10.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
19.0 / 19.0

Subtask #5
34.0 / 34.0