oj.uz

Submission #971092

# Submission time Handle Problem Language Result Execution time Memory
971092 2024-04-28T00:35:37 Z maksim1744 Rarest Insects (IOI22_insects) C++17
99.79 / 100
 38 ms 1700 KB 
/*
    author:  Maksim1744
    created: 28.04.2024 03:07:13
*/

#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ld = long double;

#define mp   make_pair
#define pb   push_back
#define eb   emplace_back

#define sum(a)     ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a)    (*min_element((a).begin(), (a).end()))
#define maxe(a)    (*max_element((a).begin(), (a).end()))
#define mini(a)    ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a)    ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())

template<typename T>             vector<T>& operator--            (vector<T> &v){for (auto& i : v) --i;            return  v;}
template<typename T>             vector<T>& operator++            (vector<T> &v){for (auto& i : v) ++i;            return  v;}
template<typename T>             istream& operator>>(istream& is,  vector<T> &v){for (auto& i : v) is >> i;        return is;}
template<typename T>             ostream& operator<<(ostream& os,  vector<T>  v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> pair<T,U>& operator--           (pair<T, U> &p){--p.first; --p.second;            return  p;}
template<typename T, typename U> pair<T,U>& operator++           (pair<T, U> &p){++p.first; ++p.second;            return  p;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U> &p){is >> p.first >> p.second;        return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>  p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}

#ifdef HOME
#define SHOW_COLORS
#include "/mnt/c/Libs/tools/print.cpp"
#else
#define show(...) void(0)
#define debugf(fun)   fun
#define debugv(var)   var
#define mclock    void(0)
#define shows     void(0)
#define debug  if (false)
#define OSTREAM(...)    ;
#define OSTREAM0(...)   ;
#endif

void move_inside(int i);
void move_outside(int i);
int press_button();

#ifdef HOUSE
set<int> cur;
vector<int> col;
array<int, 3> que;

void move_inside(int i) {
    ++que[0];
    cur.insert(i);
}

void move_outside(int i) {
    ++que[1];
    cur.erase(i);
}

int press_button() {
    ++que[2];
    map<int, int> u;
    for (int i : cur)
        u[col[i]]++;
    int ans = 0;
    for (auto [a, b] : u)
        ans = max(ans, b);
    return ans;
}
#endif

int min_cardinality(int n) {
    set<int> cur;
    auto add = [&](int i) {
        if (cur.count(i)) return;
        cur.insert(i);
        move_inside(i);
    };
    auto rem = [&](int i) {
        if (!cur.count(i)) return;
        cur.erase(i);
        move_outside(i);
    };
    auto ask = [&]() -> int {
        if (cur.size() <= 1) return cur.size();
        return press_button();
    };
    auto clear = [&]() {
        while (!cur.empty())
            rem(*cur.begin());
    };

    for (int i = 0; i < n; ++i) {
        add(i);
        if (ask() > 1) {
            rem(i);
        }
    }
    if (cur.size() == n) return 1;
    int dif = cur.size();
    set<int> left;
    for (int i = 0; i < n; ++i) {
        left.insert(i);
    }

    int L = 1, R = 1;
    while (R * cur.size() <= n) ++R;
    int m = 0;
    while (R - L > 1) {
        int C = (L + R + 0) / 2;
        while (C <= L) ++C;
        while (C >= R) --C;
        int cleft = left.size();
        for (int i : left) {
            add(i);
            if (ask() > C - m)
                rem(i);
            --cleft;
            if (cur.size() + cleft < (C - m) * dif) {
                for (int u : left)
                    if (u > i)
                        cur.insert(u);
                break;
            }
        }
        if (cur.size() == (C - m) * dif) {
            for (int i : cur)
                left.erase(i);
            clear();
            L = C;
            m = L;
        } else {
            // for (int i = 0; i < n; ++i) {
            //     if (!cur.count(i))
            //         left.erase(i);
            // }
            left = cur;
            clear();
            R = C;
        }
    }
    return L;
}

#ifdef HOUSE
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(3294793);
ll rnd (ll l, ll r) { return (ll)(rng() % (r - l + 1)) + l; }
ll rnd (ll r)       { return rng() % r; }
ll rnd ()           { return rng(); }
ld rndf()           { return (ld)rng() / (ld)ULLONG_MAX; }
ld rndf(ld l, ld r) { return rndf() * (r - l) + l; }

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);

    int mxq = 0;
    int T = 100000;
    int n = 2000;
    while (T--) {
        int C = rnd(1, n);
        // int C = rnd(1, n);
        cur.clear();
        col.resize(n);
        for (int i = 0; i < n; ++i)
            col[i] = rnd(C);
        que.fill(0);

        int ans = 1e9;
        map<int, int> m;
        for (int i : col)
            m[i]++;
        for (auto [a, b] : m)
            ans = min(ans, b);
        int x = min_cardinality(n);
        // cerr <<  "ans=" << ans << " out=" << x << endl;
        // cerr << "que: ";
        // for (int x : que)
        //     cerr << x << ' ';
        // cerr << endl;
        // cerr << fixed << setprecision(3) << (ld)maxe(que) / n << endl;
        show(m);
        assert(ans == x);
        // assert(maxe(que) <= n * 3);
        mxq = max(mxq, maxe(que));
        cerr << "mxq: " << maxe(que) << " " << (ld)mxq / n << ' ' << "C=" << C << endl;
        assert(mxq <= n * 3);
    }

    return 0;
}
#endif

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:110:20: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  110 |     if (cur.size() == n) return 1;
      |         ~~~~~~~~~~~^~~~
