oj.uz

Submission #627634

# Submission time Handle Problem Language Result Execution time Memory
627634 2022-08-12T17:49:15 Z I_love_Hoang_Yen Rarest Insects (IOI22_insects) C++17
0 / 100
 50 ms 340 KB 
#include "insects.h"
#include "bits/stdc++.h"
#define SZ(s) ((int) s.size())
using namespace std;

#ifndef RR
#define DEBUG(X)
#endif

/* sub1
// Sub 1 {{{
int min_cardinality(int n) {
    std::vector<int> v_ids(n);
    std::iota(v_ids.begin(), v_ids.end(), 0);

    std::set<int> ids(v_ids.begin(), v_ids.end());
    int freq = 0, last_cnt = 0;

    while (true) {
        ++freq;
        std::set<int> new_ids;

        for (int id : ids) {
            move_inside(id);
            if (press_button() > freq) {
                move_outside(id);
                new_ids.insert(id);
            }
        }

        int unique_values = SZ(ids) - SZ(new_ids);
        if (unique_values < last_cnt) {
            return freq - 1;
        }
        last_cnt = unique_values;

        if (unique_values > SZ(new_ids)) {
            return freq;
        }

        ids = std::move(new_ids);
    }

    return 0;
}
// }}}
*/

// seeds = set containing unique indices
int solve_small(int n, const std::set<int>& seeds) {
    std::set<int> used;
    int res = n;

    int n_unique = SZ(seeds);
    for (int turn = 0; turn + 1 < n_unique; ++turn) {
        std::set<int> cur;

        for (int i = 0; i < n; ++i) {
            if (!seeds.count(i) && !used.count(i)) {
                cur.insert(i);
                move_inside(i);

                if (press_button() != SZ(cur) + 1) {
                    move_outside(i);
                    cur.erase(i);
                }
            }
        }

        used.insert(cur.begin(), cur.end());
        res = std::min(res, SZ(cur) + 1);

        for (int i : cur) move_outside(i);
    }

    int remaining = n - SZ(used) - SZ(seeds) + 1;
    res = std::min(res, remaining);

    return res;
}

int min_cardinality(int n) {
    std::set<int> insides;
    int freq = 1;

    auto add = [&] (int i) {
        insides.insert(i);
        move_inside(i);
    };
    auto remove = [&] (int i) {
        insides.erase(i);
        move_outside(i);
    };

    for (int i = 0; i < n; ++i) {
        add(i);
        if (press_button() > 1) {
            remove(i);
        }
    }
    int unique_vals = SZ(insides);
    DEBUG(unique_vals);

    if (unique_vals <= 5) {
        return solve_small(n, insides);
    }

    int l = 2, r = n / unique_vals - 1, res = 1;
    while (l <= r) {
        int mid = l + (r - l + 1) / 2;

        assert(mid != freq);
        if (mid > freq) {
            for (int i = 0; i < n; ++i) {
                if (!insides.count(i)) {
                    add(i);
                    if (press_button() > mid) {
                        remove(i);
                    }
                }
            }
        } else {
            auto ids = insides;
            for (int id : ids) remove(id);

            for (int i : ids) {
                add(i);
                if (press_button() > mid) {
                    remove(i);
                }
            }
        }
        freq = mid;
        int total = SZ(insides);

        if (total >= unique_vals * mid) {
            // all values have at least frequency = mid
            res = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
        }
    }
    return res;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 280 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Incorrect 9 ms 208 KB Wrong answer.
9 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 280 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Incorrect 9 ms 208 KB Wrong answer.
9 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 21 ms 208 KB Output is correct
8 Correct 15 ms 332 KB Output is correct
9 Incorrect 50 ms 340 KB Wrong answer.
10 Halted 0 ms 0 KB -