Graph.cpp: In function 'int main()':
Graph.cpp:105:32: error: no matching function for call to 'std::unordered_map<long long int, long long int>::find(<brace-enclosed initializer list>)'
105 | if (mp.find({j, q}) != mp.end()) {
| ~~~~~~~^~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:874:9: note: candidate: 'template<class _Kt> decltype (((std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>*)this)->std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::_M_h._M_find_tr(__x)) std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const _Kt&) [with _Kt = _Kt; _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]'
874 | find(const _Kt& __x) -> decltype(_M_h._M_find_tr(__x))
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:874:9: note: template argument deduction/substitution failed:
Graph.cpp:105:32: note: couldn't deduce template parameter '_Kt'
105 | if (mp.find({j, q}) != mp.end()) {
| ~~~~~~~^~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:885:9: note: candidate: 'template<class _Kt> decltype (((const std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>*)this)->std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::_M_h._M_find_tr(__x)) std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const _Kt&) const [with _Kt = _Kt; _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]'
885 | find(const _Kt& __x) const -> decltype(_M_h._M_find_tr(__x))
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:885:9: note: template argument deduction/substitution failed:
Graph.cpp:105:32: note: couldn't deduce template parameter '_Kt'
105 | if (mp.find({j, q}) != mp.end()) {
| ~~~~~~~^~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:868:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::iterator std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const key_type&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::iterator = std::__detail::_Insert_base<long long int, std::pair<const long long int, long long int>, std::allocator<std::pair<const long long int, long long int> >, std::__detail::_Select1st, std::equal_to<long long int>, std::hash<long long int>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::iterator; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
868 | find(const key_type& __x)
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:868:28: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
868 | find(const key_type& __x)
| ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/11/bits/unordered_map.h:879:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const key_type&) const [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator = std::__detail::_Insert_base<long long int, std::pair<const long long int, long long int>, std::allocator<std::pair<const long long int, long long int> >, std::__detail::_Select1st, std::equal_to<long long int>, std::hash<long long int>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::const_iterator; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
879 | find(const key_type& __x) const
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:879:28: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
879 | find(const key_type& __x) const
| ~~~~~~~~~~~~~~~~^~~
Graph.cpp:106:36: error: no match for 'operator[]' (operand types are 'std::unordered_map<long long int, long long int>' and '<brace-enclosed initializer list>')
106 | int w3 = mp[{j, q}];
| ^
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:979:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type& std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type = long long int; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
979 | operator[](const key_type& __k)
| ^~~~~~~~
/usr/include/c++/11/bits/unordered_map.h:979:34: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
979 | operator[](const key_type& __k)
| ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/11/bits/unordered_map.h:983:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type& std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type&&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type = long long int; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
983 | operator[](key_type&& __k)
| ^~~~~~~~
/usr/include/c++/11/bits/unordered_map.h:983:29: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::unordered_map<long long int, long long int>::key_type&&' {aka 'long long int&&'}
983 | operator[](key_type&& __k)
| ~~~~~~~~~~~^~~
Graph.cpp:133:28: error: no matching function for call to 'std::unordered_map<long long int, long long int>::find(<brace-enclosed initializer list>)'
133 | if (mp.find({ni, nj}) == mp.end())
| ~~~~~~~^~~~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:874:9: note: candidate: 'template<class _Kt> decltype (((std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>*)this)->std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::_M_h._M_find_tr(__x)) std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const _Kt&) [with _Kt = _Kt; _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]'
874 | find(const _Kt& __x) -> decltype(_M_h._M_find_tr(__x))
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:874:9: note: template argument deduction/substitution failed:
Graph.cpp:133:28: note: couldn't deduce template parameter '_Kt'
133 | if (mp.find({ni, nj}) == mp.end())
| ~~~~~~~^~~~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:885:9: note: candidate: 'template<class _Kt> decltype (((const std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>*)this)->std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::_M_h._M_find_tr(__x)) std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const _Kt&) const [with _Kt = _Kt; _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]'
885 | find(const _Kt& __x) const -> decltype(_M_h._M_find_tr(__x))
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:885:9: note: template argument deduction/substitution failed:
Graph.cpp:133:28: note: couldn't deduce template parameter '_Kt'
133 | if (mp.find({ni, nj}) == mp.end())
| ~~~~~~~^~~~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:868:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::iterator std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const key_type&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::iterator = std::__detail::_Insert_base<long long int, std::pair<const long long int, long long int>, std::allocator<std::pair<const long long int, long long int> >, std::__detail::_Select1st, std::equal_to<long long int>, std::hash<long long int>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::iterator; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
868 | find(const key_type& __x)
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:868:28: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
868 | find(const key_type& __x)
| ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/11/bits/unordered_map.h:879:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const key_type&) const [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator = std::__detail::_Insert_base<long long int, std::pair<const long long int, long long int>, std::allocator<std::pair<const long long int, long long int> >, std::__detail::_Select1st, std::equal_to<long long int>, std::hash<long long int>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::const_iterator; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
879 | find(const key_type& __x) const
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:879:28: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
879 | find(const key_type& __x) const
| ~~~~~~~~~~~~~~~~^~~
Graph.cpp:137:32: error: no matching function for call to 'std::unordered_map<long long int, long long int>::find(<brace-enclosed initializer list>)'
137 | if (mp.find({ni, nq}) != mp.end() && mp.find({nq, nj}) != mp.end()) {
| ~~~~~~~^~~~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:874:9: note: candidate: 'template<class _Kt> decltype (((std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>*)this)->std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::_M_h._M_find_tr(__x)) std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const _Kt&) [with _Kt = _Kt; _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]'
874 | find(const _Kt& __x) -> decltype(_M_h._M_find_tr(__x))
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:874:9: note: template argument deduction/substitution failed:
Graph.cpp:137:32: note: couldn't deduce template parameter '_Kt'
137 | if (mp.find({ni, nq}) != mp.end() && mp.find({nq, nj}) != mp.end()) {
| ~~~~~~~^~~~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:885:9: note: candidate: 'template<class _Kt> decltype (((const std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>*)this)->std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::_M_h._M_find_tr(__x)) std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const _Kt&) const [with _Kt = _Kt; _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]'
885 | find(const _Kt& __x) const -> decltype(_M_h._M_find_tr(__x))
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:885:9: note: template argument deduction/substitution failed:
Graph.cpp:137:32: note: couldn't deduce template parameter '_Kt'
137 | if (mp.find({ni, nq}) != mp.end() && mp.find({nq, nj}) != mp.end()) {
| ~~~~~~~^~~~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:868:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::iterator std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const key_type&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::iterator = std::__detail::_Insert_base<long long int, std::pair<const long long int, long long int>, std::allocator<std::pair<const long long int, long long int> >, std::__detail::_Select1st, std::equal_to<long long int>, std::hash<long long int>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::iterator; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
868 | find(const key_type& __x)
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:868:28: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
868 | find(const key_type& __x)
| ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/11/bits/unordered_map.h:879:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const key_type&) const [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator = std::__detail::_Insert_base<long long int, std::pair<const long long int, long long int>, std::allocator<std::pair<const long long int, long long int> >, std::__detail::_Select1st, std::equal_to<long long int>, std::hash<long long int>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::const_iterator; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
879 | find(const key_type& __x) const
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:879:28: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
879 | find(const key_type& __x) const
| ~~~~~~~~~~~~~~~~^~~
Graph.cpp:137:65: error: no matching function for call to 'std::unordered_map<long long int, long long int>::find(<brace-enclosed initializer list>)'
137 | if (mp.find({ni, nq}) != mp.end() && mp.find({nq, nj}) != mp.end()) {
| ~~~~~~~^~~~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:874:9: note: candidate: 'template<class _Kt> decltype (((std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>*)this)->std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::_M_h._M_find_tr(__x)) std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const _Kt&) [with _Kt = _Kt; _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]'
874 | find(const _Kt& __x) -> decltype(_M_h._M_find_tr(__x))
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:874:9: note: template argument deduction/substitution failed:
Graph.cpp:137:65: note: couldn't deduce template parameter '_Kt'
137 | if (mp.find({ni, nq}) != mp.end() && mp.find({nq, nj}) != mp.end()) {
| ~~~~~~~^~~~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:885:9: note: candidate: 'template<class _Kt> decltype (((const std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>*)this)->std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::_M_h._M_find_tr(__x)) std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const _Kt&) const [with _Kt = _Kt; _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >]'
885 | find(const _Kt& __x) const -> decltype(_M_h._M_find_tr(__x))
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:885:9: note: template argument deduction/substitution failed:
Graph.cpp:137:65: note: couldn't deduce template parameter '_Kt'
137 | if (mp.find({ni, nq}) != mp.end() && mp.find({nq, nj}) != mp.end()) {
| ~~~~~~~^~~~~~~~~~
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:868:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::iterator std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const key_type&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::iterator = std::__detail::_Insert_base<long long int, std::pair<const long long int, long long int>, std::allocator<std::pair<const long long int, long long int> >, std::__detail::_Select1st, std::equal_to<long long int>, std::hash<long long int>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::iterator; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
868 | find(const key_type& __x)
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:868:28: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
868 | find(const key_type& __x)
| ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/11/bits/unordered_map.h:879:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::find(const key_type&) const [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::const_iterator = std::__detail::_Insert_base<long long int, std::pair<const long long int, long long int>, std::allocator<std::pair<const long long int, long long int> >, std::__detail::_Select1st, std::equal_to<long long int>, std::hash<long long int>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<false, false, true> >::const_iterator; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
879 | find(const key_type& __x) const
| ^~~~
/usr/include/c++/11/bits/unordered_map.h:879:28: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
879 | find(const key_type& __x) const
| ~~~~~~~~~~~~~~~~^~~
Graph.cpp:138:36: error: no match for 'operator[]' (operand types are 'std::unordered_map<long long int, long long int>' and '<brace-enclosed initializer list>')
138 | int w1 = mp[{ni, nj}];
| ^
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:979:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type& std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type = long long int; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
979 | operator[](const key_type& __k)
| ^~~~~~~~
/usr/include/c++/11/bits/unordered_map.h:979:34: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
979 | operator[](const key_type& __k)
| ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/11/bits/unordered_map.h:983:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type& std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type&&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type = long long int; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
983 | operator[](key_type&& __k)
| ^~~~~~~~
/usr/include/c++/11/bits/unordered_map.h:983:29: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::unordered_map<long long int, long long int>::key_type&&' {aka 'long long int&&'}
983 | operator[](key_type&& __k)
| ~~~~~~~~~~~^~~
Graph.cpp:139:36: error: no match for 'operator[]' (operand types are 'std::unordered_map<long long int, long long int>' and '<brace-enclosed initializer list>')
139 | int w2 = mp[{ni, nq}];
| ^
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:979:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type& std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type = long long int; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
979 | operator[](const key_type& __k)
| ^~~~~~~~
/usr/include/c++/11/bits/unordered_map.h:979:34: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
979 | operator[](const key_type& __k)
| ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/11/bits/unordered_map.h:983:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type& std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type&&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type = long long int; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
983 | operator[](key_type&& __k)
| ^~~~~~~~
/usr/include/c++/11/bits/unordered_map.h:983:29: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::unordered_map<long long int, long long int>::key_type&&' {aka 'long long int&&'}
983 | operator[](key_type&& __k)
| ~~~~~~~~~~~^~~
Graph.cpp:140:36: error: no match for 'operator[]' (operand types are 'std::unordered_map<long long int, long long int>' and '<brace-enclosed initializer list>')
140 | int w3 = mp[{nj, nq}];
| ^
In file included from /usr/include/c++/11/unordered_map:47,
from /usr/include/c++/11/functional:61,
from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
from /usr/include/c++/11/algorithm:74,
from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
from Graph.cpp:1:
/usr/include/c++/11/bits/unordered_map.h:979:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type& std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](const key_type&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type = long long int; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
979 | operator[](const key_type& __k)
| ^~~~~~~~
/usr/include/c++/11/bits/unordered_map.h:979:34: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const long long int&'}
979 | operator[](const key_type& __k)
| ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/11/bits/unordered_map.h:983:7: note: candidate: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type& std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator[](std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type&&) [with _Key = long long int; _Tp = long long int; _Hash = std::hash<long long int>; _Pred = std::equal_to<long long int>; _Alloc = std::allocator<std::pair<const long long int, long long int> >; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::mapped_type = long long int; std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::key_type = long long int]'
983 | operator[](key_type&& __k)
| ^~~~~~~~
/usr/include/c++/11/bits/unordered_map.h:983:29: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::unordered_map<long long int, long long int>::key_type&&' {aka 'long long int&&'}
983 | operator[](key_type&& __k)
| ~~~~~~~~~~~^~~