제출 #725675

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
725675		aykhn	드문 곤충 (IOI22_insects)	C++17	99.95 / 100	75 ms	428 KiB

insects

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

using namespace std;

typedef long long ll;

#define OPT ios_base::sync_with_stdio(0); \
            cin.tie(0); \
            cout.tie(0)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(v) v.begin(), v.end()
#define mpr make_pair
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define inf 0x3F3F3F3F
#define infll 0x3F3F3F3F3F3F3F3FLL
#define bpc __builtin_popcount
#define print(v) for(int i = 0; i < v.size(); i++) cout << v[i] << " "; cout<<endl;
/*
vector<int> type;
set<pii> s;

void move_inside(int i)
{
    auto it = s.lower_bound(mpr(type[i], -1));

    if (it == s.end() || (*it).fi != type[i]) s.insert(mpr(type[i], 1));
    else
    {
        pii y = *it;
        s.erase(it);
        s.insert(mpr(type[i], y.se + 1));
    }
}

void move_outside(int i)
{
    auto it = s.lower_bound(mpr(type[i], -1));

    if (it == s.end() || (*it).fi != type[i]) return;
    pii y = *it;
    s.erase(it);
    if (y.se > 1) s.insert(mpr(type[i], y.se - 1));
}

int press_button()
{
    int mx = 0;
    for (pii x : s)
    {
        mx = max(mx, x.se);
    }
    return mx;
}*/
int min_cardinality(int n)
{

    int sz = 0;

    vector<int> out;

    for (int i = 0; i < n; i++)
    {
        move_inside(i);
        int x = press_button();
        if (x > 1)
        {
            move_outside(i);
            out.pb(i);
        }
        else sz++;
    }

    int best = 1;
    int rn = sz;
    int l = 2;
    int r = n/sz;

    while (l <= r)
    {
        int mid = (l + r) >> 1;
        vector<int> temp;
        vector<int> nout;

        for (int i = 0; i < out.size(); i++)
        {
            move_inside(out[i]);
            int x = press_button();
            if (x > mid)
            {
                nout.pb(out[i]);
                move_outside(out[i]);
            }
            else
            {
                rn++;
                temp.pb(out[i]);
            }
            if (rn == mid * sz)
            { // fill out to next out (nout)
                for (int j = i + 1; j < out.size(); j++) nout.pb(out[j]);
                break;
            }
        }
 // if true, previous elements not needed
 // current elements not needed ?? yes
 // (*) extras not needed if min is already lower <- important

        if (rn == mid * sz)
        {
            best = max(best, mid);
            l = mid + 1;
            out = nout;
        }
        else
        {
            r = mid - 1;
            for (int x : temp)
            {
                move_outside(x);
                rn--;
            }
            out = temp; // (*) <-
        }
    }

    return best;
}


/*int main()
{
    int n;
    cin >> n;

    type.assign(n, 0);

    for (int i = 0; i < n; i++)
    {
        cin >> type[i];
    }

    cout << min_cardinality(n);

}
*/

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

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:89:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for (int i = 0; i < out.size(); i++)
      |                         ~~^~~~~~~~~~~~
insects.cpp:105:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |                 for (int j = i + 1; j < out.size(); j++) nout.pb(out[j]);
      |                                     ~~^~~~~~~~~~~~

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