이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define INF (int)1e9
int n, m;
const int N = 3e5 + 69;
vector <pair<int, int>> adj[N];
vector <int> pend[N];
bool have[N], vis[N]; //do i have this colour?
int cnt[N];
vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
n = r.size();
m = u.size();
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]});
}
int mn = INF;
for (int i = 0; i < n; i++){
for (int j = 0; j < n; j++){
have[j] = false;
pend[j].clear();
}
queue <int> q;
q.push(i);
vis[i] = true;
while (!q.empty()){
cnt[i]++;
int u = q.front();
q.pop();
have[r[u]] = true;
for (auto x : pend[r[u]]){
vis[x] = true;
q.push(x);
}
pend[r[u]].clear();
for (auto [v, c] : adj[u]){
if (vis[v]) continue;
if (have[c]){
vis[v] = true;
q.push(v);
} else {
pend[c].push_back(v);
}
}
}
mn = min(mn, cnt[i]);
}
vector <int> ans;
for (int i = 0; i < n; i++){
if (mn == cnt[i]) ans.push_back(i);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |