oj.uz

Submission #1052042

# Submission time Handle Problem Language Result Execution time Memory
1052042 2024-08-10T11:15:42 Z duckindog Village (BOI20_village) C++17
31 / 100
 700 ms 48976 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 100'000 + 10;
const long long MAX = 1'000'000'000'000'000'000;
int n;
vector<int> ad[N];

namespace findMin { 
  long long f[N][2];
  vector<tuple<int, int, int>> trace[N][2];
  void dfs0(int u, int p = -1) { 
    f[u][1] = 0;
    
    vector<int> best;
    for (const auto& v : ad[u]) { 
      if (v == p) continue;
      dfs0(v, u);
      best.push_back(v);
    }

    if (best.size()) { 
      sort(best.begin(), best.end(), [&](const auto& a, const auto& b) { 
        return f[a][1] - f[a][0] > f[b][1] - f[b][0];
      });

      { //f[u][1]
        vector<int> vt = best;
        auto& ret = f[u][1];
        auto& tr = trace[u][1];

        while (vt.size() > 1) { 
          long long value = min(MAX, f[vt.back()][1] + f[vt.end()[-2]][1] + 4);  
          if (value <= min(MAX, f[vt.back()][0] + f[vt.end()[-2]][0])) { 
            ret = min(MAX, ret + value);
            tr.emplace_back(0, vt.back(), vt.end()[-2]);
            vt.pop_back();
            vt.pop_back();
          } else break;
        }
        for (const auto& x : vt) {
          ret = min(MAX, ret + f[x][0]);
          tr.emplace_back(1, x, 0);
        }
      }
      
      { //f[u][0]
        vector<int> vt = best;
        auto& ret = f[u][0];
        auto& tr = trace[u][0];

        ret = f[vt.back()][1] + 2;
        tr.emplace_back(2, vt.back(), 1);
        vt.pop_back();
        for (const auto& x : vt) { 
          if (f[x][1] + 2 <= f[x][0]) { 
            ret = min(MAX, ret + f[x][1] + 2);
            tr.emplace_back(2, x, 1);
          } else { 
            ret = min(MAX, ret + f[x][0]);
            tr.emplace_back(2, x, 0);
          }
        }
      }
      

      if (f[u][0] > f[u][1] + 2) { 
        f[u][0] = min(MAX, f[u][1] + 2);
        trace[u][0] = {make_tuple(3, best.back(), 0)};
      }
    }
    if (f[u][1] >= MAX || f[u][1] < 0) f[u][1] = 2 * MAX;
    if (f[u][0] >= MAX || f[u][0] < 0) f[u][0] = MAX;
  }

  int vt[N];
  void dfs1(int u, int st) { 
    for (const auto& [type, a, b] : trace[u][st]) { 
      if (!type) { 
        dfs1(a, 1); dfs1(b, 1);
        swap(vt[a], vt[b]);
      } else if (type == 1) {
        dfs1(a, 0);
      } else if (type == 2) { 
        dfs1(a, b);
        if (b) swap(vt[u], vt[a]);
      } else { 
        dfs1(u, 1);
        swap(vt[u], vt[a]);
      }
    }
  }
  int length;
  vector<int> answer;
  void solve() { 
    memset(f, 14, sizeof f);
    dfs0(1);
    iota(vt + 1, vt + n + 1, 1);
    dfs1(1, 0);
    length = f[1][0];
    answer = vector<int>(vt + 1, vt + n + 1);
  }
}