insects.cpp:118:27: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  118 |     while (R * cur.size() <= n) ++R;
      |            ~~~~~~~~~~~~~~~^~~~
insects.cpp:130:36: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  130 |             if (cur.size() + cleft < (C - m) * dif) {
      |                 ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
insects.cpp:137:24: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  137 |         if (cur.size() == (C - m) * dif) {
      |             ~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 3 ms 448 KB Output is correct
15 Correct 3 ms 856 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 432 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 2 ms 856 KB Output is correct
22 Correct 1 ms 344 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 3 ms 344 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 3 ms 600 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 3 ms 600 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 3 ms 448 KB Output is correct
15 Correct 3 ms 856 KB Output is correct
16 Correct 3 ms 344 KB Output is correct
17 Correct 3 ms 432 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 2 ms 856 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 14 ms 940 KB Output is correct
24 Correct 5 ms 1208 KB Output is correct
25 Correct 13 ms 660 KB Output is correct
26 Correct 13 ms 916 KB Output is correct
27 Correct 12 ms 856 KB Output is correct
28 Correct 5 ms 852 KB Output is correct
29 Correct 12 ms 1164 KB Output is correct
30 Correct 19 ms 852 KB Output is correct
31 Correct 13 ms 600 KB Output is correct
32 Correct 15 ms 856 KB Output is correct
33 Correct 14 ms 852 KB Output is correct
34 Correct 15 ms 344 KB Output is correct
35 Correct 12 ms 856 KB Output is correct
36 Correct 14 ms 856 KB Output is correct
37 Correct 12 ms 856 KB Output is correct
38 Correct 11 ms 856 KB Output is correct
39 Correct 12 ms 856 KB Output is correct
40 Correct 11 ms 600 KB Output is correct
41 Correct 5 ms 856 KB Output is correct

Subtask #3
74.79 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 35 ms 1228 KB Output is correct
8 Correct 10 ms 600 KB Output is correct
9 Correct 29 ms 592 KB Output is correct
10 Correct 25 ms 1316 KB Output is correct
11 Correct 30 ms 528 KB Output is correct
12 Correct 16 ms 864 KB Output is correct
13 Partially correct 27 ms 968 KB Output is partially correct
14 Correct 32 ms 1112 KB Output is correct
15 Correct 34 ms 848 KB Output is correct
16 Correct 32 ms 812 KB Output is correct
17 Correct 27 ms 960 KB Output is correct
18 Correct 30 ms 1188 KB Output is correct
19 Partially correct 33 ms 1468 KB Output is partially correct
20 Correct 30 ms 600 KB Output is correct
21 Correct 29 ms 980 KB Output is correct
22 Partially correct 33 ms 1616 KB Output is partially correct
23 Correct 25 ms 600 KB Output is correct
24 Correct 23 ms 1700 KB Output is correct
25 Correct 17 ms 1464 KB Output is correct
26 Correct 11 ms 856 KB Output is correct
27 Correct 30 ms 436 KB Output is correct
28 Correct 27 ms 1204 KB Output is correct
29 Partially correct 30 ms 684 KB Output is partially correct
30 Partially correct 27 ms 804 KB Output is partially correct
31 Correct 25 ms 1200 KB Output is correct
32 Correct 29 ms 1104 KB Output is correct
33 Correct 38 ms 964 KB Output is correct
34 Correct 31 ms 944 KB Output is correct
35 Partially correct 25 ms 1104 KB Output is partially correct
36 Partially correct 34 ms 1440 KB Output is partially correct
37 Correct 35 ms 1208 KB Output is correct
38 Correct 28 ms 1040 KB Output is correct
39 Correct 30 ms 960 KB Output is correct
40 Correct 32 ms 1036 KB Output is correct
41 Partially correct 28 ms 856 KB Output is partially correct
42 Partially correct 28 ms 1104 KB Output is partially correct
43 Correct 6 ms 600 KB Output is correct
44 Partially correct 23 ms 1104 KB Output is partially correct
45 Correct 28 ms 1020 KB Output is correct
46 Correct 14 ms 856 KB Output is correct
47 Correct 18 ms 848 KB Output is correct
48 Correct 14 ms 716 KB Output is correct