Borderou de evaluare (job #2350665)
Utilizator | Data | 21 februarie 2019 17:11:43 | |
---|---|---|---|
Problema | Ninjago | Status | done |
Runda | Arhiva de probleme | Compilator | cpp-64 | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
main.cpp: In function 'std::vector<edge> apm(const graph&)':
main.cpp:104:20: error: conversion from '<brace-enclosed initializer list>' to 'std::priority_queue<std::tuple<energy, int>, std::vector<std::tuple<energy, int> >, std::greater<std::tuple<energy, int> > >::value_type {aka std::tuple<energy, int>}' is ambiguous
pq.push({{}, 0});
^
In file included from main.cpp:9:0:
/usr/include/c++/6/tuple:1025:2: note: candidate: std::tuple<_T1, _T2>::tuple(std::allocator_arg_t, const _Alloc&) [with _Alloc = int; _T1 = energy; _T2 = int]
tuple(allocator_arg_t __tag, const _Alloc& __a)
^~~~~
/usr/include/c++/6/tuple:906:19: note: candidate: constexpr std::tuple<_T1, _T2>::tuple(const _T1&, const _T2&) [with _Dummy = void; typename std::enable_if<(std::_TC<std::is_same<_Dummy, void>::value, _T1, _T2>::_ConstructibleTuple<_T1, _T2>() && std::_TC<std::is_same<_Dummy, void>::value, _T1, _T2>::_ImplicitlyConvertibleTuple<_T1, _T2>()), bool>::type <anonymous> = 1u; _T1 = energy; _T2 = int]
constexpr tuple(const _T1& __a1, const _T2& __a2)
^~~~~
In file included from /usr/include/c++/6/queue:64:0,
from main.cpp:10:
/usr/include/c++/6/bits/stl_queue.h:566:7: note: initializing argument 1 of 'void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::tuple<energy, int>; _Sequence = std::vector<std::tuple<energy, int> >; _Compare = std::greater<std::tuple<energy, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::tuple<energy, int>]'
push(value_type&& __x)
^~~~
main.cpp:97:20: warning: unused variable 'cost' [-Wunused-variable]
constexpr auto cost = 0;
^~~~
Non zero exit status: 1
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !