Submission #725655

#	Time	Username	Problem	Language	Result	Execution time	Memory
725655		aykhn	Rarest Insects (IOI22_insects)	C++17	53.16 / 100	187 ms	336 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;
 
int min_cardinality(int n)
{
 
    int sz = 0;
 
    vector<bool> mark(n, 0);
 
    for (int i = 0; i < n; i++)
    {
        move_inside(i);
        int x = press_button();
        if (x > 1) move_outside(i);
        else
        {
            sz++;
            mark[i] = true;
        }
    }
 
    int best = 1;
    int rn = sz;
    int l = 2;
    int r = n/sz;
 
    while (l <= r)
    {
        int mid = (l + r) >> 1;
        vector<int> temp;
 
        int bfr = rn;
        for (int i = 0; i < n; i++)
        {
            if (mark[i]) continue;
            move_inside(i);
            int x = press_button();
            if (x > mid) move_outside(i);
            else
            {
                rn++;
                mark[i] = true;
                temp.pb(i);
            }
            if (rn == mid * sz) break;
        }
 
        if (rn == mid * sz)
        {
            best = max(best, mid);
            l = mid + 1;
        }
        else
        {
            r = mid - 1;
            for (int x : temp)
            {
                mark[x] = false;
                rn--;
              	move_outside(x);
            }
        }
    }
 
    return best;
}

Compilation message (stderr)

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:53:13: warning: unused variable 'bfr' [-Wunused-variable]
   53 |         int bfr = rn;
      |             ^~~

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