QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#257307	#7749. A Simple MST Problem	ucup-team2379	Compile Error	/	/	C++14	2.5kb	2023-11-19 02:16:18	2023-11-19 02:16:18
Due to the privacy settings of the submitter, you are not allowed to view this code.
詳細信息

answer.code: In member function ‘std::vector<int> dsu::leaders()’:
answer.code:40:5: warning: no return statement in function returning non-void [-Wreturn-type]
   40 |     }
      |     ^
answer.code: In function ‘void solve()’:
answer.code:74:47: error: ‘gcd’ was not declared in this scope
   74 |             pq.push({-omega[i]-omega[j]+omega[gcd(i,j)],i,j});
      |                                               ^~~
answer.code:74:20: error: no matching function for call to ‘std::priority_queue<std::tuple<long long int, long long int, long long int> >::push(<brace-enclosed initializer list>)’
   74 |             pq.push({-omega[i]-omega[j]+omega[gcd(i,j)],i,j});
      |             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/11/queue:64,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:86,
                 from answer.code:1:
/usr/include/c++/11/bits/stl_queue.h:640:7: note: candidate: ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::tuple<long long int, long long int, long long int>; _Sequence = std::vector<std::tuple<long long int, long long int, long long int>, std::allocator<std::tuple<long long int, long long int, long long int> > >; _Compare = std::less<std::tuple<long long int, long long int, long long int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::tuple<long long int, long long int, long long int>]’
  640 |       push(const value_type& __x)
      |       ^~~~
/usr/include/c++/11/bits/stl_queue.h:640:30: note:   no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘const value_type&’ {aka ‘const std::tuple<long long int, long long int, long long int>&’}
  640 |       push(const value_type& __x)
      |            ~~~~~~~~~~~~~~~~~~^~~
/usr/include/c++/11/bits/stl_queue.h:648:7: note: candidate: ‘void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::tuple<long long int, long long int, long long int>; _Sequence = std::vector<std::tuple<long long int, long long int, long long int>, std::allocator<std::tuple<long long int, long long int, long long int> > >; _Compare = std::less<std::tuple<long long int, long long int, long long int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::tuple<long long int, long long int, long long int>]’
  648 |       push(value_type&& __x)
      |       ^~~~
/usr/include/c++/11/bits/stl_queue.h:648:25: note:   no known conversion for argument 1 from ‘<brace-enclosed initializer list>’ to ‘std::priority_queue<std::tuple<long long int, long long int, long long int> >::value_type&&’ {aka ‘std::tuple<long long int, long long int, long long int>&&’}
  648 |       push(value_type&& __x)
      |            ~~~~~~~~~~~~~^~~
answer.code:77:17: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’
   77 |             auto[x,y,z]=pq.top();
      |                 ^