oj.uz

Submission #836522

# Submission time Handle Problem Language Result Execution time Memory
836522 2023-08-24T12:17:05 Z SamAnd Rarest Insects (IOI22_insects) C++17
25 / 100
 255 ms 580 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
mt19937 rnf(2106);
const int N = 2003;

vector<int> q[N];
int min_cardinality(int N)
{
    vector<int> v;
    vector<int> b;
    for (int i = 0; i < N; ++i)
    {
        move_inside(i);
        if (press_button() == 1)
        {
            v.push_back(i);
        }
        else
        {
            move_outside(i);
            b.push_back(i);
        }
    }
    for (int i = 0; i < sz(v); ++i)
        move_outside(v[i]);

    //if (sz(v) > 100)
    {
        int ans = 1;
        while (!b.empty())
        {
            //for (int i = sz(b) - 1; i >= 0; --i)
            //    swap(b[i], b[rnf() % (i + 1)]);
            vector<int> vv;
            vector<int> bb;
            for (int i = 0; i < sz(b); ++i)
            {
                if (sz(v) == sz(vv))
                {
                    bb.push_back(b[i]);
                    continue;
                }
                move_inside(b[i]);
                if (press_button() == 1)
                {
                    vv.push_back(b[i]);
                }
                else
                {
                    move_outside(b[i]);
                    bb.push_back(b[i]);
                }
            }
            if (sz(vv) < sz(v))
                break;
            ++ans;
            for (int i = 0; i < sz(vv); ++i)
                move_outside(vv[i]);
            b = bb;
        }
        return ans;
    }

    vector<int> l, r, u;
    l.assign(sz(b), 0);
    r.assign(sz(b), sz(v) - 1);
    u.assign(sz(b), -1);
    while (1)
    {
        for (int i = 0; i < sz(v); ++i)
            q[i].clear();
        bool z = false;
        for (int i = 0; i < sz(b); ++i)
        {
            if (l[i] <= r[i])
            {
                int m = (l[i] + r[i]) / 2;
                q[m].push_back(i);
                z = true;
            }
        }
        if (!z)
            break;
        for (int i = 0; i < sz(v); ++i)
        {
            move_inside(v[i]);
            for (int j = 0; j < sz(q[i]); ++j)
            {
                move_inside(b[q[i][j]]);
                if (press_button() == 2)
                {
                    u[q[i][j]] = i;
                    r[q[i][j]] = i - 1;
                }
                else
                    l[q[i][j]] = i + 1;
                move_outside(b[q[i][j]]);
            }
        }
        for (int i = 0; i < sz(v); ++i)
        {
            move_outside(v[i]);
        }
    }

    vector<int> q;
    q.assign(sz(v), 1);
    for (int i = 0; i < sz(b); ++i)
        ++q[u[i]];
    int ans = q[0];
    for (int i = 0; i < sz(v); ++i)
        ans = min(ans, q[i]);
    return ans;
}

/*
10
1 1 2 2 1 2 3 3 3 4
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 6 ms 336 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 4 ms 336 KB Output is correct
13 Correct 4 ms 336 KB Output is correct
14 Correct 7 ms 348 KB Output is correct
15 Correct 9 ms 336 KB Output is correct
16 Correct 7 ms 348 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 3 ms 336 KB Output is correct
19 Correct 5 ms 348 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 2 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 6 ms 336 KB Output is correct
9 Correct 4 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 2 ms 336 KB Output is correct
12 Correct 4 ms 336 KB Output is correct
13 Correct 4 ms 336 KB Output is correct
14 Correct 7 ms 348 KB Output is correct
15 Correct 9 ms 336 KB Output is correct
16 Correct 7 ms 348 KB Output is correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 3 ms 336 KB Output is correct
19 Correct 5 ms 348 KB Output is correct
20 Correct 3 ms 336 KB Output is correct
21 Correct 2 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 14 ms 336 KB Output is correct
24 Correct 7 ms 336 KB Output is correct
25 Correct 43 ms 336 KB Output is correct
26 Correct 43 ms 336 KB Output is correct
27 Correct 10 ms 336 KB Output is correct
28 Correct 11 ms 336 KB Output is correct
29 Correct 19 ms 384 KB Output is correct
30 Correct 12 ms 336 KB Output is correct
31 Correct 60 ms 336 KB Output is correct
32 Correct 57 ms 336 KB Output is correct
33 Correct 80 ms 348 KB Output is correct
34 Correct 56 ms 364 KB Output is correct
35 Correct 52 ms 336 KB Output is correct
36 Correct 45 ms 336 KB Output is correct
37 Correct 34 ms 360 KB Output is correct
38 Correct 20 ms 336 KB Output is correct
39 Correct 14 ms 336 KB Output is correct
40 Correct 9 ms 352 KB Output is correct
41 Correct 9 ms 336 KB Output is correct

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 31 ms 336 KB Output is correct
8 Correct 16 ms 464 KB Output is correct
9 Partially correct 100 ms 336 KB Output is partially correct
10 Partially correct 112 ms 336 KB Output is partially correct
11 Correct 25 ms 336 KB Output is correct
12 Correct 18 ms 580 KB Output is correct
13 Correct 35 ms 336 KB Output is correct
14 Correct 25 ms 388 KB Output is correct
15 Partially correct 179 ms 336 KB Output is partially correct
16 Partially correct 137 ms 352 KB Output is partially correct
17 Partially correct 136 ms 336 KB Output is partially correct
18 Partially correct 124 ms 336 KB Output is partially correct
19 Partially correct 161 ms 336 KB Output is partially correct
20 Partially correct 152 ms 352 KB Output is partially correct
21 Partially correct 89 ms 336 KB Output is partially correct
22 Partially correct 73 ms 356 KB Output is partially correct
23 Correct 21 ms 336 KB Output is correct
24 Correct 17 ms 348 KB Output is correct
25 Correct 21 ms 348 KB Output is correct
26 Correct 19 ms 464 KB Output is correct
27 Partially correct 84 ms 360 KB Output is partially correct
28 Correct 25 ms 456 KB Output is correct
29 Partially correct 79 ms 360 KB Output is partially correct
30 Incorrect 255 ms 336 KB Too many queries.
31 Halted 0 ms 0 KB -