Submission #293419

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
293419	2020-09-08 04:45:54	rama_pang	Swapping Cities (APIO20_swap)	C++14	100 / 100	811 ms	34532 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 "swap.h"
#include <bits/stdc++.h>
using namespace std;
class DisjointSet {
 public:
  int n, t = -1;
  vector<vector<pair<int, int>>> p; // (time, data)
  vector<vector<pair<int, int>>> sz;
  vector<vector<pair<int, int>>> deg;
  vector<vector<pair<int, int>>> cycle;
  DisjointSet() {}
  DisjointSet(int n) : n(n), p(n), sz(n), deg(n), cycle(n) {
    for (int i = 0; i < n; i++) {
      p[i].emplace_back(-1, i);
      sz[i].emplace_back(-1, 1);
      deg[i].emplace_back(-1, 0);
      cycle[i].emplace_back(-1, 0);
    }
  }
  int Find(int x) {
    return p[x].back().second == x ? x : Find(p[x].back().second);
  }
  int Unite(int x, int y) {
    t++;
    x = Find(x), y = Find(y);
    if (x != y) {
      if (sz[x].back().second > sz[y].back().second) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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