답안 #709852

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
709852	2023-03-14T17:06:55 Z	Cyanmond	늑대인간 (IOI18_werewolf)	C++17	컴파일 오류	0 ms	0 KB

werewolf

#include "werewolf.h"
#include <bits/stdc++.h>

struct UnionFind {
    int n;
    std::vector<int> data;
    UnionFind(int n_) : n(n_) {
        data.assign(n, -1);
    }

    int find(int v) {
        if (data[v] < 0) return v;
        else return data[v] = find(data[v]);
    }

    void merge(int a, int b) {
        a = find(a);
        b = find(b);
        if (a == b) return;
        if (data[a] > data[b]) std::swap(a, b);
        data[a] += data[b];
        data[b] = a;
    }
};

constexpr int inf = 1 << 30;

template <class M>
class SegmentTree {
    using T = typename M::T;
    int n, size;
    std::vector<T> data;

    void update(int i) {
        data[i] = M::op(data[2 * i], data[2 * i + 1]);
    }

    public:
    SegmentTree() {}
    SegmentTree(const std::vector<T> &vec) {
        n = (int)vec.size();
        size = 1;
        while (size < n) {
            size *= 2;
        }
        data.assign(2 * size, M::e());
        std::copy(vec.begin(), vec.end(), data.begin() + size);
        for (int i = size - 1; i >= 1; --i) update(i);
    }

    void set(int i, const T &v) {
        i += size;
        data[i] = v;
        while (i != 1) {
            i /= 2;
            update(i);
        }
    }

    T fold(int l, int r) {
        T pl = M::e(), pr = M::e();
        for (l += size, r += size; l < r; l /= 2, r /= 2) {
            if (l & 1) pl = M::op(pl, data[l++]);
            if (r & 1) pr = M::op(data[--r], pr);
        }
        return M::op(pl, pr);
    }

    int max_right(int l, int v) {
        int ok = N, ng = l;
        while (ok - ng > 1) {
            const auto mid = (ok + ng) / 2;
            if (fold(l, mid).second <= v) ng = mid;
            else ok = mid;
        }
        return ok;
    }

    int min_left(int r, int v) {
        int ok = -1, ng = r;
        while (ng - ok > 1) {
            const auto mid = (ok + ng) / 2;
            if (fold(mid, r) <= v) ng = mid;
            else ok = mid;
        }
        return ng;
    }
};

struct MonoidMinMax {
    using T = std::pair<int, int>;
    static T op(const T &a, const T &b) {
        return {std::min(a.first, b.first), std::max(a.second, b.second)};
    }
    static T e() {
        return {inf, -1};
    }
};

constexpr int B = 3;

std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y, std::vector<int> S,
                                std::vector<int> E, std::vector<int> L, std::vector<int> R) {
    const int M = (int)X.size();
    const int Q = (int)S.size();
    std::vector<int> answer(Q);

    std::vector<std::vector<int>> graph(N);
    for (int i = 0; i < M; ++i) {
        graph[X[i]].push_back(Y[i]);
        graph[Y[i]].push_back(X[i]);
    }
    int v = -1;
    for (int i = 0; i < N; ++i) {
        if (graph[i].size() == 1) {
            v = i;
        }
    }
    std::vector<int> id(N), rid(N);
    {
        int p = -1;
        int cnt = 0;
        while (true) {
            id[v] = cnt;
            rid[cnt] = v;
            ++cnt;
            int w = v;
            for (const int t : graph[v]) if (t != p) {
                v = t;
                p = v;
                break;
            }
            if (w == v) {
                break;
            }
        }
    }
    std::vector<std::pair<int, int>> vec(N);
    for (int i = 0; i < N; ++i) {
        vec[i] = {rid[i], rid[i]};
    }
    SegmentTree<MonoidMinMax> seg(vec);
    for (int i = 0; i < Q; ++i) {
        const int a = id[S[i]], b = id[E[i]];
        if (a < b) {
            const int x = seg.min_left(b + 1, R[i]);
            if (x <= a) {
                answer[i] = true;
            } else {
                if (seg.fold(a, x).first >= L[i]) answer[i] = true;
                else answer[i] = false;
            }
        } else {
            const int x = seg.max_right(b, R[i]);
            if (x >= a) {
                answer[i] = true;
            } else {
                if (seg.fold(x, a + 1).first >= L[i]) answer[i] = true;
                else answer[i] = false;
            }
        }
    }
    return answer;
}

Compilation message

werewolf.cpp: In member function 'int SegmentTree<M>::max_right(int, int)':
werewolf.cpp:70:18: error: 'N' was not declared in this scope
   70 |         int ok = N, ng = l;
      |                  ^
