oj.uz

Submission #627839

# Submission time Handle Problem Language Result Execution time Memory
627839 2022-08-13T00:04:14 Z tutis Rarest Insects (IOI22_insects) C++17
0 / 100
 1 ms 208 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(vector<int> x)
{
    int add2 = 0;
    int add1 = 0;
    vector<int>y;
    auto cnt = [&](int c)->int
    {
        vector<int>v;
        y = {};
        for (int i : x)
        {
            v.push_back(i);
            move_inside(i);
            int k = press_button();
            if (k + add1 == c + 1)
            {
                v.pop_back();
                move_outside(i);
                y.push_back(i);
            }
        }
        int r = v.size();
        for (int i : v)
            move_outside(i);
        return add2 + r;
    };
    int c = cnt(1);
    {
        x = y;
        add2 = c;
        add1 = 1;
    }
    int lo = 1;
    int hi = (int)x.size();
    while (lo < hi)
    {
        int m = (lo + hi + 1) / 2;
        int k = cnt(m);
        if (k == m * c)
        {
            lo = m;
            // x = y;
            // add2 = m * c;
            // add1 = m;
        }
        else
            hi = m - 1;
    }
    return lo;
}
int min_cardinality(int N) {
    vector<int>v;
    for (int i = 0; i < N; i++)
        v.push_back(i);
    return min_cardinality(v);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 208 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Incorrect 0 ms 208 KB Wrong answer.
3 Halted 0 ms 0 KB -