fork download

copy

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
 
#define edge pair< int, int >
#define MAX 2001
 
// ( w (u, v) ) format
vector< pair< int, edge > > GRAPH;
vector<int> index;
int parent[MAX], total, N, E;
 
int findset(int x, int *parent)
{
    if(x != parent[x])
        parent[x] = findset(parent[x], parent);
    return parent[x];
}
 
void kruskal()
{
    int i, pu, pv;
    sort(GRAPH.begin(), GRAPH.end()); // increasing weight
    for(i=total=0; i<E; i++)
    {
        pu = findset(GRAPH[i].second.first, parent);
        pv = findset(GRAPH[i].second.second, parent);
        if(pu != pv)
        {
        	index.push_back(i);
            parent[pu] = parent[pv]; // link
            total += GRAPH[i].first;
        }
    }
}
 
int min;
void second_MST()
{
	min = 0;
	for (int i = 0; i < index.size(); i++)
	{
		total = 0;
		fill(parent, parent+MAX, 0);
		pair<int, edge> tmp(GRAPH[index[i]]);
		GRAPH.erase(GRAPH.begin()+i);
		kruskal();
		if (total == 0 || total < min) min = total;
		GRAPH.insert(GRAPH.begin()+i);
	}
}
 
int main()
{
    int i, u, v, w;
 
    scanf("%d %d", &N, &E);
    for(int i=1; i<=N; i++) parent[i] = i;
    for(i=0; i<E; i++)
    {
        scanf("%d %d %d", &u, &v, &w);
        GRAPH.push_back(pair< int, edge >(w, edge(u, v)));
    }
    kruskal(); // runs kruskal and construct MST vector
    second_MST();
    printf("%d\n", min);
 
    return 0;
}

prog.cpp:41:2: error: reference to 'min' is ambiguous
        min = 0;
        ^
prog.cpp:38:5: note: candidate found by name lookup is 'min'
int min;
    ^
/usr/bin/../lib/gcc/i586-linux-gnu/4.9/../../../../include/c++/4.9/bits/algorithmfwd.h:371:5: note: candidate found by name lookup is 'std::min'
    min(const _Tp&, const _Tp&, _Compare);
    ^
/usr/bin/../lib/gcc/i586-linux-gnu/4.9/../../../../include/c++/4.9/bits/algorithmfwd.h:367:5: note: candidate found by name lookup is 'std::min'
    min(const _Tp&, const _Tp&);
    ^
prog.cpp:49:29: error: reference to 'min' is ambiguous
                if (total == 0 || total < min) min = total;
                                          ^
prog.cpp:38:5: note: candidate found by name lookup is 'min'
int min;
    ^
/usr/bin/../lib/gcc/i586-linux-gnu/4.9/../../../../include/c++/4.9/bits/algorithmfwd.h:371:5: note: candidate found by name lookup is 'std::min'
    min(const _Tp&, const _Tp&, _Compare);
    ^
/usr/bin/../lib/gcc/i586-linux-gnu/4.9/../../../../include/c++/4.9/bits/algorithmfwd.h:367:5: note: candidate found by name lookup is 'std::min'
    min(const _Tp&, const _Tp&);
    ^
prog.cpp:49:34: error: reference to 'min' is ambiguous
                if (total == 0 || total < min) min = total;
                                               ^
prog.cpp:38:5: note: candidate found by name lookup is 'min'
int min;
    ^
/usr/bin/../lib/gcc/i586-linux-gnu/4.9/../../../../include/c++/4.9/bits/algorithmfwd.h:371:5: note: candidate found by name lookup is 'std::min'
    min(const _Tp&, const _Tp&, _Compare);
    ^
/usr/bin/../lib/gcc/i586-linux-gnu/4.9/../../../../include/c++/4.9/bits/algorithmfwd.h:367:5: note: candidate found by name lookup is 'std::min'
    min(const _Tp&, const _Tp&);
    ^
prog.cpp:50:9: error: no matching member function for call to 'insert'
                GRAPH.insert(GRAPH.begin()+i);
                ~~~~~~^~~~~~
/usr/bin/../lib/gcc/i586-linux-gnu/4.9/../../../../include/c++/4.9/bits/stl_vector.h:1120:9: note: candidate function template not viable: requires 3 arguments, but 1 was provided
        insert(iterator __position, _InputIterator __first,
        ^
/usr/bin/../lib/gcc/i586-linux-gnu/4.9/../../../../include/c++/4.9/bits/stl_vector.h:998:7: note: candidate function not viable: requires 2 arguments, but 1 was provided
      insert(iterator __position, const value_type& __x);
      ^
/usr/bin/../lib/gcc/i586-linux-gnu/4.9/../../../../include/c++/4.9/bits/stl_vector.h:1072:7: note: candidate function not viable: requires 3 arguments, but 1 was provided
      insert(iterator __position, size_type __n, const value_type& __x)
      ^
prog.cpp:67:20: error: reference to 'min' is ambiguous
    printf("%d\n", min);
                   ^
prog.cpp:38:5: note: candidate found by name lookup is 'min'
int min;
    ^
/usr/bin/../lib/gcc/i586-linux-gnu/4.9/../../../../include/c++/4.9/bits/algorithmfwd.h:371:5: note: candidate found by name lookup is 'std::min'
    min(const _Tp&, const _Tp&, _Compare);
    ^
/usr/bin/../lib/gcc/i586-linux-gnu/4.9/../../../../include/c++/4.9/bits/algorithmfwd.h:367:5: note: candidate found by name lookup is 'std::min'
    min(const _Tp&, const _Tp&);
    ^
5 errors generated.

Standard output is empty