Submission #494387

#TimeUsernameProblemLanguageResultExecution timeMemory
494387KhizriKeys (IOI21_keys)C++17
0 / 100
0 ms332 KiB
#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; while(q){ q=false; 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; goto loop; q=true; } } } loop:; } 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)

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:51:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |         if(vt.size()<cnt){
      |            ~~~~~~~~~^~~~
#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...