제출 #1141867

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1141867		JelalTkm	Hidden Sequence (info1cup18_hidden)	C++20	컴파일 에러	0 ms	0 KiB

hidden

#include <bits/stdc++.h>
#include "grader.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

using namespace std;

// #define int long long int

const int N = 1e3 + 100;
const int md = 1e9 + 7;
const int INF = 1e18;

vector<int> findSequence(int n) {
  priority_queue<pair<int, vector<int>>> q;
  vector<int> a;
  q.push({0, a});
  while (!q.empty()) {
    auto [u, v] = q.top();
    if (u == n)
      return v;
    q.pop();
    vector<int> v1 = v;
    v1.push_back(1);
    if (isSubsequence(v1)) {
      q.push(u + 1, v1);
    }
    v1.pop_back();
    v1.push_back(0);
    if (isSubsequence(v1)) {
      q.push(u + 1, v1);
    }
  }

  return {};
}

// int32_t main(int32_t argc, char *argv[]) {
//   ios::sync_with_stdio(false);
//   cin.tie(nullptr);

//   int T = 1;
//   // cin >> T;
//   while (T--) {

//   }
//   return 0;
// }

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

hidden.cpp:12:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   12 | const int INF = 1e18;
      |                 ^~~~
hidden.cpp: In function 'std::vector<int> findSequence(int)':
hidden.cpp:26:13: error: no matching function for call to 'std::priority_queue<std::pair<int, std::vector<int> > >::push(std::tuple_element<0, std::pair<int, std::vector<int> > >::type, std::vector<int>&)'
   26 |       q.push(u + 1, v1);
      |       ~~~~~~^~~~~~~~~~~
In file included from /usr/include/c++/11/queue:64,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:86,
                 from hidden.cpp: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::pair<int, std::vector<int> >; _Sequence = std::vector<std::pair<int, std::vector<int> >, std::allocator<std::pair<int, std::vector<int> > > >; _Compare = std::less<std::pair<int, std::vector<int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, std::vector<int> >]'
  640 |       push(const value_type& __x)
      |       ^~~~
/usr/include/c++/11/bits/stl_queue.h:640:7: note:   candidate expects 1 argument, 2 provided
/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::pair<int, std::vector<int> >; _Sequence = std::vector<std::pair<int, std::vector<int> >, std::allocator<std::pair<int, std::vector<int> > > >; _Compare = std::less<std::pair<int, std::vector<int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, std::vector<int> >]'
  648 |       push(value_type&& __x)
      |       ^~~~
/usr/include/c++/11/bits/stl_queue.h:648:7: note:   candidate expects 1 argument, 2 provided
hidden.cpp:31:13: error: no matching function for call to 'std::priority_queue<std::pair<int, std::vector<int> > >::push(std::tuple_element<0, std::pair<int, std::vector<int> > >::type, std::vector<int>&)'
   31 |       q.push(u + 1, v1);
      |       ~~~~~~^~~~~~~~~~~
In file included from /usr/include/c++/11/queue:64,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:86,
                 from hidden.cpp: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::pair<int, std::vector<int> >; _Sequence = std::vector<std::pair<int, std::vector<int> >, std::allocator<std::pair<int, std::vector<int> > > >; _Compare = std::less<std::pair<int, std::vector<int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, std::vector<int> >]'
  640 |       push(const value_type& __x)
      |       ^~~~
/usr/include/c++/11/bits/stl_queue.h:640:7: note:   candidate expects 1 argument, 2 provided
/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::pair<int, std::vector<int> >; _Sequence = std::vector<std::pair<int, std::vector<int> >, std::allocator<std::pair<int, std::vector<int> > > >; _Compare = std::less<std::pair<int, std::vector<int> > >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, std::vector<int> >]'
  648 |       push(value_type&& __x)
      |       ^~~~
/usr/include/c++/11/bits/stl_queue.h:648:7: note:   candidate expects 1 argument, 2 provided
grader.cpp: In function 'int main()':
grader.cpp:28:26: warning: format '%d' expects argument of type 'int', but argument 3 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
   28 |     fprintf (fifo_out, "%d\n", ans.size ());
      |                         ~^     ~~~~~~~~~~~
      |                          |              |
      |                          int            std::vector<int>::size_type {aka long unsigned int}
      |                         %ld