#include<bits/stdc++.h>
#include "simurgh.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
int sz[1234567],par[1234567];
int tr[5234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
void dfs(int x , vector<vector>int>> &v){
used[x]=1;
for(auto u:v[x]){
if(used[u]==0)
dfs(u);
}
}
vector<int> find_roads(int n, vector<int> U, vector<int> V){
m=U.size();
// for(int i=0;i<m;i++){
// v[U[i]].pb(V[i]);
// v[V[i]].pb(U[i]);
// }
vector<int> permutation(m,0);
vector<int> ans={};
for(int i=m-n+1;i<m;i++){
permutation[i]=1;
}
do{
vector<int> vec;
vector<vector<int>> v(n);
for(int i=0;i<m;i++){
if(permutation[i]==1){vec.pb(i);v[U[i]].pb(V[i]);v[V[i]].pb(U[i]);}
}
for(int i=0;i<n;i++){
if(used[i]==0){
dfs(i,v);
cnt++;
}
}
if(cnt>1){
continue;
}
x = count_common_roads(vec);
if(x==n-1){
ans = vec;
return ans;
}
}while(next_permutation(permutation.begin(),permutation.end()));
return ans;
}
Compilation message
simurgh.cpp:43:31: error: type/value mismatch at argument 1 in template parameter list for 'template<class _Tp, class _Alloc> class std::vector'
43 | void dfs(int x , vector<vector>int>> &v){
| ^
simurgh.cpp:43:31: note: expected a type, got 'vector'
simurgh.cpp:43:31: error: template argument 2 is invalid
simurgh.cpp:43:32: error: two or more data types in declaration of 'parameter'
43 | void dfs(int x , vector<vector>int>> &v){
| ^~~
simurgh.cpp:43:35: error: expected ')' before '>>' token
43 | void dfs(int x , vector<vector>int>> &v){
| ~ ^~
| )
simurgh.cpp:43:35: error: expected initializer before '>>' token
43 | void dfs(int x , vector<vector>int>> &v){
| ^~
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:69:17: error: 'dfs' was not declared in this scope; did you mean 'ffs'?
69 | dfs(i,v);
| ^~~
| ffs