werewolf.cpp:71:21: error: 'ng' was not declared in this scope; did you mean 'n'?
   71 |         while (ok - ng > 1) {
      |                     ^~
      |                     n
werewolf.cpp: In instantiation of 'int SegmentTree<M>::min_left(int, int) [with M = MonoidMinMax]':
werewolf.cpp:146:51:   required from here
werewolf.cpp:83:30: error: no match for 'operator<=' (operand types are 'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} and 'int')
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from werewolf.cpp:2:
/usr/include/c++/10/bits/regex.h:1086:5: note: candidate: 'template<class _BiIter> bool std::__cxx11::operator<=(const std::__cxx11::sub_match<_BiIter>&, const std::__cxx11::sub_match<_BiIter>&)'
 1086 |     operator<=(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs)
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1086:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from werewolf.cpp:2:
/usr/include/c++/10/bits/regex.h:1192:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator<=(std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const std::__cxx11::sub_match<_BiIter>&)'
 1192 |     operator<=(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1192:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from werewolf.cpp:2:
/usr/include/c++/10/bits/regex.h:1285:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator<=(const std::__cxx11::sub_match<_BiIter>&, std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&)'
 1285 |     operator<=(const sub_match<_Bi_iter>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1285:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from werewolf.cpp:2:
/usr/include/c++/10/bits/regex.h:1359:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator<=(const typename std::iterator_traits<_Iter>::value_type*, const std::__cxx11::sub_match<_BiIter>&)'
 1359 |     operator<=(typename iterator_traits<_Bi_iter>::value_type const* __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1359:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   mismatched types 'const std::__cxx11::sub_match<_BiIter>' and 'int'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from werewolf.cpp:2:
/usr/include/c++/10/bits/regex.h:1453:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator<=(const std::__cxx11::sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type*)'
 1453 |     operator<=(const sub_match<_Bi_iter>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1453:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from werewolf.cpp:2:
/usr/include/c++/10/bits/regex.h:1531:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator<=(const typename std::iterator_traits<_Iter>::value_type&, const std::__cxx11::sub_match<_BiIter>&)'
 1531 |     operator<=(typename iterator_traits<_Bi_iter>::value_type const& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1531:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   mismatched types 'const std::__cxx11::sub_match<_BiIter>' and 'int'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/regex:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:110,
                 from werewolf.cpp:2:
/usr/include/c++/10/bits/regex.h:1631:5: note: candidate: 'template<class _Bi_iter> bool std::__cxx11::operator<=(const std::__cxx11::sub_match<_BiIter>&, const typename std::iterator_traits<_Iter>::value_type&)'
 1631 |     operator<=(const sub_match<_Bi_iter>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/regex.h:1631:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/vector:60,
                 from werewolf.h:3,
                 from werewolf.cpp:1:
/usr/include/c++/10/bits/stl_pair.h:508:5: note: candidate: 'template<class _T1, class _T2> constexpr bool std::operator<=(const std::pair<_T1, _T2>&, const std::pair<_T1, _T2>&)'
  508 |     operator<=(const pair<_T1, _T2>& __x, const pair<_T1, _T2>& __y)
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_pair.h:508:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   mismatched types 'const std::pair<_T1, _T2>' and 'int'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/bits/stl_algobase.h:67,
                 from /usr/include/c++/10/vector:60,
                 from werewolf.h:3,
                 from werewolf.cpp:1:
/usr/include/c++/10/bits/stl_iterator.h:384:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator<=(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_Iterator>&)'
  384 |     operator<=(const reverse_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_iterator.h:384:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'const std::reverse_iterator<_Iterator>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/bits/stl_algobase.h:67,
                 from /usr/include/c++/10/vector:60,
                 from werewolf.h:3,
                 from werewolf.cpp:1:
/usr/include/c++/10/bits/stl_iterator.h:422:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator<=(const std::reverse_iterator<_Iterator>&, const std::reverse_iterator<_IteratorR>&)'
  422 |     operator<=(const reverse_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_iterator.h:422:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'const std::reverse_iterator<_Iterator>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/bits/stl_algobase.h:67,
                 from /usr/include/c++/10/vector:60,
                 from werewolf.h:3,
                 from werewolf.cpp:1:
/usr/include/c++/10/bits/stl_iterator.h:1460:5: note: candidate: 'template<class _IteratorL, class _IteratorR> constexpr bool std::operator<=(const std::move_iterator<_IteratorL>&, const std::move_iterator<_IteratorR>&)'
 1460 |     operator<=(const move_iterator<_IteratorL>& __x,
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_iterator.h:1460:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'const std::move_iterator<_IteratorL>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/bits/stl_algobase.h:67,
                 from /usr/include/c++/10/vector:60,
                 from werewolf.h:3,
                 from werewolf.cpp:1:
/usr/include/c++/10/bits/stl_iterator.h:1513:5: note: candidate: 'template<class _Iterator> constexpr bool std::operator<=(const std::move_iterator<_IteratorL>&, const std::move_iterator<_IteratorL>&)'
 1513 |     operator<=(const move_iterator<_Iterator>& __x,
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_iterator.h:1513:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'const std::move_iterator<_IteratorL>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/vector:67,
                 from werewolf.h:3,
                 from werewolf.cpp:1:
/usr/include/c++/10/bits/stl_vector.h:1949:5: note: candidate: 'template<class _Tp, class _Alloc> bool std::operator<=(const std::vector<_Tp, _Alloc>&, const std::vector<_Tp, _Alloc>&)'
 1949 |     operator<=(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y)
      |     ^~~~~~~~
/usr/include/c++/10/bits/stl_vector.h:1949:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'const std::vector<_Tp, _Alloc>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/bits/basic_string.h:48,
                 from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from werewolf.cpp:2:
/usr/include/c++/10/string_view:582:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator<=(std::basic_string_view<_CharT, _Traits>, std::basic_string_view<_CharT, _Traits>)'
  582 |     operator<=(basic_string_view<_CharT, _Traits> __x,
      |     ^~~~~~~~
/usr/include/c++/10/string_view:582:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'std::pair<int, int>' is not derived from 'std::basic_string_view<_CharT, _Traits>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/bits/basic_string.h:48,
                 from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from werewolf.cpp:2:
/usr/include/c++/10/string_view:588:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator<=(std::basic_string_view<_CharT, _Traits>, std::__type_identity_t<std::basic_string_view<_CharT, _Traits> >)'
  588 |     operator<=(basic_string_view<_CharT, _Traits> __x,
      |     ^~~~~~~~
/usr/include/c++/10/string_view:588:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'std::pair<int, int>' is not derived from 'std::basic_string_view<_CharT, _Traits>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/bits/basic_string.h:48,
                 from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from werewolf.cpp:2:
/usr/include/c++/10/string_view:595:5: note: candidate: 'template<class _CharT, class _Traits> constexpr bool std::operator<=(std::__type_identity_t<std::basic_string_view<_CharT, _Traits> >, std::basic_string_view<_CharT, _Traits>)'
  595 |     operator<=(__type_identity_t<basic_string_view<_CharT, _Traits>> __x,
      |     ^~~~~~~~
/usr/include/c++/10/string_view:595:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   mismatched types 'std::basic_string_view<_CharT, _Traits>' and 'int'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from werewolf.cpp:2:
/usr/include/c++/10/bits/basic_string.h:6343:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> bool std::operator<=(const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>&, const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>&)'
 6343 |     operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/basic_string.h:6343:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from werewolf.cpp:2:
/usr/include/c++/10/bits/basic_string.h:6356:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> bool std::operator<=(const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>&, const _CharT*)'
 6356 |     operator<=(const basic_string<_CharT, _Traits, _Alloc>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/basic_string.h:6356:5: note:   template argument deduction/substitution failed:
werewolf.cpp:83:30: note:   'SegmentTree<MonoidMinMax>::T' {aka 'std::pair<int, int>'} is not derived from 'const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>'
   83 |             if (fold(mid, r) <= v) ng = mid;
      |                 ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/string:55,
                 from /usr/include/c++/10/bits/locale_classes.h:40,
                 from /usr/include/c++/10/bits/ios_base.h:41,
                 from /usr/include/c++/10/ios:42,
                 from /usr/include/c++/10/istream:38,
                 from /usr/include/c++/10/sstream:38,
                 from /usr/include/c++/10/complex:45,
                 from /usr/include/c++/10/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:54,
                 from werewolf.cpp:2:
/usr/include/c++/10/bits/basic_string.h:6368:5: note: candidate: 'template<class _CharT, class _Traits, class _Alloc> bool std::operator<=(const _CharT*, const std::__cxx11::basic_string<_CharT, _Traits, _Allocator>&)'
 6368 |     operator<=(const _CharT* __lhs,
      |     ^~~~~~~~
/usr/include/c++/10/bits/basic_string.h:6368:5: note:   template argument deduction/substitution failed:
werewolf