oj.uz

Submission #726381

# Submission time Handle Problem Language Result Execution time Memory
726381 2023-04-18T19:50:57 Z aykhn Rarest Insects (IOI22_insects) C++17
100 / 100
 57 ms 428 KB 
#include <bits/stdc++.h>
#include "insects.h"

using namespace std;

typedef long long ll;

void mn(vector<int> &v)
{
    random_shuffle(v.begin(), v.end());
}

#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;
/*
vector<int> type;
set<pii> s;

void move_inside(int i)
{
    auto it = s.lower_bound(mpr(type[i], -1));

    if (it == s.end() || (*it).fi != type[i]) s.insert(mpr(type[i], 1));
    else
    {
        pii y = *it;
        s.erase(it);
        s.insert(mpr(type[i], y.se + 1));
    }
}

void move_outside(int i)
{
    auto it = s.lower_bound(mpr(type[i], -1));

    if (it == s.end() || (*it).fi != type[i]) return;
    pii y = *it;
    s.erase(it);
    if (y.se > 1) s.insert(mpr(type[i], y.se - 1));
}



int press_button()
{
    int mx = 0;
    for (pii x : s)
    {
        mx = max(mx, x.se);
    }
    return mx;
}
int it1, it2, it3;*/
int min_cardinality(int n)
{

    int sz = 0;

    vector<int> out;

    for (int i = 0; i < n; i++)
    {
        move_inside(i);
        int x = press_button();
        if (x > 1)
        {
            move_outside(i);
            out.pb(i);
        }
        else sz++;
    }

    if (sz == 1) return n;
    else if (sz == n) return 1;

    int best = 1;
    int rn = sz;
    int l = 2;
    int r = n/sz;

    while (l <= r)
    {
        int mid = (l + r) >> 1;
        vector<int> temp;
        vector<int> nout;

        mn(out);

        for (int i = 0; i < out.size(); i++)
        {
            if (rn == mid * sz)
            { // fill out to next out (nout)
                for (int j = i; j < out.size(); j++) nout.pb(out[j]);
                break;
            }
            move_inside(out[i]);

            int x = press_button();

            if (x > mid)
            {
                nout.pb(out[i]);
                move_outside(out[i]);
            }
            else
            {
                rn++;
                temp.pb(out[i]);
            }
        }
 // if true, previous elements not needed
 // current elements not needed ?? yes
 // (*) extras not needed (nout) if min is already lower <- important

        if (rn == mid * sz)
        {
            best = max(best, mid);
            l = mid + 1;
            out = nout;
        }
        else
        {
            r = mid - 1;
            rn -= (int)(temp.size());
            for (int x : temp)
            {
                move_outside(x);
            }
            out = temp; // (*) <-
        }
    }

    return best;
}


/*
int main()
{
    int n;
    cin >> n;

    type.assign(n, 0);

    for (int i = 0; i < n; i++)
    {
        cin >> type[i];
    }

    cout << min_cardinality(n) << endl;

}
*/

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:102:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |         for (int i = 0; i < out.size(); i++)
      |                         ~~^~~~~~~~~~~~
insects.cpp:106:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |                 for (int j = i; j < out.size(); j++) nout.pb(out[j]);
      |                                 ~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.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 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 6 ms 304 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 4 ms 300 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct

Subtask #2
15.0 / 15.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 1 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 3 ms 208 KB Output is correct
7 Correct 3 ms 208 KB Output is correct
8 Correct 4 ms 208 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 5 ms 208 KB Output is correct
11 Correct 3 ms 208 KB Output is correct
12 Correct 4 ms 208 KB Output is correct
13 Correct 6 ms 304 KB Output is correct
14 Correct 3 ms 336 KB Output is correct
15 Correct 5 ms 208 KB Output is correct
16 Correct 6 ms 208 KB Output is correct
17 Correct 5 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 4 ms 300 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 4 ms 208 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 11 ms 208 KB Output is correct
24 Correct 9 ms 208 KB Output is correct
25 Correct 14 ms 300 KB Output is correct
26 Correct 25 ms 308 KB Output is correct
27 Correct 26 ms 208 KB Output is correct
28 Correct 7 ms 208 KB Output is correct
29 Correct 27 ms 308 KB Output is correct
30 Correct 22 ms 284 KB Output is correct
31 Correct 18 ms 208 KB Output is correct
32 Correct 17 ms 300 KB Output is correct
33 Correct 27 ms 288 KB Output is correct
34 Correct 16 ms 300 KB Output is correct
35 Correct 21 ms 328 KB Output is correct
36 Correct 23 ms 208 KB Output is correct
37 Correct 22 ms 292 KB Output is correct
38 Correct 24 ms 208 KB Output is correct
39 Correct 24 ms 208 KB Output is correct
40 Correct 15 ms 340 KB Output is correct
41 Correct 10 ms 296 KB Output is correct

Subtask #3
75.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 1 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 16 ms 300 KB Output is correct
8 Correct 16 ms 208 KB Output is correct
9 Correct 45 ms 304 KB Output is correct
10 Correct 55 ms 300 KB Output is correct
11 Correct 41 ms 420 KB Output is correct
12 Correct 24 ms 292 KB Output is correct
13 Correct 41 ms 304 KB Output is correct
14 Correct 50 ms 300 KB Output is correct
15 Correct 42 ms 208 KB Output is correct
16 Correct 42 ms 296 KB Output is correct
17 Correct 46 ms 292 KB Output is correct
18 Correct 49 ms 300 KB Output is correct
19 Correct 44 ms 292 KB Output is correct
20 Correct 36 ms 308 KB Output is correct
21 Correct 46 ms 328 KB Output is correct
22 Correct 48 ms 296 KB Output is correct
23 Correct 45 ms 328 KB Output is correct
24 Correct 41 ms 332 KB Output is correct
25 Correct 31 ms 284 KB Output is correct
26 Correct 20 ms 208 KB Output is correct
27 Correct 41 ms 428 KB Output is correct
28 Correct 41 ms 308 KB Output is correct
29 Correct 36 ms 304 KB Output is correct
30 Correct 48 ms 208 KB Output is correct
31 Correct 55 ms 292 KB Output is correct
32 Correct 45 ms 328 KB Output is correct
33 Correct 45 ms 336 KB Output is correct
34 Correct 38 ms 208 KB Output is correct
35 Correct 42 ms 304 KB Output is correct
36 Correct 31 ms 300 KB Output is correct
37 Correct 57 ms 208 KB Output is correct
38 Correct 47 ms 328 KB Output is correct
39 Correct 48 ms 292 KB Output is correct
40 Correct 49 ms 300 KB Output is correct
41 Correct 51 ms 304 KB Output is correct
42 Correct 24 ms 336 KB Output is correct
43 Correct 14 ms 308 KB Output is correct
44 Correct 46 ms 304 KB Output is correct
45 Correct 26 ms 208 KB Output is correct
46 Correct 25 ms 304 KB Output is correct
47 Correct 29 ms 292 KB Output is correct
48 Correct 24 ms 328 KB Output is correct