oj.uz

Submission #293418

# Submission time Handle Problem Language Result Execution time Memory
293418 2020-09-08T04:44:53 Z rama_pang Fun Tour (APIO20_fun) C++14
100 / 100
 371 ms 20376 KB 
#include "fun.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> createFunTour(int N, int Q) {
  auto Centroid = [&]() {
    int val = -1, res = -1;
    for (int i = 0; i < N; i++) {
      int q = attractionsBehind(0, i);
      if ((N - q) * 2 <= N) {
        if (val <= N - q) {
          val = N - q;
          res = i;
        }
      }
    }
    assert(res != -1);
    return res;
  };

  int u = Centroid();
  vector<int> other;
  vector<int> dist(N);
  for (int i = 0; i < N; i++) {
    dist[i] = hoursRequired(u, i);
    if (i != u) {
      other.emplace_back(i);
    }
  }
  sort(begin(other), end(other), [&](int i, int j) {
    return dist[i] < dist[j];
  });
  int zero = 0;
  while (zero + 1 < N && dist[other[zero]] == 1) {
    zero++;
  }
  assert(zero <= 3);
  vector<vector<int>> sub(zero);
  for (int i = 0; i < zero; i++) {
    sub[i].emplace_back(other[i]);
    assert(attractionsBehind(u, other[i]) * 2 <= N);
  }
  for (int i = zero; i + 1 < N; i++) {
    int v = other[i];
    bool inserted = false;
    for (int z = 0; z + 1 < zero; z++) {
      if (!inserted && 1 + hoursRequired(sub[z][0], v) == dist[v]) {
        assert(!inserted);
        inserted = true;
        sub[z].emplace_back(v);
      }
    }
    if (!inserted) {
      sub.back().emplace_back(v);
    }
  }

  int last = -1;
  vector<int> res;
  while (res.size() < N) {
    array<int, 3> mx = {-1, -1, -1}; // (dist, size, id)
    int total = 0;
    for (int i = 0; i < (int) sub.size(); i++) {
      total += sub[i].size();
    }
    static int big = -1;
    for (int i = 0; i < (int) sub.size(); i++) {
      if (big == -1 && 2 * sub[i].size() >= total) {
        int allmx = -1;
        for (int j = 0; j < (int) sub.size(); j++) {
          if (!sub[j].empty()) {
            allmx = max(allmx, dist[sub[j].back()]);
          }
        }
        if (last == -1 || sub[i].empty() || dist[sub[last].back()] == allmx || dist[sub[i].back()] == allmx) {
          big = i;
        }
      }
    }
    for (int i = 0; i < (int) sub.size(); i++) {
      if (i != last && !sub[i].empty()) {
        mx = max(mx, {dist[sub[i].back()], (int) sub[i].size(), i});
      }
    }
    if (big != -1 && last != big) {
      if (sub[big].empty()) {
        mx[2] = -1;
      } else {
        mx[2] = big;
      }
    }
    if (mx[2] == -1) {
      res.emplace_back(u);
    } else {
      res.emplace_back(sub[mx[2]].back());
      sub[mx[2]].pop_back();
    }
    last = mx[2];
  }

  return res;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:60:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |   while (res.size() < N) {
      |          ~~~~~~~~~~~^~~
fun.cpp:68:42: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   68 |       if (big == -1 && 2 * sub[i].size() >= total) {
      |                        ~~~~~~~~~~~~~~~~~~^~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 151 ms 15460 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 4 ms 768 KB Output is correct
22 Correct 7 ms 1280 KB Output is correct
23 Correct 14 ms 2176 KB Output is correct
24 Correct 20 ms 2936 KB Output is correct
25 Correct 89 ms 8848 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 12 ms 1792 KB Output is correct
15 Correct 189 ms 15404 KB Output is correct
16 Correct 193 ms 15228 KB Output is correct
17 Correct 31 ms 3864 KB Output is correct
18 Correct 80 ms 7232 KB Output is correct
19 Correct 141 ms 12200 KB Output is correct
20 Correct 5 ms 896 KB Output is correct

Subtask #5
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 256 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 151 ms 15460 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 2 ms 512 KB Output is correct
47 Correct 4 ms 768 KB Output is correct
48 Correct 7 ms 1280 KB Output is correct
49 Correct 14 ms 2176 KB Output is correct
50 Correct 20 ms 2936 KB Output is correct
51 Correct 89 ms 8848 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 12 ms 1792 KB Output is correct
54 Correct 189 ms 15404 KB Output is correct
55 Correct 193 ms 15228 KB Output is correct
56 Correct 31 ms 3864 KB Output is correct
57 Correct 80 ms 7232 KB Output is correct
58 Correct 141 ms 12200 KB Output is correct
59 Correct 5 ms 896 KB Output is correct
60 Correct 233 ms 15600 KB Output is correct
61 Correct 234 ms 17776 KB Output is correct
62 Correct 218 ms 15480 KB Output is correct
63 Correct 252 ms 19312 KB Output is correct
64 Correct 264 ms 19312 KB Output is correct
65 Correct 270 ms 15472 KB Output is correct
66 Correct 296 ms 17852 KB Output is correct
67 Correct 273 ms 19184 KB Output is correct
68 Correct 291 ms 18752 KB Output is correct
69 Correct 347 ms 20080 KB Output is correct
70 Correct 229 ms 15360 KB Output is correct
71 Correct 276 ms 19312 KB Output is correct
72 Correct 255 ms 17904 KB Output is correct
73 Correct 266 ms 18616 KB Output is correct
74 Correct 371 ms 20092 KB Output is correct
75 Correct 242 ms 15360 KB Output is correct
76 Correct 248 ms 19440 KB Output is correct
77 Correct 298 ms 19440 KB Output is correct
78 Correct 250 ms 18672 KB Output is correct
79 Correct 339 ms 20080 KB Output is correct
80 Correct 340 ms 20376 KB Output is correct
81 Correct 256 ms 15400 KB Output is correct
82 Correct 262 ms 15400 KB Output is correct
83 Correct 281 ms 15600 KB Output is correct
84 Correct 82 ms 6736 KB Output is correct