제출 #718482

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
718482		vinnipuh01	Robot (JOI21_ho_t4)	C++17	컴파일 에러	0 ms	0 KiB

이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.

Main

#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#define int long long
#define sqrt sqrtl

using namespace std;

const long long oo = 1000000000000000000;

long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos;


/*
    ViHHiPuh

   (( `'-""``""-'` ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / `;#'#'# - #'#'#;` \
 \_)) -----'#'----- ((_/
      # --------- #
  '# ------- ------ #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))


    cout << fixed << setprecision(6) << x;


    freopen ( "sum.in", "r", stdin )
*/

struct Node {
	int dp, u, col;
};

struct cmp {
	bool operator () ( const Node& a, const Node& b ) const {
		if ( a.dp == b.dp ) {
			if ( a.u == b.u ) {
				if ( a.pr == b.pr ) {
					return a.col < b.col;
				}
				return a.pr < b.pr;
			}
			return a.u < b.u;
		}
		return a.dp < b.dp;
	}
};

int n, m, x, y, z[ 200001 ], t[ 200001 ];
map <int, int> mp[ 100001 ], dp[ 100001 ][ 2 ];
vector <pair<int, int> > v[ 100001 ];
set <Node, cmp > st;

void dfs( int u, int pr, int col ) {
	int num = 0;
	int pos = 0;
	if ( col == 1 ) {
		for ( auto to : v[ u ] ) {
			if ( to.first == pr )
				num = t[ to.second ], pos = z[ to.second ];
		}
	}
	int sum;
	for ( auto to : v[ u ] ) {
		if ( to.first == pr )
			continue;
		if ( z[ to.second ] == pos )
			sum = num;
		else
			sum = 0;
		if ( dp[ to.first ][ u ][ 1 ] > dp[ u ][ pr ][ col ] + t[ to.second ] ) {
			dp[ to.first ][ u ][ 1 ] = dp[ u ][ pr ][ col ] + t[ to.second ];
			dfs( to.first, u, 1 );
		}
		if ( dp[ to.first ][ u ][ 0 ] > dp[ u ][ pr ][ col ] + mp[ u ][ z[ to.second ] ] - t[ to.second ] - sum ) {
			dp[ to.first ][ u ][ 0 ] = dp[ u ][ pr ][ col ] + mp[ u ][ z[ to.second ] ] - t[ to.second ] - sum;
			dfs( to.first, u, 0 );
		}
	}
}

