oj.uz

답안 #971091

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971091 2024-04-28T00:33:47 Z maksim1744 드문 곤충 (IOI22_insects) C++17
98.55 / 100
 35 ms 1636 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 + 1) / 2;
        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:128:36: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  128 |             if (cur.size() + cleft < (C - m) * dif) {
      |                 ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
insects.cpp:135:24: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  135 |         if (cur.size() == (C - m) * dif) {
      |             ~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 3 ms 440 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 432 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 3 ms 852 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 3 ms 440 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 3 ms 600 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 432 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 3 ms 852 KB Output is correct
15 Correct 3 ms 600 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 600 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 3 ms 600 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 18 ms 856 KB Output is correct
24 Correct 4 ms 600 KB Output is correct
25 Correct 15 ms 948 KB Output is correct
26 Correct 12 ms 856 KB Output is correct
27 Correct 12 ms 852 KB Output is correct
28 Correct 4 ms 856 KB Output is correct
29 Correct 13 ms 664 KB Output is correct
30 Correct 13 ms 660 KB Output is correct
31 Correct 13 ms 856 KB Output is correct
32 Correct 14 ms 680 KB Output is correct
33 Correct 12 ms 600 KB Output is correct
34 Correct 14 ms 600 KB Output is correct
35 Correct 13 ms 924 KB Output is correct
36 Correct 13 ms 856 KB Output is correct
37 Correct 14 ms 1112 KB Output is correct
38 Correct 16 ms 1104 KB Output is correct
39 Correct 15 ms 600 KB Output is correct
40 Correct 10 ms 856 KB Output is correct
41 Correct 5 ms 712 KB Output is correct

Subtask #3
73.55 / 75.0

# 결과 실행 시간 메모리 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 33 ms 936 KB Output is correct
8 Correct 11 ms 1376 KB Output is correct
9 Correct 27 ms 892 KB Output is correct
10 Correct 28 ms 1104 KB Output is correct
11 Partially correct 24 ms 692 KB Output is partially correct
12 Correct 14 ms 600 KB Output is correct
13 Partially correct 29 ms 1204 KB Output is partially correct
14 Partially correct 31 ms 972 KB Output is partially correct
15 Correct 27 ms 1108 KB Output is correct
16 Correct 27 ms 1204 KB Output is correct
17 Correct 27 ms 1204 KB Output is correct
18 Correct 31 ms 948 KB Output is correct
19 Correct 25 ms 1196 KB Output is correct
20 Correct 32 ms 1208 KB Output is correct
21 Correct 29 ms 952 KB Output is correct
22 Correct 23 ms 800 KB Output is correct
23 Partially correct 26 ms 1128 KB Output is partially correct
24 Correct 23 ms 600 KB Output is correct
25 Correct 16 ms 1068 KB Output is correct
26 Correct 10 ms 1636 KB Output is correct
27 Correct 24 ms 920 KB Output is correct
28 Correct 24 ms 928 KB Output is correct
29 Correct 33 ms 672 KB Output is correct
30 Correct 32 ms 684 KB Output is correct
31 Correct 28 ms 1200 KB Output is correct
32 Correct 31 ms 856 KB Output is correct
33 Partially correct 35 ms 1460 KB Output is partially correct
34 Partially correct 35 ms 676 KB Output is partially correct
35 Correct 26 ms 1120 KB Output is correct
36 Correct 28 ms 1616 KB Output is correct
37 Correct 27 ms 1112 KB Output is correct
38 Correct 32 ms 1292 KB Output is correct
39 Correct 25 ms 1628 KB Output is correct
40 Correct 28 ms 1048 KB Output is correct
41 Correct 28 ms 1028 KB Output is correct
42 Correct 24 ms 696 KB Output is correct
43 Partially correct 8 ms 856 KB Output is partially correct
44 Partially correct 21 ms 848 KB Output is partially correct
45 Correct 33 ms 888 KB Output is correct
46 Correct 15 ms 936 KB Output is correct
47 Correct 18 ms 1112 KB Output is correct
48 Correct 16 ms 736 KB Output is correct