Klajonė

Taškai: 0

Compile: FAIL

klajone.cpp: In function ‘std::pair<Kelione, point> F(int, point)’: klajone.cpp:70:32: error: converting to ‘const key_type {aka const std::tuple<int, int, int>}’ from initializer list would use explicit constructor ‘constexpr std::tuple< <template-parameter-1-1> >::tuple(_UElements&& ...) [with _UElements = {int&, int&, int&}; <template-parameter-2-2> = void; _Elements = {int, int, int}]’ if (FF.count({i, KRP.x, KRP.y})) ^ klajone.cpp:71:31: error: converting to ‘std::map<std::tuple<int, int, int>, std::pair<Kelione, point> >::key_type {aka std::tuple<int, int, int>}’ from initializer list would use explicit constructor ‘constexpr std::tuple< <template-parameter-1-1> >::tuple(_UElements&& ...) [with _UElements = {int&, int&, int&}; <template-parameter-2-2> = void; _Elements = {int, int, int}]’ return FF[ {i, KRP.x, KRP.y}]; ^ klajone.cpp:92:30: error: converting to ‘std::map<std::tuple<int, int, int>, std::pair<Kelione, point> >::key_type {aka std::tuple<int, int, int>}’ from initializer list would use explicit constructor ‘constexpr std::tuple< <template-parameter-1-1> >::tuple(_UElements&& ...) [with _UElements = {int&, int&, int&}; <template-parameter-2-2> = void; _Elements = {int, int, int}]’ return FF[ {i, KRP.x, KRP.y}] = {A, krypt}; ^ In file included from /usr/include/c++/5/bits/stl_algobase.h:64:0, from /usr/include/c++/5/bits/char_traits.h:39, from /usr/include/c++/5/ios:40, from /usr/include/c++/5/istream:38, from /usr/include/c++/5/sstream:38, from /usr/include/c++/5/complex:45, from /usr/include/c++/5/ccomplex:38, from /usr/include/x86_64-linux-gnu/c++/5/bits/stdc++.h:52, from klajone.cpp:7: /usr/include/c++/5/bits/stl_pair.h: In instantiation of ‘constexpr std::pair<_T1, _T2>::pair() [with _T1 = Kelione; _T2 = point]’: /usr/include/c++/5/tuple:1172:70: required from ‘std::pair<_T1, _T2>::pair(std::tuple<_Args1 ...>&, std::tuple<_Args2 ...>&, std::_Index_tuple<_Indexes1 ...>, std::_Index_tuple<_Indexes2 ...>) [with _Args1 = {std::tuple<int, int, int>&&}; long unsigned int ..._Indexes1 = {0ul}; _Args2 = {}; long unsigned int ..._Indexes2 = {}; _T1 = const std::tuple<int, int, int>; _T2 = std::pair<Kelione, point>]’ /usr/include/c++/5/tuple:1161:63: required from ‘std::pair<_T1, _T2>::pair(std::piecewise_construct_t, std::tuple<_Args1 ...>, std::tuple<_Args2 ...>) [with _Args1 = {std::tuple<int, int, int>&&}; _Args2 = {}; _T1 = const std::tuple<int, int, int>; _T2 = std::pair<Kelione, point>]’ /usr/include/c++/5/ext/new_allocator.h:120:4: required from ‘void __gnu_cxx::new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> >; _Args = {const std::piecewise_construct_t&, std::tuple<std::tuple<int, int, int>&&>, std::tuple<>}; _Tp = std::_Rb_tree_node<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >]’ /usr/include/c++/5/bits/alloc_traits.h:530:4: required from ‘static void std::allocator_traits<std::allocator<_CharT> >::construct(std::allocator_traits<std::allocator<_CharT> >::allocator_type&, _Up*, _Args&& ...) [with _Up = std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> >; _Args = {const std::piecewise_construct_t&, std::tuple<std::tuple<int, int, int>&&>, std::tuple<>}; _Tp = std::_Rb_tree_node<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >; std::allocator_traits<std::allocator<_CharT> >::allocator_type = std::allocator<std::_Rb_tree_node<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > > >]’ /usr/include/c++/5/bits/stl_tree.h:529:32: required from ‘void std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_construct_node(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<std::tuple<int, int, int>&&>, std::tuple<>}; _Key = std::tuple<int, int, int>; _Val = std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> >; _KeyOfValue = std::_Select1st<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >*]’ /usr/include/c++/5/bits/stl_tree.h:546:21: required from ‘std::_Rb_tree_node<_Val>* std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_create_node(_Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<std::tuple<int, int, int>&&>, std::tuple<>}; _Key = std::tuple<int, int, int>; _Val = std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> >; _KeyOfValue = std::_Select1st<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_Link_type = std::_Rb_tree_node<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >*]’ /usr/include/c++/5/bits/stl_tree.h:2170:33: required from ‘std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_emplace_hint_unique(std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator, _Args&& ...) [with _Args = {const std::piecewise_construct_t&, std::tuple<std::tuple<int, int, int>&&>, std::tuple<>}; _Key = std::tuple<int, int, int>; _Val = std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> >; _KeyOfValue = std::_Select1st<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator = std::_Rb_tree_iterator<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >; std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >]’ /usr/include/c++/5/bits/stl_map.h:502:8: required from ‘std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type& std::map<_Key, _Tp, _Compare, _Alloc>::operator[](std::map<_Key, _Tp, _Compare, _Alloc>::key_type&&) [with _Key = std::tuple<int, int, int>; _Tp = std::pair<Kelione, point>; _Compare = std::less<std::tuple<int, int, int> >; _Alloc = std::allocator<std::pair<const std::tuple<int, int, int>, std::pair<Kelione, point> > >; std::map<_Key, _Tp, _Compare, _Alloc>::mapped_type = std::pair<Kelione, point>; std::map<_Key, _Tp, _Compare, _Alloc>::key_type = std::tuple<int, int, int>]’ klajone.cpp:71:31: required from here /usr/include/c++/5/bits/stl_pair.h:109:25: error: no matching function for call to ‘point::point()’ : first(), second() { } ^ klajone.cpp:52:2: note: candidate: point::point(int, int) point(int x, int y): x(x), y(y) ^ klajone.cpp:52:2: note: candidate expects 2 arguments, 0 provided klajone.cpp:49:8: note: candidate: constexpr point::point(const point&) struct point ^ klajone.cpp:49:8: note: candidate expects 1 argument, 0 provided klajone.cpp:49:8: note: candidate: constexpr point::point(point&&) klajone.cpp:49:8: note: candidate expects 1 argument, 0 provided

nr.resulttimemessage