답안 #681130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681130	2023-01-12T11:42:18 Z	QwertyPi	즐거운 행로 (APIO20_fun)	C++14	100 / 100	246 ms	21744 KB

#include "fun.h"
#define fi first
#define se second
#include <bits/stdc++.h>

using namespace std;

int tp(priority_queue<pair<int, int>>& pq){
  return !pq.size() ? 0 : pq.top().fi;
}

vector<int> createFunTour(int N, int Q) {

  vector<int> dep(N), sz(N);
  for(int i = 0; i < N; i++){
    sz[i] = attractionsBehind(0, i);
  }
  int root = 0;
  for(int i = 0; i < N; i++){
    if(sz[i] <= sz[root] && sz[i] >= (N + 1) / 2) root = i;
  }
  vector<int> sons;
  priority_queue<pair<int, int>> subtrees[3];
  for(int i = 0; i < N; i++){
    dep[i] = hoursRequired(root, i);
  }
  for(int i = 0; i < N; i++){
    if(dep[i] == 1) sons.push_back(i);
  }
  for(int i = 0; i < N; i++){
    if(i == root) continue;
    int in_subtree = (int) sons.size() - 1;
    for(int j = 0; j < (int) sons.size() - 1; j++){
      if(hoursRequired(sons[j], i) == dep[i] - dep[sons[j]]){
        in_subtree = j;
      }
    }
    subtrees[in_subtree].push({dep[i], i});
  }
  vector<int> P;
  int _pv = -1;
  for(int i = 0; i < N - 1; i++){
    if(sons.size() == 3 && !subtrees[0].empty() && !subtrees[1].empty() && !subtrees[2].empty()){
      for(int j = 0; j < sons.size(); j++){
        if(subtrees[j].size() * 2 >= N - 1 - i && (_pv == j || _pv != j && tp(subtrees[_pv]) >= tp(subtrees[3 - _pv - j]))){
          while(subtrees[(j + 1) % 3].size()) subtrees[(j + 2) % 3].push(subtrees[(j + 1) % 3].top()), subtrees[(j + 1) % 3].pop();
          if(_pv == (j + 1) % 3) _pv = (j + 2) % 3;
          break;
        }
      }
    }
    int mx = -1, st = -1;
    for(int j = 0; j < sons.size(); j++){
      if(_pv == j) continue;
      if(subtrees[j].size() && subtrees[j].top().fi >= mx){
        mx = subtrees[j].top().fi, st = j;
      }
    }
    if(st == -1){
      P.push_back(root);
      for(int j = 0; j < sons.size(); j++){
        if(subtrees[j].size()) {
          P.push_back(subtrees[j].top().se);
          return P;
        }
      }
    }
    P.push_back(subtrees[st].top().se); subtrees[st].pop(); _pv = st;
  }
  P.push_back(root);
  return P;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:44:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |       for(int j = 0; j < sons.size(); j++){
      |                      ~~^~~~~~~~~~~~~
fun.cpp:45:35: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |         if(subtrees[j].size() * 2 >= N - 1 - i && (_pv == j || _pv != j && tp(subtrees[_pv]) >= tp(subtrees[3 - _pv - j]))){
      |            ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
fun.cpp:45:73: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   45 |         if(subtrees[j].size() * 2 >= N - 1 - i && (_pv == j || _pv != j && tp(subtrees[_pv]) >= tp(subtrees[3 - _pv - j]))){
      |                                                                ~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fun.cpp:53:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     for(int j = 0; j < sons.size(); j++){
      |                    ~~^~~~~~~~~~~~~
fun.cpp:61:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |       for(int j = 0; j < sons.size(); j++){
      |                      ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 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	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	212 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct

Subtask #3
21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	0 ms	212 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	348 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	118 ms	15852 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	2 ms	468 KB	Output is correct
21	Correct	3 ms	596 KB	Output is correct
22	Correct	6 ms	1236 KB	Output is correct
23	Correct	11 ms	2244 KB	Output is correct
24	Correct	15 ms	3032 KB	Output is correct
25	Correct	66 ms	9204 KB	Output is correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	9 ms	1748 KB	Output is correct
15	Correct	134 ms	15636 KB	Output is correct
16	Correct	150 ms	15500 KB	Output is correct
17	Correct	24 ms	3900 KB	Output is correct
18	Correct	56 ms	7308 KB	Output is correct
19	Correct	98 ms	12348 KB	Output is correct
20	Correct	4 ms	852 KB	Output is correct

Subtask #5
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 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	0 ms	212 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	1 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	340 KB	Output is correct
39	Correct	1 ms	212 KB	Output is correct
40	Correct	1 ms	340 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	118 ms	15852 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	2 ms	468 KB	Output is correct
47	Correct	3 ms	596 KB	Output is correct
48	Correct	6 ms	1236 KB	Output is correct
49	Correct	11 ms	2244 KB	Output is correct
50	Correct	15 ms	3032 KB	Output is correct
51	Correct	66 ms	9204 KB	Output is correct
52	Correct	1 ms	340 KB	Output is correct
53	Correct	9 ms	1748 KB	Output is correct
54	Correct	134 ms	15636 KB	Output is correct
55	Correct	150 ms	15500 KB	Output is correct
56	Correct	24 ms	3900 KB	Output is correct
57	Correct	56 ms	7308 KB	Output is correct
58	Correct	98 ms	12348 KB	Output is correct
59	Correct	4 ms	852 KB	Output is correct
60	Correct	159 ms	15684 KB	Output is correct
61	Correct	163 ms	18080 KB	Output is correct
62	Correct	162 ms	15812 KB	Output is correct
63	Correct	180 ms	19564 KB	Output is correct
64	Correct	161 ms	19568 KB	Output is correct
65	Correct	177 ms	16336 KB	Output is correct
66	Correct	204 ms	18244 KB	Output is correct
67	Correct	196 ms	19508 KB	Output is correct
68	Correct	189 ms	18992 KB	Output is correct
69	Correct	246 ms	20448 KB	Output is correct
70	Correct	156 ms	16028 KB	Output is correct
71	Correct	182 ms	19748 KB	Output is correct
72	Correct	217 ms	18760 KB	Output is correct
73	Correct	223 ms	19100 KB	Output is correct
74	Correct	207 ms	20668 KB	Output is correct
75	Correct	175 ms	16196 KB	Output is correct
76	Correct	157 ms	19728 KB	Output is correct
77	Correct	196 ms	21240 KB	Output is correct
78	Correct	192 ms	20448 KB	Output is correct
79	Correct	192 ms	21480 KB	Output is correct
80	Correct	197 ms	21744 KB	Output is correct
81	Correct	181 ms	16860 KB	Output is correct
82	Correct	191 ms	17216 KB	Output is correct
83	Correct	176 ms	17000 KB	Output is correct
84	Correct	64 ms	7240 KB	Output is correct

답안 #681130

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