oj.uz

답안 #1052039

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1052039 2024-08-10T11:14:18 Z duckindog Village (BOI20_village) C++17
56 / 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);
    do { 
      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;
      }
    } while (next_permutation(answer.begin(), answer.end()));
  }
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11608 KB Output is correct
2 Correct 2 ms 11612 KB Output is correct
3 Correct 2 ms 11612 KB Output is correct
4 Correct 2 ms 11612 KB Output is correct
5 Correct 2 ms 11612 KB Output is correct
6 Correct 2 ms 11608 KB Output is correct
7 Correct 2 ms 11864 KB Output is correct
8 Correct 4 ms 11612 KB Output is correct
9 Correct 12 ms 11764 KB Output is correct
10 Correct 92 ms 11612 KB Output is correct
11 Correct 91 ms 11736 KB Output is correct
12 Correct 244 ms 11612 KB Output is correct
13 Correct 92 ms 11608 KB Output is correct
14 Correct 102 ms 11612 KB Output is correct
15 Correct 331 ms 11860 KB Output is correct
16 Correct 91 ms 11612 KB Output is correct
17 Correct 92 ms 11612 KB Output is correct

Subtask #2
19.0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 680 ms 11612 KB Partially correct
2 Partially correct 680 ms 11860 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 11864 KB Partially correct
6 Partially correct 680 ms 11844 KB Partially correct
7 Partially correct 680 ms 11864 KB Partially correct
8 Partially correct 680 ms 11864 KB Partially correct
9 Partially correct 680 ms 11868 KB Partially correct
10 Partially correct 680 ms 11900 KB Partially correct
11 Partially correct 680 ms 11864 KB Partially correct
12 Partially correct 680 ms 11844 KB Partially correct
13 Partially correct 680 ms 11864 KB Partially correct
14 Partially correct 680 ms 11864 KB Partially correct
15 Partially correct 680 ms 11840 KB Partially correct
16 Partially correct 680 ms 11612 KB Partially correct
17 Partially correct 680 ms 11608 KB Partially correct
18 Partially correct 680 ms 11612 KB Partially correct
19 Partially correct 680 ms 11608 KB Partially correct
20 Partially correct 680 ms 11840 KB Partially correct
21 Partially correct 680 ms 11608 KB Partially correct
22 Partially correct 680 ms 11840 KB Partially correct
23 Partially correct 680 ms 11836 KB Partially correct
24 Partially correct 680 ms 11612 KB Partially correct
25 Partially correct 680 ms 11608 KB Partially correct
26 Partially correct 680 ms 11612 KB Partially correct
27 Partially correct 680 ms 11788 KB Partially correct
28 Partially correct 680 ms 11840 KB Partially correct
29 Partially correct 680 ms 11868 KB Partially correct
30 Partially correct 680 ms 11856 KB Partially correct

Subtask #3
25.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11608 KB Output is correct
2 Correct 2 ms 11612 KB Output is correct
3 Correct 2 ms 11612 KB Output is correct
4 Correct 2 ms 11612 KB Output is correct
5 Correct 2 ms 11612 KB Output is correct
6 Correct 2 ms 11608 KB Output is correct
7 Correct 2 ms 11864 KB Output is correct
8 Correct 4 ms 11612 KB Output is correct
9 Correct 12 ms 11764 KB Output is correct
10 Correct 92 ms 11612 KB Output is correct
11 Correct 91 ms 11736 KB Output is correct
12 Correct 244 ms 11612 KB Output is correct
13 Correct 92 ms 11608 KB Output is correct
14 Correct 102 ms 11612 KB Output is correct
15 Correct 331 ms 11860 KB Output is correct
16 Correct 91 ms 11612 KB Output is correct
17 Correct 92 ms 11612 KB Output is correct
18 Partially correct 680 ms 11612 KB Partially correct
19 Partially correct 680 ms 11860 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 11864 KB Partially correct
23 Partially correct 680 ms 11844 KB Partially correct
24 Partially correct 680 ms 11864 KB Partially correct
25 Partially correct 680 ms 11864 KB Partially correct
26 Partially correct 680 ms 11868 KB Partially correct
27 Partially correct 680 ms 11900 KB Partially correct
28 Partially correct 680 ms 11864 KB Partially correct
29 Partially correct 680 ms 11844 KB Partially correct
30 Partially correct 680 ms 11864 KB Partially correct
31 Partially correct 680 ms 11864 KB Partially correct
32 Partially correct 680 ms 11840 KB Partially correct
33 Partially correct 680 ms 11612 KB Partially correct
34 Partially correct 680 ms 11608 KB Partially correct
35 Partially correct 680 ms 11612 KB Partially correct
36 Partially correct 680 ms 11608 KB Partially correct
37 Partially correct 680 ms 11840 KB Partially correct
38 Partially correct 680 ms 11608 KB Partially correct
39 Partially correct 680 ms 11840 KB Partially correct
40 Partially correct 680 ms 11836 KB Partially correct
41 Partially correct 680 ms 11612 KB Partially correct
42 Partially correct 680 ms 11608 KB Partially correct
43 Partially correct 680 ms 11612 KB Partially correct
44 Partially correct 680 ms 11788 KB Partially correct
45 Partially correct 680 ms 11840 KB Partially correct
46 Partially correct 680 ms 11868 KB Partially correct
47 Partially correct 680 ms 11856 KB Partially correct
48 Partially correct 695 ms 26028 KB Partially correct
49 Partially correct 694 ms 26960 KB Partially correct
50 Partially correct 698 ms 27024 KB Partially correct
51 Partially correct 690 ms 24872 KB Partially correct
52 Partially correct 695 ms 26924 KB Partially correct
53 Partially correct 692 ms 25912 KB Partially correct
54 Partially correct 689 ms 32080 KB Partially correct
55 Partially correct 700 ms 48976 KB Partially correct
56 Partially correct 699 ms 36864 KB Partially correct
57 Partially correct 696 ms 33624 KB Partially correct
58 Partially correct 697 ms 30800 KB Partially correct
59 Partially correct 695 ms 26988 KB Partially correct
60 Partially correct 693 ms 24628 KB Partially correct
61 Partially correct 692 ms 25708 KB Partially correct
62 Partially correct 694 ms 25456 KB Partially correct
63 Partially correct 692 ms 25108 KB Partially correct
64 Partially correct 692 ms 26284 KB Partially correct
65 Partially correct 691 ms 26196 KB Partially correct
66 Partially correct 690 ms 25432 KB Partially correct
67 Partially correct 688 ms 23360 KB Partially correct
68 Partially correct 689 ms 24624 KB Partially correct
69 Partially correct 694 ms 26244 KB Partially correct
70 Partially correct 690 ms 25424 KB Partially correct
71 Partially correct 688 ms 23356 KB Partially correct
72 Partially correct 689 ms 24144 KB Partially correct
73 Partially correct 692 ms 26192 KB Partially correct
74 Partially correct 691 ms 25424 KB Partially correct
75 Partially correct 694 ms 26144 KB Partially correct
76 Partially correct 694 ms 26452 KB Partially correct
77 Partially correct 697 ms 26704 KB Partially correct
78 Partially correct 689 ms 23124 KB Partially correct
79 Partially correct 689 ms 23724 KB Partially correct
80 Partially correct 695 ms 26196 KB Partially correct
81 Partially correct 694 ms 26748 KB Partially correct
82 Partially correct 691 ms 25424 KB Partially correct