main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for ( int i = 1; i <= m; i ++ ) {
		cin >> x >> y >> z[ i ] >> t[ i ];
		mp[ x ][ z[ i ] ] += t[ i ];
		mp[ y ][ z[ i ] ] += t[ i ];
		v[ x ].push_back( { y, i } );
		v[  y].push_back( { x, i } );
		dp[ x ][ 1 ][ y ] = dp[ x ][ 0 ][ y ] = dp[ y ][  1][ x ] = dp[ y ][ 0 ][ x ] = oo;
	}
	st.insert( { 0, 1, 0, 0 } );
	while ( st.size() ) {
		Node u = *st.begin();
		st.erase( st.begin() );
		num = pos = 0;
		if ( u.col == 1 ) {
			for ( auto to : v[ u.u ] ) {
				if ( to.first == u.pr ) {
					num = t[ to.second ], pos = z[ to.second ];
				}
			}
		}
		for ( auto to : v[ u.u ] ) {
			if ( to.first == u.pr )
				continue;
			sum = 0;
			if ( z[ to.second ] == pos )
				sum = num;
			if ( dp[ to.first ][ 1 ][ u.u ] > u.dp + t[ to.second ] ) {
				st.erase( { dp[ to.first ][ 1 ][ u.u ], to.first, u.u, 1 } );
				dp[ to.first ][ 1 ][ u.u ] = u.dp + t[ to.second ];
				st.insert( { dp[ to.first ][ 1 ][ u.u ], to.first, u.u, 1 } );
			}
			if ( dp[ to.first ][ 0 ][ u.u ] > u.dp + mp[ u.u ][ z[ to.second ] ] - t[ to.second ] - sum ) {
				st.erase( { dp[ to.first ][ 0 ][ u.u ], to.first, u.u, 0 } );
				dp[ to.first ][ 0 ][ u.u ] = u.dp + mp[ u.u ][ z[ to.second ] ] - t[ to.second ] - sum;
				st.insert( { dp[ to.first ][ 0 ][ u.u ], to.first, u.u, 0 } );
			}
		}
	}
	mn = oo;
	for ( int i = 1; i <= n; i ++ )
		mn = min( mn, min( dp[ n ][ 1 ][ i ], dp[ n ][ 0 ][ i ] ) );
	if ( mn == oo )
		cout << "-1\n";
	else
		cout << mn << "\n";
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In member function 'bool cmp::operator()(const Node&, const Node&) const':
Main.cpp:53:12: error: 'const struct Node' has no member named 'pr'
   53 |     if ( a.pr == b.pr ) {
      |            ^~
Main.cpp:53:20: error: 'const struct Node' has no member named 'pr'
   53 |     if ( a.pr == b.pr ) {
      |                    ^~
Main.cpp:56:14: error: 'const struct Node' has no member named 'pr'
   56 |     return a.pr < b.pr;
      |              ^~
Main.cpp:56:21: error: 'const struct Node' has no member named 'pr'
   56 |     return a.pr < b.pr;
      |                     ^~
Main.cpp: At global scope:
Main.cpp:97:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   97 | main () {
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:109:28: error: no matching function for call to 'std::set<Node, cmp>::insert(<brace-enclosed initializer list>)'
  109 |  st.insert( { 0, 1, 0, 0 } );
      |                            ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from Main.cpp:2:
/usr/include/c++/10/bits/stl_set.h:509:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = Node]'
  509 |       insert(const value_type& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:509:32: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type&' {aka 'const Node&'}
  509 |       insert(const value_type& __x)
      |              ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:518:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = Node]'
  518 |       insert(value_type&& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:518:27: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::set<Node, cmp>::value_type&&' {aka 'Node&&'}
  518 |       insert(value_type&& __x)
      |              ~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:546:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, const value_type&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = Node]'
  546 |       insert(const_iterator __position, const value_type& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:546:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/10/bits/stl_set.h:551:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = Node]'
  551 |       insert(const_iterator __position, value_type&& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:551:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/10/bits/stl_set.h:566:2: note: candidate: 'template<class _InputIterator> void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>]'
  566 |  insert(_InputIterator __first, _InputIterator __last)
      |  ^~~~~~
/usr/include/c++/10/bits/stl_set.h:566:2: note:   template argument deduction/substitution failed:
Main.cpp:109:28: note:   candidate expects 2 arguments, 1 provided
  109 |  st.insert( { 0, 1, 0, 0 } );
      |                            ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from Main.cpp:2:
/usr/include/c++/10/bits/stl_set.h:578:7: note: candidate: 'void std::set<_Key, _Compare, _Alloc>::insert(std::initializer_list<_Tp>) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>]'
  578 |       insert(initializer_list<value_type> __l)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:578:43: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::initializer_list<Node>'
  578 |       insert(initializer_list<value_type> __l)
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:598:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::insert_return_type std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::node_type&&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::insert_return_type = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::insert_return_type; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::node_type]'
  598 |       insert(node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:598:26: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::set<Node, cmp>::node_type&&' {aka 'std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::node_type&&'}
  598 |       insert(node_type&& __nh)
      |              ~~~~~~~~~~~~^~~~
/usr/include/c++/10/bits/stl_set.h:603:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::node_type&&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::node_type]'
  603 |       insert(const_iterator __hint, node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:603:7: note:   candidate expects 2 arguments, 1 provided
Main.cpp:116:24: error: 'struct Node' has no member named 'pr'
  116 |     if ( to.first == u.pr ) {
      |                        ^~
Main.cpp:122:23: error: 'struct Node' has no member named 'pr'
  122 |    if ( to.first == u.pr )
      |                       ^~
Main.cpp:128:64: error: no matching function for call to 'std::set<Node, cmp>::erase(<brace-enclosed initializer list>)'
  128 |     st.erase( { dp[ to.first ][ 1 ][ u.u ], to.first, u.u, 1 } );
      |                                                                ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from Main.cpp:2:
/usr/include/c++/10/bits/stl_set.h:654:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::erase(std::set<_Key, _Compare, _Alloc>::const_iterator) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator]'
  654 |       erase(const_iterator __position)
      |       ^~~~~
/usr/include/c++/10/bits/stl_set.h:654:28: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::set<Node, cmp>::const_iterator' {aka 'std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator'}
  654 |       erase(const_iterator __position)
      |             ~~~~~~~~~~~~~~~^~~~~~~~~~
/usr/include/c++/10/bits/stl_set.h:684:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::size_type std::set<_Key, _Compare, _Alloc>::erase(const key_type&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::size_type = long unsigned int; std::set<_Key, _Compare, _Alloc>::key_type = Node]'
  684 |       erase(const key_type& __x)
      |       ^~~~~
/usr/include/c++/10/bits/stl_set.h:684:29: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const key_type&' {aka 'const Node&'}
  684 |       erase(const key_type& __x)
      |             ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:706:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::erase(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::const_iterator) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator]'
  706 |       erase(const_iterator __first, const_iterator __last)
      |       ^~~~~
/usr/include/c++/10/bits/stl_set.h:706:7: note:   candidate expects 2 arguments, 1 provided
Main.cpp:130:65: error: no matching function for call to 'std::set<Node, cmp>::insert(<brace-enclosed initializer list>)'
  130 |     st.insert( { dp[ to.first ][ 1 ][ u.u ], to.first, u.u, 1 } );
      |                                                                 ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from Main.cpp:2:
/usr/include/c++/10/bits/stl_set.h:509:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = Node]'
  509 |       insert(const value_type& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:509:32: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type&' {aka 'const Node&'}
  509 |       insert(const value_type& __x)
      |              ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:518:7: note: candidate: 'std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = Node]'
  518 |       insert(value_type&& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:518:27: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::set<Node, cmp>::value_type&&' {aka 'Node&&'}
  518 |       insert(value_type&& __x)
      |              ~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:546:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, const value_type&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = Node]'
  546 |       insert(const_iterator __position, const value_type& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:546:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/10/bits/stl_set.h:551:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::value_type&&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = Node]'
  551 |       insert(const_iterator __position, value_type&& __x)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:551:7: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/10/bits/stl_set.h:566:2: note: candidate: 'template<class _InputIterator> void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>]'
  566 |  insert(_InputIterator __first, _InputIterator __last)
      |  ^~~~~~
/usr/include/c++/10/bits/stl_set.h:566:2: note:   template argument deduction/substitution failed:
Main.cpp:130:65: note:   candidate expects 2 arguments, 1 provided
  130 |     st.insert( { dp[ to.first ][ 1 ][ u.u ], to.first, u.u, 1 } );
      |                                                                 ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from Main.cpp:2:
/usr/include/c++/10/bits/stl_set.h:578:7: note: candidate: 'void std::set<_Key, _Compare, _Alloc>::insert(std::initializer_list<_Tp>) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>]'
  578 |       insert(initializer_list<value_type> __l)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:578:43: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::initializer_list<Node>'
  578 |       insert(initializer_list<value_type> __l)
      |              ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/10/bits/stl_set.h:598:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::insert_return_type std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::node_type&&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::insert_return_type = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::insert_return_type; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::node_type]'
  598 |       insert(node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:598:26: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::set<Node, cmp>::node_type&&' {aka 'std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::node_type&&'}
  598 |       insert(node_type&& __nh)
      |              ~~~~~~~~~~~~^~~~
/usr/include/c++/10/bits/stl_set.h:603:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::insert(std::set<_Key, _Compare, _Alloc>::const_iterator, std::set<_Key, _Compare, _Alloc>::node_type&&) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::node_type]'
  603 |       insert(const_iterator __hint, node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/10/bits/stl_set.h:603:7: note:   candidate expects 2 arguments, 1 provided
Main.cpp:133:64: error: no matching function for call to 'std::set<Node, cmp>::erase(<brace-enclosed initializer list>)'
  133 |     st.erase( { dp[ to.first ][ 0 ][ u.u ], to.first, u.u, 0 } );
      |                                                                ^
In file included from /usr/include/c++/10/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:87,
                 from Main.cpp:2:
/usr/include/c++/10/bits/stl_set.h:654:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::erase(std::set<_Key, _Compare, _Alloc>::const_iterator) [with _Key = Node; _Compare = cmp; _Alloc = std::allocator<Node>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<Node, Node, std::_Identity<Node>, cmp, std::allocator<Node> >::const_iterator]'
  654 |       erase(const_iterator __position)
      |       ^~~~~
/usr/include/c++/10/bits/stl_set.h:654:28: note:   no known c