제출 #1238290

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1238290		lhn	Birthday gift (IZhO18_treearray)	C++17	컴파일 에러	0 ms	0 KiB

treearray

#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
set<int> baolinh[200001];
set<int> bling[200001];
int st[4000001], a[200001], up[20][200001], h[200001];
void dfs(int u)
{
    for (int x : E[u])
    {
        if (up[0][u] == x) continue;
        up[0][x] = u;
        h[x] = h[u] + 1;
        for (int i = 1; i < 20; ++i)
        {
            up[i][x] = up[i - 1][up[i - 1][x]];
        }
        dfs(x);
    }
}
int lca(int u, int v)
{
    if (h[u] != h[v])
    {
        if (h[u] < h[v]) swap(u, v);
        int dis = h[u] - h[v];
        for (int i = 0; i < 20; ++i)
        {
            if (dis >> i & 1) u = up[i][u];
        }
    }
    if (u == v) return u;
    int k = __lg(h[u]);
    for (int i = k; i >= 0; --i)
    {
        if (up[i][u] != up[i][v])
        {
            u = up[i][u];
            v = up[i][v];
        }
    }
    return up[0][u];
}
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> q;
    for (int i = 1; i < n; ++i)
    {
        int u, v;
        cin >> u >> v;
        E[u].push_back(v);
        E[v].push_back(u);
    }
    dfs(1);
    for (int i = 1; i <= m; ++i)
    {
        cin >> a[i];
        bling[a[i]]. insert(i);
        if (i >= 2) baolinh[lca(a[i], a[i - 1])].insert(i);
    }
    while(q--)
    {
        int type, l, r, v;
        cin >> type >> l >> r;
        if (type == 1)
        {
            if (l >= 2) {baolinh[lca(a[l], a[l - 1])].erase(l); baolinh[lca(v, a[l - 1])].insert(l);}
            if (l != n) {baolinh[lca(a[l], a[i + 1])].erase(l + 1);baolinh[lca(v, a[l + 1])].insert(l + 1);}
            bling[a[l]].erase(l);
            bling[v].insert();
            
        }
        else 
        {
            cin >> v;
            int bl = *baolinh[v].upper_bound(l);
            if bl <
          
        }
    }
}

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

treearray.cpp: In function 'void dfs(long long int)':
treearray.cpp:10:18: error: 'E' was not declared in this scope
   10 |     for (int x : E[u])
      |                  ^
treearray.cpp: In function 'int32_t main()':
treearray.cpp:49:17: error: 'm' was not declared in this scope; did you mean 'tm'?
   49 |     cin >> n >> m >> q;
      |                 ^
      |                 tm
treearray.cpp:49:22: error: 'q' was not declared in this scope
   49 |     cin >> n >> m >> q;
      |                      ^
treearray.cpp:54:9: error: 'E' was not declared in this scope
   54 |         E[u].push_back(v);
      |         ^
treearray.cpp:71:46: error: 'i' was not declared in this scope
   71 |             if (l != n) {baolinh[lca(a[l], a[i + 1])].erase(l + 1);baolinh[lca(v, a[l + 1])].insert(l + 1);}
      |                                              ^
treearray.cpp:73:28: error: no matching function for call to 'std::set<long long int>::insert()'
   73 |             bling[v].insert();
      |             ~~~~~~~~~~~~~~~^~
In file included from /usr/include/c++/11/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:87,
                 from treearray.cpp:1:
/usr/include/c++/11/bits/stl_set.h:566:9: note: candidate: 'template<class _InputIterator> void std::set<_Key, _Compare, _Alloc>::insert(_InputIterator, _InputIterator) [with _InputIterator = _InputIterator; _Key = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>]'
  566 |         insert(_InputIterator __first, _InputIterator __last)
      |         ^~~~~~
/usr/include/c++/11/bits/stl_set.h:566:9: note:   template argument deduction/substitution failed:
treearray.cpp:73:28: note:   candidate expects 2 arguments, 0 provided
   73 |             bling[v].insert();
      |             ~~~~~~~~~~~~~~~^~
In file included from /usr/include/c++/11/set:61,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:87,
                 from treearray.cpp:1:
/usr/include/c++/11/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 = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<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<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::const_iterator; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other = std::allocator<long long int>; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key> = __gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::rebind<long long int>; typename _Alloc::value_type = long long int; std::set<_Key, _Compare, _Alloc>::value_type = long long int]'
  509 |       insert(const value_type& __x)
      |       ^~~~~~
/usr/include/c++/11/bits/stl_set.h:509:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/11/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 = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<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<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::const_iterator; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other = std::allocator<long long int>; typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key> = __gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::rebind<long long int>; typename _Alloc::value_type = long long int; std::set<_Key, _Compare, _Alloc>::value_type = long long int]'
  518 |       insert(value_type&& __x)
      |       ^~~~~~
/usr/include/c++/11/bits/stl_set.h:518:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/11/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 = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = long long int]'
  546 |       insert(const_iterator __position, const value_type& __x)
      |       ^~~~~~
/usr/include/c++/11/bits/stl_set.h:546:7: note:   candidate expects 2 arguments, 0 provided
/usr/include/c++/11/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 = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::const_iterator; std::set<_Key, _Compare, _Alloc>::value_type = long long int]'
  551 |       insert(const_iterator __position, value_type&& __x)
      |       ^~~~~~
/usr/include/c++/11/bits/stl_set.h:551:7: note:   candidate expects 2 arguments, 0 provided
/usr/include/c++/11/bits/stl_set.h:578:7: note: candidate: 'void std::set<_Key, _Compare, _Alloc>::insert(std::initializer_list<_Tp>) [with _Key = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>]'
  578 |       insert(initializer_list<value_type> __l)
      |       ^~~~~~
/usr/include/c++/11/bits/stl_set.h:578:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/11/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 = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>; std::set<_Key, _Compare, _Alloc>::insert_return_type = std::_Rb_tree<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::insert_return_type; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::node_type]'
  598 |       insert(node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/11/bits/stl_set.h:598:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/11/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 = long long int; _Compare = std::less<long long int>; _Alloc = std::allocator<long long int>; std::set<_Key, _Compare, _Alloc>::iterator = std::_Rb_tree<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::const_iterator; std::set<_Key, _Compare, _Alloc>::const_iterator = std::_Rb_tree<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::const_iterator; std::set<_Key, _Compare, _Alloc>::node_type = std::_Rb_tree<long long int, long long int, std::_Identity<long long int>, std::less<long long int>, std::allocator<long long int> >::node_type]'
  603 |       insert(const_iterator __hint, node_type&& __nh)
      |       ^~~~~~
/usr/include/c++/11/bits/stl_set.h:603:7: note:   candidate expects 2 arguments, 0 provided
treearray.cpp:80:16: error: expected '(' before 'bl'
   80 |             if bl <
      |                ^~
      |                (