Submission #424564

#TimeUsernameProblemLanguageResultExecution timeMemory
424564PyqeSimurgh (IOI17_simurgh)C++14
13 / 100
3090 ms300 KiB
#include <bits/stdc++.h> #include "simurgh.h" using namespace std; #define mp make_pair #define fr first #define sc second long long m,dsu[569]; pair<long long,long long> ed[569]; long long fd(long long x) { if(dsu[x]!=x) { dsu[x]=fd(dsu[x]); } return dsu[x]; } vector<int> find_roads(int n,vector<int> ka,vector<int> la) { long long i,k,l,mk; vector<int> v; m=ka.size(); for(mk=0;mk<1ll<<m;mk++) { for(i=1;i<=n;i++) { dsu[i]=i; } v.clear(); for(i=0;i<m;i++) { if(mk>>i&1) { k=ka[i]+1; l=la[i]+1; if(fd(k)==fd(l)) { break; } dsu[fd(l)]=fd(k); v.push_back(i); } } if(i>=m&&v.size()==n-1&&count_common_roads(v)==n-1) { return v; } } }

Compilation message (stderr)

simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:49:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   49 |   if(i>=m&&v.size()==n-1&&count_common_roads(v)==n-1)
      |            ~~~~~~~~^~~~~
simurgh.cpp:54:1: warning: control reaches end of non-void function [-Wreturn-type]
   54 | }
      | ^
#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...