Borderou de evaluare (job #3137496)
| Utilizator |  Adrian Statescu thinkphp |
Data | 13 iunie 2023 08:48:51 |
|---|---|---|---|
| Problema | Heavy Path Decomposition | Status | done |
| Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
| Scor | 0 | ||
Raport evaluator
Eroare de compilare:
main.cpp: In function 'void DFS(int)':
main.cpp:101:5: error: reference to 'size' is ambiguous
101 | size[nod] = 1;
| ^~~~
In file included from /usr/include/c++/12.2.1/string:52,
from /usr/include/c++/12.2.1/bits/locale_classes.h:40,
from /usr/include/c++/12.2.1/bits/ios_base.h:41,
from /usr/include/c++/12.2.1/ios:42,
from /usr/include/c++/12.2.1/ostream:38,
from /usr/include/c++/12.2.1/iostream:39,
from main.cpp:1:
/usr/include/c++/12.2.1/bits/range_access.h:274:5: note: candidates are: 'template<class _Tp, long unsigned int _Nm> constexpr std::size_t std::size(const _Tp (&)[_Nm])'
274 | size(const _Tp (&)[_Nm]) noexcept
| ^~~~
/usr/include/c++/12.2.1/bits/range_access.h:264:5: note: 'template<class _Container> constexpr decltype (__cont.size()) std::size(const _Container&)'
264 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
main.cpp:90:5: note: 'int size [100002]'
90 | int size[Nmax], father[Nmax], level[Nmax], path[Nmax], length_path[Nmax];
| ^~~~
main.cpp:110:17: error: reference to 'size' is ambiguous
110 | size[nod] += size[son];
| ^~~~
/usr/include/c++/12.2.1/bits/range_access.h:274:5: note: candidates are: 'template<class _Tp, long unsigned int _Nm> constexpr std::size_t std::size(const _Tp (&)[_Nm])'
274 | size(const _Tp (&)[_Nm]) noexcept
| ^~~~
/usr/include/c++/12.2.1/bits/range_access.h:264:5: note: 'template<class _Container> constexpr decltype (__cont.size()) std::size(const _Container&)'
264 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
main.cpp:90:5: note: 'int size [100002]'
90 | int size[Nmax], father[Nmax], level[Nmax], path[Nmax], length_path[Nmax];
| ^~~~
main.cpp:110:30: error: reference to 'size' is ambiguous
110 | size[nod] += size[son];
| ^~~~
/usr/include/c++/12.2.1/bits/range_access.h:274:5: note: candidates are: 'template<class _Tp, long unsigned int _Nm> constexpr std::size_t std::size(const _Tp (&)[_Nm])'
274 | size(const _Tp (&)[_Nm]) noexcept
| ^~~~
/usr/include/c++/12.2.1/bits/range_access.h:264:5: note: 'template<class _Container> constexpr decltype (__cont.size()) std::size(const _Container&)'
264 | size(const _Container& __cont) noexcept(noexcept(__cont.size()))
| ^~~~
main.cpp:90:5: note: 'int size [100002]'
90 | int size[Nmax], father[Nmax], level[Nmax], path[Nmax], length_path[Nmax];
| ^~~~
main.cpp:112:22: error: reference to 'size' is ambiguous
112 | if ( size[heaviestSon] < size[son] )
| ^~~~
/usr/include/c++/12.2.1/bits/range_access.h:274:5: note: candidates are: 'template<class _Tp, long unsigned int _Nm> constexpr std::size_t std::size(const _Tp (&)[_Nm])'
274 | size(const _Tp (&)[_Nm]) noexcept
| ^~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
