Submission #535973

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
535973	2022-03-12 02:46:41	dutinmeow	Swapping Cities (APIO20_swap)	C++17	53 / 100	2072 ms	37936 KiB

swap

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
//#include "swap.h"
const int LOGN = 17;
vector<int> dep, val;
vector<bool> lin;
vector<array<int, LOGN>> anc;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
  vector<tuple<int, int, int>> E(M);
  for (int i = 0; i < M; i++) 
    E[i] = {U[i], V[i], W[i]};
  sort(E.begin(), E.end(), 
    [](const auto &a, const auto &b) {
      return get<2>(a) < get<2>(b);
    }
  );
  struct node { 
    int par, val, siz; bool lin;
    node() = default;
    node(int _par, int _val, int _siz, bool _lin) : par(_par), val(_val), siz(_siz), lin(_lin) {}
  };
  vector<node> T; T.reserve(N + M);
  vector<bool> ep(N);
  vector<int> rt(N);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 6 / 6
• Subtask 2: 7 / 7
• Subtask 3: 17 / 17
• Subtask 4: 0 / 20
• Subtask 5: 23 / 23
• Subtask 6: 0 / 27