제출 #1353964

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1353964		ChottuF	드문 곤충 (IOI22_insects)	C++20	컴파일 에러	0 ms	0 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

int min_cardinality(int N) {
    set<int> inside, active;
    int U = 0;
    
    for (int i = 0; i<N; i++){
        active.insert(i);
    }
    vector<int> fnd;
    for (auto u : active){
        move_inside(u);
        int x = press_button();
        if (x > 1) move_outside(u);
        else fnd.push_back(u);
    }
    U = fnd.size();
    sort(fnd.begin(), fnd.end());
    for (auto u : fnd) active.erase(u);
    
    int lo = 1;
    int hi = N/U;

    int tot = U;    
    while (lo < hi){
        hi = min(hi, lo + (active.size()/U));
        if (lo == hi) break;
        
        int mid = (lo+hi+1)/2;
        fnd.clear();
        for (auto u : active){
            move_inside(u);
            int x = press_button();
            if (x > mid) move_outside(u);
            else{
                fnd.push_back(u);
                tot++;
            }
            if (tot == mid * U) break;
        }
        if (tot == mid * U){
            lo = mid;
            for (auto u : fnd) active.erase(u);
        }
        else if (tot < mid * U){
            hi = mid-1;
            active.clear();
            for (auto u : fnd){
                active.insert(u);
                move_outside(u);
                tot--;
            }
        }
    }
    return lo;
}

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

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:28:17: error: no matching function for call to 'min(int&, std::set<int>::size_type)'
   28 |         hi = min(hi, lo + (active.size()/U));
      |              ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from insects.cpp:2:
/usr/include/c++/13/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
insects.cpp:28:17: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'std::set<int>::size_type' {aka 'long unsigned int'})
   28 |         hi = min(hi, lo + (active.size()/U));
      |              ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:281:5: note:   template argument deduction/substitution failed:
insects.cpp:28:17: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'std::set<int>::size_type' {aka 'long unsigned int'})
   28 |         hi = min(hi, lo + (active.size()/U));
      |              ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61:
/usr/include/c++/13/bits/stl_algo.h:5775:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5775 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5775:5: note:   template argument deduction/substitution failed:
insects.cpp:28:17: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   28 |         hi = min(hi, lo + (active.size()/U));
      |              ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5785:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5785 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5785:5: note:   template argument deduction/substitution failed:
insects.cpp:28:17: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   28 |         hi = min(hi, lo + (active.size()/U));
      |              ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~