제출 #726328

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
726328		Khizri	드문 곤충 (IOI22_insects)	C++17	53.13 / 100	237 ms	596 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
int sz,n;
set<int>ST;
bool check(int k){
    if(k==1) return true;
    set<int>st=ST,st2;
    if(!st.count(0)){
        move_inside(0);
        st.insert(0);
        st2.insert(0);
    }
    for(int i=1;i<n;i++){
        if(!st.count(i)){
            move_inside(i);
            st.insert(i);
            st2.insert(i);
            if(press_button()>k){
                st.erase(i);
                st2.erase(i);
                move_outside(i);
            }
        }
    }
    bool ok=false;
    if(st.size()==sz*k){
        ok=true;
    }
    while(st2.size()&&!ok){
        move_outside(*st2.begin());
        st.erase(*st2.begin());
        st2.erase(st2.begin());
    }
    ST=st;
    return ok;
}
int min_cardinality(int N) {
    n=N;
    set<int>st;
    move_inside(0);
    st.insert(0);
    for(int i=1;i<n;i++){
        move_inside(i);
        st.insert(i);
        if(press_button()>1){
            move_outside(i);
            st.erase(i);
        }
    }
    sz=st.size();
    while(st.size()){
        move_outside(*st.begin());
        st.erase(st.begin());
    }
    int l=1,r=n/sz+1;
    while(l<=r){
        int m=(l+r)/2;
        if(check(m)){
            l=m+1;
        }
        else{
            r=m-1;
        }
    }
    return l-1;
}

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

insects.cpp: In function 'bool check(int)':
insects.cpp:39:17: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   39 |     if(st.size()==sz*k){
      |        ~~~~~~~~~^~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 28.13 / 75