Submission #1099236

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1099236	2024-10-11 01:22:51	huyngo	Keys (IOI21_keys)	C++17	0 / 100	0 ms	348 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;
std::vector<int> find_reachable(std::vector<int> r, std::vector<int> u, std::vector<int> v, std::vector<int> c) {
  std::vector<int> ans(r.size(), 1);
  int n = r.size();
  int m = u.size();
  vector<vector<array<int, 2>>> adj(n);
  vector<vector<int>> pend(m);
  for (int i = 0; i < m; ++i) {
    adj[u[i]].push_back({ v[i], c[i] });
    adj[v[i]].push_back({ u[i], c[i] });
  }
  vector<int> reachable(n);
  for (int st = 0; st < n; ++st) {
    queue<int> qu;
    qu.push(st);
    vector<bool> unlock(m, false), vis(n, false);
    while (qu.size()) {
      int u = qu.front(); qu.pop();
      vis[u] = true;
      ++reachable[st];
      unlock[r[u]] = 1;
      for (int v : pend[r[u]])
        if (!vis[v])
          qu.push(v);
      pend[r[u]].clear();
      for (auto [v, w] : adj[u]) if (!vis[v]) {
        if (unlock[w])
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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