Submission #1240493

#TimeUsernameProblemLanguageResultExecution timeMemory
1240493trimkusKeys (IOI21_keys)C++20
37 / 100
3091 ms21460 KiB
#include "keys.h" #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) { int N = r.size(); int M = _u.size(); vector<vector<array<int, 2>>> adj(N); 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> cnt(N); for (int i = 0; i < N; ++i) { vector<int> seen(N); vector<int> now{i}; vector<int> have(N); have[r[i]] = 1; while (true) { bool added = false; for (int it = 0; it < (int)now.size(); ++it) { int v = now[it]; for (auto& [u, c] : adj[v]) { if (seen[u]) continue; if (have[c]) { seen[u] = 1; now.push_back(u); have[r[u]] = 1; added = true; } } } if (!added) break; } for (int j = 0; j < N; ++j) { cnt[i] += seen[j]; } } vector<int> res(N); int mn = *min_element(begin(cnt), end(cnt)); for (int i = 0; i < N; ++i) { if (mn == cnt[i]) { res[i] = 1; } } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...