oj.uz

답안 #726878

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
726878 2023-04-19T13:34:28 Z LittleFlowers__ 즐거운 행로 (APIO20_fun) C++17
47 / 100
 428 ms 106532 KB 
#include "fun.h"

#include <bits/stdc++.h>

using namespace std;

string to_string(string s) {
  return '"' + s + '"';
}
 
string to_string(const char* s) {
  return to_string((string) s);
}
 
string to_string(bool b) {
  return (b ? "true" : "false");
}
 
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
 
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
 
void debug_out() { cerr << endl; }
 
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
 
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

mt19937 rng(101202);
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r) {
  if (l > r) { cerr << l << " " << r << "\n"; }
  return l + rng() % (r - l + 1);
}

const int N = 100010;

set<pair<int, int>> children[N * 4];

vector<int> createFunTour(int n, int q) {
  if (n <= 500) {
    vector<vector<int>> distance(n, vector<int>(n));
    vector<pair<int, int>> edges;
    vector<bool> visited(n);
    for (int i = 0; i < n; ++i) for (int j = i + 1; j < n; ++j) {
      distance[i][j] = distance[j][i] = hoursRequired(i, j);
      edges.push_back({i, j});
      edges.push_back({j, i});
    }
  
    sort(edges.begin(), edges.end(), [&](pair<int, int> x, pair<int, int> y) {
      return distance[x.first][x.second] > distance[y.first][y.second];
    });
  
    int currentVertex = edges[0].first, fun = n;
    visited[currentVertex] = true;
    vector<int> answer = {currentVertex};
    for (int i = 1; i < n; ++i) {
      bool found = false;
      for (const auto [x, y] : edges) {
        if (x != currentVertex || !visited[x] || visited[x] && visited[y] || fun < distance[x][y]) continue;
        answer.push_back(currentVertex = y);
        visited[y] = true;
        found = true;
        break;
      }
      assert(found);
    }
  
    return answer;
  }

  function<void(int)> build = [&](int s) {
    if (s >= n) return;
    build(2 * s + 1); build(2 * s + 2);
    children[s].insert({0, s});
    for (const auto &[c, v] : children[2 * s + 1]) children[s].insert({c + 1, v});
    for (const auto &[c, v] : children[2 * s + 2]) children[s].insert({c + 1, v});
  };

  build(0);

  vector<bool> visited(n);

  function getSubtree = [&](int u) -> pair<int, int> {
    while (children[u].size() && visited[children[u].rbegin()->second]) children[u].erase(*children[u].rbegin());
    return children[u].size() ? *children[u].rbegin() : make_pair(0, -1);
  };

  function getSubtree_Left = [&](int u) -> pair<int, int> {
    return getSubtree(u * 2 + 1);
  };

  function getSubtree_Right = [&](int u) -> pair<int, int> {
    return getSubtree(u * 2 + 2);
  };

  int currentVertex = 0; while (currentVertex * 2 + 1 < n) currentVertex = currentVertex * 2 + 1;
  visited[currentVertex] = true;
  vector<int> answer = {currentVertex};
  for (int i = 1; i < n; ++i) {
    pair<
      int, // distance
      int  // vertex
    > currentBest;
    currentBest = getSubtree(currentVertex);
    for (int u = currentVertex, level = 1; u > 0; u = (u - 1) / 2, level += 1) {
      int p = (u - 1) / 2;

      auto thisBest_ = u == p * 2 + 1 ? getSubtree_Right(p) : getSubtree_Left(p);
      pair<int, int> thisBest = {0, -1};
      if (!visited[p]) thisBest = {level, p};
      if (thisBest_.second != -1) thisBest = {thisBest.first + thisBest_.first, thisBest_.second};
      if (thisBest > currentBest) currentBest = thisBest;
    }
    visited[currentVertex = currentBest.second] = true;
    answer.push_back(currentVertex);
  }

  return answer;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:85:61: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   85 |         if (x != currentVertex || !visited[x] || visited[x] && visited[y] || fun < distance[x][y]) continue;
      |                                                  ~~~~~~~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 9 ms 19028 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 10 ms 19084 KB Output is correct
5 Correct 10 ms 19028 KB Output is correct
6 Correct 11 ms 19092 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 11 ms 19028 KB Output is correct
10 Correct 11 ms 19016 KB Output is correct
11 Correct 10 ms 19028 KB Output is correct
12 Correct 11 ms 19064 KB Output is correct
13 Correct 10 ms 19028 KB Output is correct
14 Correct 10 ms 19028 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 10 ms 19028 KB Output is correct
17 Correct 11 ms 19028 KB Output is correct
18 Correct 10 ms 19028 KB Output is correct
19 Correct 10 ms 19004 KB Output is correct
20 Correct 10 ms 19096 KB Output is correct
21 Correct 10 ms 19000 KB Output is correct
22 Correct 10 ms 19028 KB Output is correct
23 Correct 11 ms 19112 KB Output is correct
24 Correct 47 ms 22220 KB Output is correct
25 Correct 11 ms 19028 KB Output is correct
26 Correct 11 ms 19292 KB Output is correct
27 Correct 12 ms 19540 KB Output is correct
28 Correct 9 ms 19028 KB Output is correct
29 Correct 46 ms 22220 KB Output is correct
30 Correct 12 ms 19156 KB Output is correct
31 Correct 15 ms 19844 KB Output is correct
32 Correct 19 ms 20564 KB Output is correct
33 Correct 12 ms 19540 KB Output is correct
34 Correct 60 ms 22356 KB Output is correct
35 Correct 49 ms 22344 KB Output is correct
36 Correct 53 ms 22300 KB Output is correct
37 Correct 11 ms 19284 KB Output is correct
38 Correct 58 ms 22216 KB Output is correct
39 Correct 21 ms 20556 KB Output is correct
40 Correct 29 ms 20688 KB Output is correct
41 Correct 14 ms 19792 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 10 ms 19084 KB Output is correct
4 Correct 10 ms 19028 KB Output is correct
5 Correct 11 ms 19092 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 11 ms 19028 KB Output is correct
9 Correct 10 ms 19000 KB Output is correct
10 Correct 10 ms 19028 KB Output is correct
11 Correct 11 ms 19112 KB Output is correct
12 Correct 47 ms 22220 KB Output is correct
13 Correct 11 ms 19028 KB Output is correct
14 Correct 11 ms 19292 KB Output is correct
15 Correct 12 ms 19540 KB Output is correct
16 Correct 10 ms 19284 KB Output is correct
17 Correct 11 ms 19300 KB Output is correct
18 Correct 428 ms 106532 KB Output is correct
19 Correct 12 ms 19540 KB Output is correct
20 Correct 15 ms 20252 KB Output is correct
21 Correct 18 ms 20964 KB Output is correct
22 Correct 29 ms 23704 KB Output is correct
23 Correct 51 ms 28884 KB Output is correct
24 Correct 65 ms 32460 KB Output is correct
25 Correct 234 ms 68012 KB Output is correct

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 19028 KB Output is correct
2 Correct 10 ms 19028 KB Output is correct
3 Correct 11 ms 19016 KB Output is correct
4 Correct 10 ms 19028 KB Output is correct
5 Correct 11 ms 19064 KB Output is correct
6 Correct 10 ms 19028 KB Output is correct
7 Correct 9 ms 19028 KB Output is correct
8 Correct 46 ms 22220 KB Output is correct
9 Correct 12 ms 19156 KB Output is correct
10 Correct 15 ms 19844 KB Output is correct
11 Correct 19 ms 20564 KB Output is correct
12 Correct 12 ms 19540 KB Output is correct
13 Incorrect 12 ms 19540 KB Tour is not fun
14 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 19028 KB Output is correct
2 Correct 9 ms 19028 KB Output is correct
3 Correct 10 ms 19028 KB Output is correct
4 Correct 10 ms 19084 KB Output is correct
5 Correct 10 ms 19028 KB Output is correct
6 Correct 11 ms 19092 KB Output is correct
7 Correct 10 ms 19028 KB Output is correct
8 Correct 10 ms 19028 KB Output is correct
9 Correct 11 ms 19028 KB Output is correct
10 Correct 11 ms 19016 KB Output is correct
11 Correct 10 ms 19028 KB Output is correct
12 Correct 11 ms 19064 KB Output is correct
13 Correct 10 ms 19028 KB Output is correct
14 Correct 10 ms 19028 KB Output is correct
15 Correct 10 ms 19028 KB Output is correct
16 Correct 10 ms 19028 KB Output is correct
17 Correct 11 ms 19028 KB Output is correct
18 Correct 10 ms 19028 KB Output is correct
19 Correct 10 ms 19004 KB Output is correct
20 Correct 10 ms 19096 KB Output is correct
21 Correct 10 ms 19000 KB Output is correct
22 Correct 10 ms 19028 KB Output is correct
23 Correct 11 ms 19112 KB Output is correct
24 Correct 47 ms 22220 KB Output is correct
25 Correct 11 ms 19028 KB Output is correct
26 Correct 11 ms 19292 KB Output is correct
27 Correct 12 ms 19540 KB Output is correct
28 Correct 9 ms 19028 KB Output is correct
29 Correct 46 ms 22220 KB Output is correct
30 Correct 12 ms 19156 KB Output is correct
31 Correct 15 ms 19844 KB Output is correct
32 Correct 19 ms 20564 KB Output is correct
33 Correct 12 ms 19540 KB Output is correct
34 Correct 60 ms 22356 KB Output is correct
35 Correct 49 ms 22344 KB Output is correct
36 Correct 53 ms 22300 KB Output is correct
37 Correct 11 ms 19284 KB Output is correct
38 Correct 58 ms 22216 KB Output is correct
39 Correct 21 ms 20556 KB Output is correct
40 Correct 29 ms 20688 KB Output is correct
41 Correct 14 ms 19792 KB Output is correct
42 Correct 10 ms 19284 KB Output is correct
43 Correct 11 ms 19300 KB Output is correct
44 Correct 428 ms 106532 KB Output is correct
45 Correct 12 ms 19540 KB Output is correct
46 Correct 15 ms 20252 KB Output is correct
47 Correct 18 ms 20964 KB Output is correct
48 Correct 29 ms 23704 KB Output is correct
49 Correct 51 ms 28884 KB Output is correct
50 Correct 65 ms 32460 KB Output is correct
51 Correct 234 ms 68012 KB Output is correct
52 Incorrect 12 ms 19540 KB Tour is not fun
53 Halted 0 ms 0 KB -