namespace findMax { 
  long long length;
  int d[N], sz[N];
  int st[N], ed[N], it;
  int f[N][17], lg[N];
  void dfs0(int u, int p = -1) { 
    sz[u] = 1;
    st[u] = ++it; f[it][0] = u;
    for (const auto& v : ad[u]) { 
      if (v == p) continue;
      d[v] = d[u] + 1;
      dfs0(v, u);
      ed[u] = ++it; f[it][0] = u;
      sz[u] += sz[v];
      length += 2 * min(sz[v], n - sz[v]);
    }
  }
  void init() { 
    for (int i = 2; i <= it; ++i) lg[i] = lg[i >> 1] + 1;
    for (int j = 1; j <= 16; ++j) { 
      for (int i = 1; i + (1 << j) - 1 <= it; ++i) { 
        auto lt = f[i][j - 1], rt = f[i + (1 << j - 1)][j - 1];
        f[i][j] = (d[lt] <= d[rt] ? lt : rt);
      }
    }
  }
  int lca(int u, int v) { 
    int l = min(st[u], st[v]), r = max(st[u], st[v]);
    int j = lg[r - l + 1];
    auto lt = f[l][j], rt = f[r - (1 << j) + 1][j];
    return d[lt] <= d[rt] ? lt : rt;
  }
  int dis(int u, int v) { return d[u] + d[v] - 2 * d[lca(u, v)]; }

  vector<int> answer;
  void solve() { 
    dfs0(1);
    init();

    answer.resize(n); iota(answer.begin(), answer.end(), 1);
    mt19937 rng(137525724);
    for (;;) {
      shuffle(answer.begin(), answer.end(), rng);
      if (1.0 * clock() / CLOCKS_PER_SEC >= 0.68) break;
      int ret = 0;
      for (int i = 1; i <= n; ++i) {
        if (answer[i - 1] == i) { ret = -1; break; }
        ret += dis(answer[i - 1], i);
      }
      if (ret == length) break;
    }
  }
}

int32_t main() { 
  cin.tie(0)->sync_with_stdio(0);

  cin >> n;
  for (int i = 1; i < n; ++i) { 
    int u, v; cin >> u >> v;
    ad[u].push_back(v);
    ad[v].push_back(u);
  }

  findMin::solve();
  findMax::solve();

  cout << findMin::length << " " << findMax::length << "\n";
  for (int i = 0; i < n; ++i) cout << findMin::answer[i] << " \n"[i == n - 1];
  for (int i = 0; i < n; ++i) cout << findMax::answer[i] << " \n"[i == n - 1];
}

Compilation message

Village.cpp: In function 'void findMax::init()':
Village.cpp:127:51: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
  127 |         auto lt = f[i][j - 1], rt = f[i + (1 << j - 1)][j - 1];
      |                                                 ~~^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11612 KB Output is correct
2 Correct 2 ms 11612 KB Output is correct
3 Correct 1 ms 11612 KB Output is correct
4 Correct 2 ms 11524 KB Output is correct
5 Correct 1 ms 11612 KB Output is correct
6 Correct 1 ms 11612 KB Output is correct
7 Correct 1 ms 11612 KB Output is correct
8 Correct 2 ms 11612 KB Output is correct
9 Correct 1 ms 11612 KB Output is correct
10 Correct 2 ms 11612 KB Output is correct
11 Correct 2 ms 11612 KB Output is correct
12 Correct 2 ms 11612 KB Output is correct
13 Correct 2 ms 11612 KB Output is correct
14 Correct 2 ms 11608 KB Output is correct
15 Correct 2 ms 11612 KB Output is correct
16 Correct 2 ms 11612 KB Output is correct
17 Correct 1 ms 11612 KB Output is correct

Subtask #2
19.0 / 38.0

# Verdict Execution time Memory Grader output
1 Partially correct 680 ms 11764 KB Partially correct
2 Partially correct 680 ms 11608 KB Partially correct
3 Partially correct 680 ms 11608 KB Partially correct
4 Partially correct 680 ms 11864 KB Partially correct
5 Partially correct 680 ms 11844 KB Partially correct
6 Partially correct 680 ms 11864 KB Partially correct
7 Partially correct 680 ms 11996 KB Partially correct
8 Partially correct 680 ms 11864 KB Partially correct
9 Partially correct 680 ms 11864 KB Partially correct
10 Partially correct 680 ms 11868 KB Partially correct
11 Partially correct 680 ms 11880 KB Partially correct
12 Correct 2 ms 11868 KB Output is correct
13 Partially correct 680 ms 11844 KB Partially correct
14 Partially correct 680 ms 11868 KB Partially correct
15 Partially correct 680 ms 11836 KB Partially correct
16 Partially correct 680 ms 11860 KB Partially correct
17 Partially correct 680 ms 11612 KB Partially correct
18 Partially correct 680 ms 11836 KB Partially correct
19 Partially correct 680 ms 11612 KB Partially correct
20 Partially correct 680 ms 11844 KB Partially correct
21 Partially correct 680 ms 11864 KB Partially correct
22 Partially correct 680 ms 11612 KB Partially correct
23 Partially correct 680 ms 11856 KB Partially correct
24 Partially correct 680 ms 11840 KB Partially correct
25 Partially correct 680 ms 11612 KB Partially correct
26 Partially correct 680 ms 11868 KB Partially correct
27 Partially correct 680 ms 11864 KB Partially correct
28 Partially correct 680 ms 11608 KB Partially correct
29 Partially correct 680 ms 11864 KB Partially correct
30 Partially correct 680 ms 11608 KB Partially correct

