| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 284972 | 2020-08-28T08:36:37 Z | 3zp | Aesthetic (NOI20_aesthetic) | C++14 | 컴파일 오류 |
0 ms | 0 KB |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 500009;
vector<pair<ll, pair<ll, ll > > > v[N];
vector<ll> T[N];
ll d1[N],dn[N], f[N], g[N],ea[N],eb[N],ec[N], par[N],path[N],wh[N];
set<pair<ll,ll> > S;
/*
00000111111
*/
void ad(ll x){
g[x] = 1;
for(auto E : v[x]){
ll y = E.first, l = E.second.first, u= E.second.second;
auto it= S.find(u);
if(g[y] == 1) S.erase(it);
if(g[y] == 0) S.insert(u);
}
}
ll A = 0;
main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
ll n, m;
cin >> n >> m;
for(ll i = 0; i < m; i++){
cin>>ea[i]>>eb[i]>>ec[i];
}
for(ll i = m-1; i >= 0; i--){
ll a = ea[i], b = eb[i], c = ec[i];
v[a].push_back({b, {c,i}});
v[b].push_back({a, {c,i}});
A = max(A, c);
}/*)
for(ll i = 1; i <= n; i++){
d1[i] = 1e18;
dn[i] = 1e18;
}
d1[1] = 0;
dn[n] = 0;
priority_queue<pair<ll, ll> > q;
q.push({0, 1});
while(q.size()){
ll x = q.top().second;
q.pop();
if(f[x]) continue;
f[x] = 1;
for(auto E: v[x]){
ll y = E.first, l = E.second.first;
if(!f[y] && d1[y] > d1[x] + l){
d1[y] = d1[x] + l;
par[y] = x;
q.push({-d1[y], y});
}
}
}
q.push({0, n});
for(ll i = 1; i <= n; i++)
f[i] = 0;
while(q.size()){
ll x = q.top().second;
q.pop();
if(f[x]) continue;
f[x] = 1;
for(auto E: v[x]){
ll y = E.first, l = E.second.first;
if(!f[y] && dn[y] > dn[x] + l){
dn[y] = dn[x] + l;
q.push({-dn[y], y});
}
}
}
vector<pair<ll,ll> > W;
ll ans = d1[n];
ll X = n;
while(1){
path[X] = 1;
if(X == 1) break;
X = par[X];
}
for(ll i = 1; i <= n; i++){
W.push_back({d1[i], i});
}
sort(W.begin(), W.end());
for(ll i = 0; i < W.size(); i++){
ll x = W[i].second;
if(path[x]) wh[x] = x;
else wh[x] = wh[par[x]];
T[wh[x]].push_back(x);
}*/
for(int i=1;i<= n; i++)
ad(i);/*
ll x = n;
while(1){
for(ll y : T[x])
ad(y);
if(x == 1) break;
x = par[x];
if(S.size() == 0) continue;
ll U = S.begin()->first + S.begin()->second;
auto it = S.begin();
it++;
if(it != S.end()) U = min(U, it->first);
ans = max(ans, U);
}*/
//cout<<ans<<endl;
}
Compilation message
Aesthetic.cpp: In function 'void ad(long long int)':
Aesthetic.cpp:17:26: error: no matching function for call to 'std::set<std::pair<long long int, long long int> >::find(long long int&)'
17 | auto it= S.find(u);
| ^
In file included from /usr/include/c++/9/set:61,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:87,
from Aesthetic.cpp:1:
/usr/include/c++/9/bits/stl_set.h:794:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::iterator std::set<_Key, _Compare, _Alloc>::find(const key_type&) [with _Key = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >; std::set<_Key, _Compare, _Alloc>::key_type = std::pair<long long int, long long int>]'
794 | find(const key_type& __x)
| ^~~~
/usr/include/c++/9/bits/stl_set.h:794:28: note: no known conversion for argument 1 from 'long long int' to 'const key_type&' {aka 'const std::pair<long long int, long long int>&'}
794 | find(const key_type& __x)
| ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/9/bits/stl_set.h:798:7: note: candidate: 'std::set<_Key, _Compare, _Alloc>::const_iterator std::set<_Key, _Compare, _Alloc>::find(const key_type&) const [with _Key = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >; std::set<_Key, _Compare, _Alloc>::key_type = std::pair<long long int, long long int>]'
798 | find(const key_type& __x) const
| ^~~~
/usr/include/c++/9/bits/stl_set.h:798:28: note: no known conversion for argument 1 from 'long long int' to 'const key_type&' {aka 'const std::pair<long long int, long long int>&'}
798 | find(const key_type& __x) const
| ~~~~~~~~~~~~~~~~^~~
/usr/include/c++/9/bits/stl_set.h:804:2: note: candidate: 'template<class _Kt> decltype (std::set<_Key, _Compare, _Alloc>::iterator{((std::set<_Key, _Compare, _Alloc>*)this)->std::set<_Key, _Compare, _Alloc>::_M_t._M_find_tr(__x)}) std::set<_Key, _Compare, _Alloc>::find(const _Kt&) [with _Kt = _Kt; _Key = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >]'
804 | find(const _Kt& __x)
| ^~~~
/usr/include/c++/9/bits/stl_set.h:804:2: note: template argument deduction/substitution failed:
/usr/include/c++/9/bits/stl_set.h: In substitution of 'template<class _Kt> decltype (std::set<std::pair<long long int, long long int> >::iterator{((std::set<std::pair<long long int, long long int> >*)this)->std::set<std::pair<long long int, long long int> >::_M_t.std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::_M_find_tr(__x)}) std::set<std::pair<long long int, long long int> >::find<_Kt>(const _Kt&) [with _Kt = long long int]':
Aesthetic.cpp:17:26: required from here
/usr/include/c++/9/bits/stl_set.h:804:2: error: no matching function for call to 'std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::_M_find_tr(const long long int&)'
In file included from /usr/include/c++/9/map:60,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:81,
from Aesthetic.cpp:1:
/usr/include/c++/9/bits/stl_tree.h:1306:2: note: candidate: 'template<class _Kt, class _Req> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_find_tr(const _Kt&) [with _Kt = _Kt; _Req = _Req; _Key = std::pair<long long int, long long int>; _Val = std::pair<long long int, long long int>; _KeyOfValue = std::_Identity<std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >]'
1306 | _M_find_tr(const _Kt& __k)
| ^~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:1306:2: note: template argument deduction/substitution failed:
/usr/include/c++/9/bits/stl_tree.h: In substitution of 'template<class _Cmp, class _SfinaeType> using __has_is_transparent_t = typename std::__has_is_transparent<_Cmp, _SfinaeType>::type [with _Cmp = std::less<std::pair<long long int, long long int> >; _SfinaeType = long long int]':
/usr/include/c++/9/bits/stl_tree.h:1304:9: required by substitution of 'template<class _Kt> decltype (std::set<std::pair<long long int, long long int> >::iterator{((std::set<std::pair<long long int, long long int> >*)this)->std::set<std::pair<long long int, long long int> >::_M_t.std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::_M_find_tr(__x)}) std::set<std::pair<long long int, long long int> >::find<_Kt>(const _Kt&) [with _Kt = long long int]'
Aesthetic.cpp:17:26: required from here
/usr/include/c++/9/bits/stl_tree.h:425:11: error: no type named 'type' in 'struct std::__has_is_transparent<std::less<std::pair<long long int, long long int> >, long long int, void>'
425 | using __has_is_transparent_t
| ^~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/stl_set.h: In substitution of 'template<class _Kt> decltype (std::set<std::pair<long long int, long long int> >::iterator{((std::set<std::pair<long long int, long long int> >*)this)->std::set<std::pair<long long int, long long int> >::_M_t.std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::_M_find_tr(__x)}) std::set<std::pair<long long int, long long int> >::find<_Kt>(const _Kt&) [with _Kt = long long int]':
Aesthetic.cpp:17:26: required from here
/usr/include/c++/9/bits/stl_tree.h:1315:2: note: candidate: 'template<class _Kt, class _Req> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_find_tr(const _Kt&) const [with _Kt = _Kt; _Req = _Req; _Key = std::pair<long long int, long long int>; _Val = std::pair<long long int, long long int>; _KeyOfValue = std::_Identity<std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >]'
1315 | _M_find_tr(const _Kt& __k) const
| ^~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:1315:2: note: template argument deduction/substitution failed:
In file included from /usr/include/c++/9/set:61,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:87,
from Aesthetic.cpp:1:
/usr/include/c++/9/bits/stl_set.h:804:2: error: no matching function for call to 'std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >::_Rb_tree_const_iterator(<brace-enclosed initializer list>)'
804 | find(const _Kt& __x)
| ^~~~
In file included from /usr/include/c++/9/map:60,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:81,
from Aesthetic.cpp:1:
/usr/include/c++/9/bits/stl_tree.h:348:7: note: candidate: 'std::_Rb_tree_const_iterator<_Tp>::_Rb_tree_const_iterator(const iterator&) [with _Tp = std::pair<long long int, long long int>; std::_Rb_tree_const_iterator<_Tp>::iterator = std::_Rb_tree_iterator<std::pair<long long int, long long int> >]'
348 | _Rb_tree_const_iterator(const iterator& __it) _GLIBCXX_NOEXCEPT
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:348:7: note: conversion of argument 1 would be ill-formed:
/usr/include/c++/9/bits/stl_tree.h:345:7: note: candidate: 'std::_Rb_tree_const_iterator<_Tp>::_Rb_tree_const_iterator(std::_Rb_tree_const_iterator<_Tp>::_Base_ptr) [with _Tp = std::pair<long long int, long long int>; std::_Rb_tree_const_iterator<_Tp>::_Base_ptr = const std::_Rb_tree_node_base*]'
345 | _Rb_tree_const_iterator(_Base_ptr __x) _GLIBCXX_NOEXCEPT
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:345:7: note: conversion of argument 1 would be ill-formed:
/usr/include/c++/9/bits/stl_tree.h:341:7: note: candidate: 'std::_Rb_tree_const_iterator<_Tp>::_Rb_tree_const_iterator() [with _Tp = std::pair<long long int, long long int>]'
341 | _Rb_tree_const_iterator() _GLIBCXX_NOEXCEPT
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:341:7: note: candidate expects 0 arguments, 1 provided
/usr/include/c++/9/bits/stl_tree.h:326:12: note: candidate: 'constexpr std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >::_Rb_tree_const_iterator(const std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >&)'
326 | struct _Rb_tree_const_iterator
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:326:12: note: conversion of argument 1 would be ill-formed:
/usr/include/c++/9/bits/stl_tree.h:326:12: note: candidate: 'constexpr std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >::_Rb_tree_const_iterator(std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >&&)'
/usr/include/c++/9/bits/stl_tree.h:326:12: note: conversion of argument 1 would be ill-formed:
In file included from /usr/include/c++/9/set:61,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:87,
from Aesthetic.cpp:1:
/usr/include/c++/9/bits/stl_set.h:810:2: note: candidate: 'template<class _Kt> decltype (std::set<_Key, _Compare, _Alloc>::const_iterator{((const std::set<_Key, _Compare, _Alloc>*)this)->std::set<_Key, _Compare, _Alloc>::_M_t._M_find_tr(__x)}) std::set<_Key, _Compare, _Alloc>::find(const _Kt&) const [with _Kt = _Kt; _Key = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >]'
810 | find(const _Kt& __x) const
| ^~~~
/usr/include/c++/9/bits/stl_set.h:810:2: note: template argument deduction/substitution failed:
/usr/include/c++/9/bits/stl_set.h: In substitution of 'template<class _Kt> decltype (std::set<std::pair<long long int, long long int> >::const_iterator{((const std::set<std::pair<long long int, long long int> >*)this)->std::set<std::pair<long long int, long long int> >::_M_t.std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::_M_find_tr(__x)}) std::set<std::pair<long long int, long long int> >::find<_Kt>(const _Kt&) const [with _Kt = long long int]':
Aesthetic.cpp:17:26: required from here
/usr/include/c++/9/bits/stl_set.h:810:2: error: no matching function for call to 'std::_Rb_tree<std::pair<long long int, long long int>, std::pair<long long int, long long int>, std::_Identity<std::pair<long long int, long long int> >, std::less<std::pair<long long int, long long int> >, std::allocator<std::pair<long long int, long long int> > >::_M_find_tr(const long long int&) const'
In file included from /usr/include/c++/9/map:60,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:81,
from Aesthetic.cpp:1:
/usr/include/c++/9/bits/stl_tree.h:1306:2: note: candidate: 'template<class _Kt, class _Req> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_find_tr(const _Kt&) [with _Kt = _Kt; _Req = _Req; _Key = std::pair<long long int, long long int>; _Val = std::pair<long long int, long long int>; _KeyOfValue = std::_Identity<std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >]'
1306 | _M_find_tr(const _Kt& __k)
| ^~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:1306:2: note: template argument deduction/substitution failed:
/usr/include/c++/9/bits/stl_tree.h:1315:2: note: candidate: 'template<class _Kt, class _Req> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::const_iterator std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_find_tr(const _Kt&) const [with _Kt = _Kt; _Req = _Req; _Key = std::pair<long long int, long long int>; _Val = std::pair<long long int, long long int>; _KeyOfValue = std::_Identity<std::pair<long long int, long long int> >; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >]'
1315 | _M_find_tr(const _Kt& __k) const
| ^~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:1315:2: note: template argument deduction/substitution failed:
In file included from /usr/include/c++/9/set:61,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:87,
from Aesthetic.cpp:1:
/usr/include/c++/9/bits/stl_set.h:810:2: error: no matching function for call to 'std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >::_Rb_tree_const_iterator(<brace-enclosed initializer list>)'
810 | find(const _Kt& __x) const
| ^~~~
In file included from /usr/include/c++/9/map:60,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:81,
from Aesthetic.cpp:1:
/usr/include/c++/9/bits/stl_tree.h:348:7: note: candidate: 'std::_Rb_tree_const_iterator<_Tp>::_Rb_tree_const_iterator(const iterator&) [with _Tp = std::pair<long long int, long long int>; std::_Rb_tree_const_iterator<_Tp>::iterator = std::_Rb_tree_iterator<std::pair<long long int, long long int> >]'
348 | _Rb_tree_const_iterator(const iterator& __it) _GLIBCXX_NOEXCEPT
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:348:7: note: conversion of argument 1 would be ill-formed:
/usr/include/c++/9/bits/stl_tree.h:345:7: note: candidate: 'std::_Rb_tree_const_iterator<_Tp>::_Rb_tree_const_iterator(std::_Rb_tree_const_iterator<_Tp>::_Base_ptr) [with _Tp = std::pair<long long int, long long int>; std::_Rb_tree_const_iterator<_Tp>::_Base_ptr = const std::_Rb_tree_node_base*]'
345 | _Rb_tree_const_iterator(_Base_ptr __x) _GLIBCXX_NOEXCEPT
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:345:7: note: conversion of argument 1 would be ill-formed:
/usr/include/c++/9/bits/stl_tree.h:341:7: note: candidate: 'std::_Rb_tree_const_iterator<_Tp>::_Rb_tree_const_iterator() [with _Tp = std::pair<long long int, long long int>]'
341 | _Rb_tree_const_iterator() _GLIBCXX_NOEXCEPT
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:341:7: note: candidate expects 0 arguments, 1 provided
/usr/include/c++/9/bits/stl_tree.h:326:12: note: candidate: 'constexpr std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >::_Rb_tree_const_iterator(const std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >&)'
326 | struct _Rb_tree_const_iterator
| ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/9/bits/stl_tree.h:326:12: note: conversion of argument 1 would be ill-formed:
/usr/include/c++/9/bits/stl_tree.h:326:12: note: candidate: 'constexpr std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >::_Rb_tree_const_iterator(std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >&&)'
/usr/include/c++/9/bits/stl_tree.h:326:12: note: conversion of argument 1 would be ill-formed:
Aesthetic.cpp:19:33: error: no matching function for call to 'std::set<std::pair<long long int, long long int> >::insert(long long int&)'
19 | if(g[y] == 0) S.insert(u);
| ^
In file included from /usr/include/c++/9/set:61,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:87,
from Aesthetic.cpp:1:
/usr/include/c++/9/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 = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<long long int, long long int>]'
509 | insert(const value_type& __x)
| ^~~~~~
/usr/include/c++/9/bits/stl_set.h:509:32: note: no known conversion for argument 1 from 'long long int' to 'const value_type&' {aka 'const std::pair<long long int, long long int>&'}
509 | insert(const value_type& __x)
| ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/9/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 = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >; typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator = std::_Rb_tree_const_iterator<std::pair<long long int, long long int> >; std::set<_Key, _Compare, _Alloc>::value_type = std::pair<long long int, long long int>]'
518 | insert(value_type&& __x)
| ^~~~~~
/usr/include/c++/9/bits/stl_set.h:518:27: note: no known conversion for argument 1 from 'long long int' to 'std::set<std::pair<long long int, long long int> >::value_type&&' {aka 'std::pair<long long int, long long int>&&'}
518 | insert(value_type&& __x)
| ~~~~~~~~~~~~~^~~
/usr/include/c++/9/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 = std::pair<long long int, long long int>; _Compare = std::less<std::pair<long long int, long long int> >; _Alloc = std::allocator<std::pair<long long int, long long int> >; std::set<_Key, _Compare, _Alloc