Borderou de evaluare (job #1866284)

Utilizator mvcl3Marian Iacob mvcl3 Data 2 februarie 2017 20:27:29
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Eroare de compilare: user.cpp: In member function ‘void APM::Solve()’: user.cpp:119:51: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < M && Solution.size() < N - 1; ++i) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from user.cpp:3: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of ‘_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Tp = std::pair<int, std::pair<int, int> >; _Compare = cmp]’: /usr/include/c++/4.8/bits/stl_algo.h:2319:78: required from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = cmp]’ /usr/include/c++/4.8/bits/stl_algo.h:2360:62: required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Size = int; _Compare = cmp]’ /usr/include/c++/4.8/bits/stl_algo.h:5513:44: required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, std::pair<int, int> >*, std::vector<std::pair<int, std::pair<int, int> > > >; _Compare = cmp]’ user.cpp:117:45: required from here /usr/include/c++/4.8/bits/stl_algo.h:2287:35: error: no match for call to ‘(cmp) (std::pair<int, std::pair<int, int> >&, const std::pair<int, std::pair<int, int> >&)’ while (__comp(*__first, __pivot)) ^ user.cpp:12:8: note: candidate is: struct cmp ^ user.cpp:14:10: note: bool cmp::operator()(const Edge&, Edge&) bool operator() (const Edge &a, Edge &b) ^ user.cpp:14:10: note: no known conversion for argument 2 from ‘const std::pair<int, std::pair<int, int> >’ to ‘Edge& {aka std::pair<int, std::pair<int, int> >&}’

Ceva nu functioneaza?