Subtask #3
0.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 11612 KB Output is correct
2 Correct 2 ms 11612 KB Output is correct
3 Correct 1 ms 11612 KB Output is correct
4 Correct 2 ms 11524 KB Output is correct
5 Correct 1 ms 11612 KB Output is correct
6 Correct 1 ms 11612 KB Output is correct
7 Correct 1 ms 11612 KB Output is correct
8 Correct 2 ms 11612 KB Output is correct
9 Correct 1 ms 11612 KB Output is correct
10 Correct 2 ms 11612 KB Output is correct
11 Correct 2 ms 11612 KB Output is correct
12 Correct 2 ms 11612 KB Output is correct
13 Correct 2 ms 11612 KB Output is correct
14 Correct 2 ms 11608 KB Output is correct
15 Correct 2 ms 11612 KB Output is correct
16 Correct 2 ms 11612 KB Output is correct
17 Correct 1 ms 11612 KB Output is correct
18 Partially correct 680 ms 11764 KB Partially correct
19 Partially correct 680 ms 11608 KB Partially correct
20 Partially correct 680 ms 11608 KB Partially correct
21 Partially correct 680 ms 11864 KB Partially correct
22 Partially correct 680 ms 11844 KB Partially correct
23 Partially correct 680 ms 11864 KB Partially correct
24 Partially correct 680 ms 11996 KB Partially correct
25 Partially correct 680 ms 11864 KB Partially correct
26 Partially correct 680 ms 11864 KB Partially correct
27 Partially correct 680 ms 11868 KB Partially correct
28 Partially correct 680 ms 11880 KB Partially correct
29 Correct 2 ms 11868 KB Output is correct
30 Partially correct 680 ms 11844 KB Partially correct
31 Partially correct 680 ms 11868 KB Partially correct
32 Partially correct 680 ms 11836 KB Partially correct
33 Partially correct 680 ms 11860 KB Partially correct
34 Partially correct 680 ms 11612 KB Partially correct
35 Partially correct 680 ms 11836 KB Partially correct
36 Partially correct 680 ms 11612 KB Partially correct
37 Partially correct 680 ms 11844 KB Partially correct
38 Partially correct 680 ms 11864 KB Partially correct
39 Partially correct 680 ms 11612 KB Partially correct
40 Partially correct 680 ms 11856 KB Partially correct
41 Partially correct 680 ms 11840 KB Partially correct
42 Partially correct 680 ms 11612 KB Partially correct
43 Partially correct 680 ms 11868 KB Partially correct
44 Partially correct 680 ms 11864 KB Partially correct
45 Partially correct 680 ms 11608 KB Partially correct
46 Partially correct 680 ms 11864 KB Partially correct
47 Partially correct 680 ms 11608 KB Partially correct
48 Partially correct 696 ms 26216 KB Partially correct
49 Partially correct 696 ms 26992 KB Partially correct
50 Partially correct 697 ms 26964 KB Partially correct
51 Partially correct 692 ms 24660 KB Partially correct
52 Partially correct 697 ms 26848 KB Partially correct
53 Partially correct 694 ms 25996 KB Partially correct
54 Partially correct 691 ms 32080 KB Partially correct
55 Execution timed out 703 ms 48976 KB Time limit exceeded
56 Halted 0 ms 0 KB -