Submission #53133622

---

Source Code Expand

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag, tree_order_statistics_node_update>oset; 
#define hi cout << "test\n" ;/////
#define ho cerr <<"test\n";
const int mod = 998244353;
#define all(x) x.begin() , x.end() 
#define sp(x) fixed<<setprecision(x)
#define  ll unsigned long long
const ll inf = 1e18 ; 
#define FastIO ios_base::sync_with_stdio(false) , cin.tie(0) , cout.tie(0)
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" = "; _print(x); cerr << endl;
#else
#define dbg(x)
#endif
ll binpow(ll a, ll b) {if (b == 0)return 1; ll res = binpow(a, b / 2);if (b % 2) return res * res * a;else return res * res;}
ll expo(ll a, ll b, ll mod) {ll ans = 1; while (b > 0) {if (b & 1)ans = (ans * a) % mod; a = (a * a) % mod; b = b >> 1;} return ans;}
ll gcd(ll a, ll b) { return((b == 0) ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return (b / gcd(a, b)) * a; }
int max ( int a , int b ) {if ( a > b ) return a ; return b ;}
int min ( int a , int b ){ if ( a < b )  return a ; return b ; }
void _print(auto t) {cerr << t;}
template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(deque <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.first); cerr << ","; _print(p.second); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " "; } cerr << "]";}
template <class T> void _print(deque <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " "; } cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}
template < typename T > void output (const vector<T> & vec ){  for(auto elem : vec) cout<<elem<<" ";cout <<"" ;}
//--------------------------------------------------------------- ------------------------------------------------------------------- 
#define int long long
const int MAX = 2e5 + 5;
typedef pair<long long, int> PII;
bool marked[MAX];
vector <PII> adj[MAX];
vector < int > vis ( MAX , false );

long long prim(int x)
{
    priority_queue<PII, vector<PII>, greater<PII> > Q;
    int y;
    long long minimumCost = 0;
    PII p;
    Q.push(make_pair(0, x));
    while(!Q.empty())
    {
        // Select the edge with minimum weight
        p = Q.top();
        Q.pop();
        x = p.second;
        // Checking for cycle
        if(marked[x] == true)
            continue;
        minimumCost += p.first;
        marked[x] = true;
        for(int i = 0;i < adj[x].size();++i)
        {
            y = adj[x][i].second;
            if(marked[y] == false)
                Q.push(adj[x][i]);
        }
    }
    return minimumCost;
}
void dfs ( int node ) {
    
        vis[node] = 1 ; 

        for ( auto & x : adj[node] ) {
              if ( vis[x.second]  ) continue ; 
              dfs ( x.second ) ;
        }
}
void solve(){ 
  
 
     int n , m ; 
     cin >> n >> m ; 


     for ( int i = 1 ; i <= m ; i++ ){

           int k , c ; 
           cin >> k >> c ; 

           vector < int > a ( k ) ; 
           for ( auto &x : a ) cin >> x ; 

           for ( int x = 0 ; x < k ;x++ ) {
              for ( int y = x + 1 ; y < k ; y++ ) {
                  adj[ a[x] ].push_back( { c , a[y] } ) ;
                  adj[ a[y] ].push_back( { c , a[x] } ) ;
              }
           }          

     }
     

     dfs ( 1 ) ; 
     for ( int i = 1 ; i <= n ; i++ ) {
        if ( vis[i] ) continue ; 

        cout << -1 ; 
        return ; 
     }
 

     int ans = prim( 1 ) ;
     cout << ans ;  
   

} 
//---------------------------------------------------------------------------------------------------------------------------------
int32_t main(){
 #ifndef ONLINE_JUDGE
    freopen("error.txt","w",stderr) ;
 #endif 

     FastIO ;
     int test = 1;
     int TestCases = 0 ; 

     if ( TestCases )
             cin>>test; 

     while(test--){
     solve(); 
      if(test>0)
        cout << endl; 
     }
 
 }          

Submission Info

Compile Error

Main.cpp: In function ‘long long int prim(long long int)’:
Main.cpp:65:25: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::vector<std::pair<long long int, long long int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   65 |         for(int i = 0;i < adj[x].size();++i)
      |                       ~~^~~~~~~~~~~~~~~

Judge Result