# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
494390 | Khizri | Keys (IOI21_keys) | C++17 | 1 ms | 332 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pb push_back
#define F first
#define S second
const int mxn=2000+5;
int n,m;
vector<pii>vt[mxn];
vector<int> bfs(int u,vector<int> &r){
vector<int>v1,arr;
vector<int>color(n+5);
vector<int>mp(n+5);
color[u]=1;
//bool q=true;
v1.pb(u);
arr.pb(r[u]);
mp[r[u]]=1;
int q=n;
while(q--){
for(int x:v1){
for(pii p:vt[x]){
int v=p.F,k=p.S;
if(color[v]) continue;
if(mp[k]){
mp[r[v]]=1;
arr.pb(r[v]);
v1.pb(v);
color[v]=1;
}
}
}
}
return v1;
}
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++){
vt[u[i]].pb({v[i],c[i]});
vt[v[i]].pb({u[i],c[i]});
}
int cnt=1e7;
vector<int>ans;
for(int i=0;i<n;i++){
vector<int>vt=bfs(i,r);
if(vt.size()<cnt){
cnt=vt.size();
ans=vt;
}
}
vector<int>s(n);
for(int v:ans){
s[v]=1;
}
return s;
}
Compilation message (stderr)
# | 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... |