답안 #964353

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
964353	2024-04-16T17:39:22 Z	efedmrlr	즐거운 행로 (APIO20_fun)	C++17	100 / 100	173 ms	21024 KB

// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include "fun.h"

using namespace std;


#define lli long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()


void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.00001;
const int INF = 1e9+500;
const int ALPH = 26;
const int LGN = 25;
constexpr int MOD = 1e9+7;
int n;

int centro = 0;
vector<int> roots;
vector<vector<array<int,2> > > subs;
array<int,2> isMerge() {
  if(subs.size() <= 2) return {-1, -1};
  array<array<int,2> ,3> s;
  REP(i, 3) {
    s[i] = {(int)subs[i].size(), i};
  }
  sort(all(s));
  if(s[2][0] >= s[1][0] + s[0][0]) {
    return {s[1][1], s[0][1]};
  }
  return  {-1, -1};
}

std::vector<int> createFunTour(int N, int Q) {
  n = N;
  int mn = INF;
  for(int i = 1; i<n; i++) {
    int tmp = attractionsBehind(0, i);
    if(tmp * 2 > N) {
      if(mn > tmp) {
        mn = tmp;
        centro = i;
      }
    }
  }
//   cout << "centro:" << centro << endl;
  for(int i = 0; i < n; i++) {
    if(i == centro) continue;
    if(hoursRequired(centro, i) == 1) {
      roots.pb(i);
    }

  }
  subs.assign(roots.size(), vector<array<int, 2> >());
  for(int i = 0; i < n; i++) {
    if(i == centro) continue;
    int d1, d2;
    d1 = hoursRequired(roots[0], i);
    if(roots.size() > 1) {
      d2 = hoursRequired(roots[1], i);
      if(d1 == d2) {
        subs[2].pb({d1 - 1, i});
      }
      else if(d1 > d2) {
        subs[1].pb({d2 + 1, i});
      }
      else {
        subs[0].pb({d1 + 1, i});
      }
    }
    else {
      subs[0].pb({d1 + 1, i});
      continue;
    }
    
  }
  for(int i = 0; i < roots.size(); i++) {
    sort(all(subs[i]));
  }
  vector<int> ret;
  int curp = 0, last = -1;
  int lh = 0;

    auto tmp = isMerge();
    if(tmp[0] > tmp[1]) swap(tmp[0], tmp[1]);
    if(tmp[0] != -1) {
        // cout << "merged" << endl;
        vector<array<int,2> > arr(subs[tmp[0]].size() + subs[tmp[1]].size());
        merge(all(subs[tmp[0]]), all(subs[tmp[1]]), arr.begin());
        swap(subs[tmp[0]], arr);
        swap(subs[tmp[1]], subs[subs.size() - 1]);
        subs.pop_back();
    }
//   for(auto &c : subs) {
//     for(auto &i : c) {
//       cout << i[0] << " " << i[1] << "\n";
//     }
//     cout << "new c" << endl;
//   }
  
  for(int z = 0; z < n - 1; z++) {
    curp = -1;
    if(z != 0 && subs.size() > 2) {
      bool f1 = 1;
      REP(i, 3) {
        if(i == last) continue;
        if(subs[i].back()[0] > lh) {
          f1 = 0;
        }
        
      }
      auto tmp = isMerge();
      if(tmp[0] > tmp[1]) swap(tmp[0], tmp[1]);
      if(f1 && tmp[0] != -1) {
        // cout << "merged" << "\n";
        vector<array<int,2> > arr(subs[tmp[0]].size() + subs[tmp[1]].size());
        merge(all(subs[tmp[0]]), all(subs[tmp[1]]), arr.begin());
        swap(subs[tmp[0]], arr);
        swap(subs[tmp[1]], subs[subs.size() - 1]);
        last = tmp[0];
        subs.pop_back();
      }
    }
    if(subs.size() == 2 && subs[0].size() != subs[1].size()) {
        if(subs[0].size() > subs[1].size()) curp = 0;
        else curp = 1; 
    }
    else {
        for(int i = 0; i < subs.size(); i++) {
        if(i == last) continue;
        
        if(curp == -1 || subs[curp].back()[0] < subs[i].back()[0]) {
            curp = i;
        }
        else if(subs[curp].back()[0] == subs[i].back()[0] && subs[curp].size() < subs[i].size()) {
            curp = i;
        }
        }
    }
    // cout << "curp:" << curp << endl;
    ret.pb(subs[curp].back()[1]);
    lh = subs[curp].back()[0];
    subs[curp].pop_back();
    if(subs[curp].size() == 0) {
      swap(subs[curp], subs[subs.size() - 1]);
      subs.pop_back();
      curp = -1;
    }
    last = curp;
    // cout << ret.back() << endl;
  }
  ret.pb(centro);
//   for(auto c : ret) {
//     cout << c << " ";
//   }
//   cout << endl;
  return ret;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:89:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |   for(int i = 0; i < roots.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~
fun.cpp:141:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::array<int, 2> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |         for(int i = 0; i < subs.size(); i++) {
      |                        ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	432 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	600 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	436 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	504 KB	Output is correct
25	Correct	0 ms	444 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	688 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 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	344 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	344 KB	Output is correct
40	Correct	1 ms	348 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	432 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	504 KB	Output is correct
13	Correct	0 ms	444 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	688 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	101 ms	16292 KB	Output is correct
19	Correct	1 ms	600 KB	Output is correct
20	Correct	2 ms	600 KB	Output is correct
21	Correct	3 ms	792 KB	Output is correct
22	Correct	5 ms	1372 KB	Output is correct
23	Correct	9 ms	2396 KB	Output is correct
24	Correct	13 ms	3164 KB	Output is correct
25	Correct	55 ms	9508 KB	Output is correct

Subtask #4
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	432 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 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	348 KB	Output is correct
14	Correct	11 ms	1880 KB	Output is correct
15	Correct	103 ms	16056 KB	Output is correct
16	Correct	113 ms	15864 KB	Output is correct
17	Correct	19 ms	3928 KB	Output is correct
18	Correct	50 ms	7592 KB	Output is correct
19	Correct	80 ms	12768 KB	Output is correct
20	Correct	4 ms	860 KB	Output is correct

Subtask #5
34.0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	432 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	1 ms	344 KB	Output is correct
14	Correct	0 ms	600 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	436 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	504 KB	Output is correct
25	Correct	0 ms	444 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	688 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	1 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	344 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	344 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	1 ms	348 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	101 ms	16292 KB	Output is correct
45	Correct	1 ms	600 KB	Output is correct
46	Correct	2 ms	600 KB	Output is correct
47	Correct	3 ms	792 KB	Output is correct
48	Correct	5 ms	1372 KB	Output is correct
49	Correct	9 ms	2396 KB	Output is correct
50	Correct	13 ms	3164 KB	Output is correct
51	Correct	55 ms	9508 KB	Output is correct
52	Correct	1 ms	348 KB	Output is correct
53	Correct	11 ms	1880 KB	Output is correct
54	Correct	103 ms	16056 KB	Output is correct
55	Correct	113 ms	15864 KB	Output is correct
56	Correct	19 ms	3928 KB	Output is correct
57	Correct	50 ms	7592 KB	Output is correct
58	Correct	80 ms	12768 KB	Output is correct
59	Correct	4 ms	860 KB	Output is correct
60	Correct	138 ms	16052 KB	Output is correct
61	Correct	154 ms	18460 KB	Output is correct
62	Correct	134 ms	16660 KB	Output is correct
63	Correct	124 ms	20384 KB	Output is correct
64	Correct	141 ms	20008 KB	Output is correct
65	Correct	137 ms	16116 KB	Output is correct
66	Correct	160 ms	18844 KB	Output is correct
67	Correct	153 ms	19892 KB	Output is correct
68	Correct	142 ms	19340 KB	Output is correct
69	Correct	166 ms	20596 KB	Output is correct
70	Correct	121 ms	16304 KB	Output is correct
71	Correct	141 ms	20220 KB	Output is correct
72	Correct	151 ms	18928 KB	Output is correct
73	Correct	173 ms	19340 KB	Output is correct
74	Correct	173 ms	20944 KB	Output is correct
75	Correct	137 ms	16580 KB	Output is correct
76	Correct	157 ms	20156 KB	Output is correct
77	Correct	161 ms	20184 KB	Output is correct
78	Correct	133 ms	19400 KB	Output is correct
79	Correct	147 ms	20820 KB	Output is correct
80	Correct	156 ms	21024 KB	Output is correct
81	Correct	136 ms	16052 KB	Output is correct
82	Correct	130 ms	16368 KB	Output is correct
83	Correct	153 ms	16516 KB	Output is correct
84	Correct	50 ms	7076 KB	Output is correct

답안 #964353

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