oj.uz

Submission #1032300

# Submission time Handle Problem Language Result Execution time Memory
1032300 2024-07-23T15:20:15 Z Tonyl Fun Tour (APIO20_fun) C++17
47 / 100
 165 ms 16460 KB 
#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using pi = pair<int,int>;
using ll = long long;
#define REP(i,n) for (int i = 0; i < n; i++)
#define trav(a,x) for (auto &a : x)
#define all(x) (x).begin(), (x).end()
#define D(x) cerr << #x << ": " << x << endl;

int n, q;

map<pi, int> dists;
int ask_dist(int a, int b) {
  if (a > b) swap(a,b);
  if (!dists.count({a,b})) dists[{a,b}] = hoursRequired(a,b);
  return dists[{a,b}];
}
//attractionsBehind

std::vector<int> createFunTour500(int N, int Q) {
  n = N; q = Q;
  vector<pair<int,pi>> alld(n*n);
  REP(i,n) {
    REP(j,n) alld[i*n+j] = {ask_dist(i,j), {i,j}};
  }
  sort(all(alld));

  vector<bool> done(n, 0);
  int s = alld.back().second.first;
  vi ans = {s};
  done[s] = 1;
  //D(s);

  while (--n) {
    int best = s;
    REP(i,N) {
      if (done[i]) continue;
      if (ask_dist(s, best) < ask_dist(s, i)) best = i;
    }
    assert(s != best);
    s = best;
    //D(s);
    done[s] = 1;
    ans.push_back(s);
  }

  return ans;
}

struct Node {
  bool exists = false;
  int leftd = 0, rightd = 0;
};

const int MAX_N = 400004;
Node tree[MAX_N];

void update(int i) {
  tree[i].leftd = 0;
  if (tree[2*i].exists) tree[i].leftd = max(tree[2*i].leftd, tree[2*i].rightd) + 1;
  tree[i].rightd = 0;
  if (tree[2*i+1].exists) tree[i].rightd = max(tree[2*i+1].leftd, tree[2*i+1].rightd) + 1;

  if (i > 1) update(i/2);
}

void consume(int i) {
  assert(tree[i].exists);
  tree[i].exists = 0;
  update(i);
}

int sink(int i) {
  if (tree[i].leftd > tree[i].rightd) return sink(2*i);
  else if (tree[i].rightd == 0) return i;
  else return sink(2*i+1);
}

int find_best(int i) {
  int best = 2*i+1;
  bool just_top = false;

  if (tree[i].leftd >= tree[i].rightd) best = 2*i;
  int maxs = max(tree[i].leftd, tree[i].rightd);

  int bonus = 0;
  while (i > 1) {
    bool fr = i%2;
    i/=2;
    bonus++;
    if (!tree[i].exists) break;
    if (bonus > maxs) {
      best = i; maxs = bonus;
      just_top = 1;
    }
    if (fr) {
      if (bonus+tree[i].leftd > maxs) {
        best = 2*i;
        maxs = bonus+tree[i].leftd;
        just_top = 0;
      }
    } else {
      if (bonus+tree[i].rightd > maxs) {
        best = 2*i+1;
        maxs = bonus+tree[i].rightd;
        just_top = 0;
      }
    }
  }

  if (just_top) return best;
  else return sink(best);
}

std::vector<int> createFunTour(int N, int Q) {
  if (N <= 500) return createFunTour500(N, Q);

  n = N; q = Q;
  n++;
  
  REP(i,n) tree[i].exists = 1;
  REP(i,n) update(i);

  int s = n-1;
  vi ans = {s};
  consume(s);
  //D(s);

  while (--N) {
    s = find_best(s);
    //D(s);
    consume(s);
    ans.push_back(s);
  }

  REP(i,n) ans[i]--;
  return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 0 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 348 KB Output is correct
10 Correct 0 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 0 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 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 0 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 348 KB Output is correct
10 Correct 0 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 0 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 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 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 155 ms 11088 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 6 ms 860 KB Output is correct
27 Correct 14 ms 1628 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 159 ms 11024 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 19 ms 2140 KB Output is correct
32 Correct 39 ms 3620 KB Output is correct
33 Correct 8 ms 1116 KB Output is correct
34 Correct 165 ms 11136 KB Output is correct
35 Correct 154 ms 11224 KB Output is correct
36 Correct 153 ms 11168 KB Output is correct
37 Correct 6 ms 856 KB Output is correct
38 Correct 149 ms 10204 KB Output is correct
39 Correct 40 ms 3420 KB Output is correct
40 Correct 73 ms 5608 KB Output is correct
41 Correct 18 ms 1880 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 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 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 348 KB Output is correct
12 Correct 155 ms 11088 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 6 ms 860 KB Output is correct
15 Correct 14 ms 1628 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 63 ms 16460 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 3 ms 1372 KB Output is correct
23 Correct 7 ms 2136 KB Output is correct
24 Correct 10 ms 4952 KB Output is correct
25 Correct 34 ms 10472 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory 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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 159 ms 11024 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 19 ms 2140 KB Output is correct
11 Correct 39 ms 3620 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Incorrect 1 ms 348 KB Tour is not fun
14 Halted 0 ms 0 KB -

Subtask #5
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 348 KB Output is correct
5 Correct 0 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 348 KB Output is correct
10 Correct 0 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 0 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 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 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 155 ms 11088 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 6 ms 860 KB Output is correct
27 Correct 14 ms 1628 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 159 ms 11024 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 19 ms 2140 KB Output is correct
32 Correct 39 ms 3620 KB Output is correct
33 Correct 8 ms 1116 KB Output is correct
34 Correct 165 ms 11136 KB Output is correct
35 Correct 154 ms 11224 KB Output is correct
36 Correct 153 ms 11168 KB Output is correct
37 Correct 6 ms 856 KB Output is correct
38 Correct 149 ms 10204 KB Output is correct
39 Correct 40 ms 3420 KB Output is correct
40 Correct 73 ms 5608 KB Output is correct
41 Correct 18 ms 1880 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 63 ms 16460 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 2 ms 604 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 3 ms 1372 KB Output is correct
49 Correct 7 ms 2136 KB Output is correct
50 Correct 10 ms 4952 KB Output is correct
51 Correct 34 ms 10472 KB Output is correct
52 Incorrect 1 ms 348 KB Tour is not fun
53 Halted 0 ms 0 KB -