제출 #435137

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
435137	2021-06-23 03:51:51	Elegia	열쇠 (IOI21_keys)	C++17	100 / 100	2171 ms	135484 KiB

keys

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;
void merge(set<int>& x, set<int>& y) {
  if (x.size() < y.size()) swap(x, y);
  for (int i : y) x.insert(i);
  y.clear();
}
void merge(map<int, list<int>>& x, map<int, list<int>>& y) {
  if (x.size() < y.size()) swap(x, y);
  for (auto it = y.begin(); it != y.end(); ++it) {
    list<int>& l = x[it->first];
    l.splice(l.begin(), it->second);
  }
  y.clear();
}
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
  int n = r.size(), m = u.size();
  vector<int> ans(n), dsu(n), sz(n, 1), vis(n);
  vector<set<int>> key(n);
  vector<map<int, list<int>>> candidate(n);
  vector<list<int>> edge(n);
  iota(dsu.begin(), dsu.end(), 0);
  function<int(int)> find = [&](int x) { return dsu[x] == x ? x : dsu[x] = find(dsu[x]); };
  auto activate = [&](const set<int>& kk, map<int, list<int>>& cc, list<int>& ed) {
    if (kk.size() < cc.size()) {
      for (int i : kk) {
        auto it = cc.find(i);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 11 / 11
• Subtask 3: 17 / 17
• Subtask 4: 30 / 30
• Subtask 5: 33 / 33