oj.uz

Submission #825865

# Submission time Handle Problem Language Result Execution time Memory
825865 2023-08-15T08:56:14 Z LittleCube Rarest Insects (IOI22_insects) C++17
38.24 / 100
 218 ms 440 KB 
#include "insects.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

const double r = 0.5;

int min_cardinality(int N)
{
    vector<int> remain;
    int M = N, L = 1, R = N;
    /*
    Choose k:
    ans <= k -> R = k
    ans > k -> L = k + 1, M -= k
    */
    for (int i = 0; i < N; i++)
        remain.emplace_back(i);
    while (L < R)
    {
        int k = (L + R) / 2;
        vector<int> small, large, tmp, out;

        for (int i : remain)
        {
            move_inside(i);
            if (press_button() > k)
            {
                move_outside(i);
                large.emplace_back(i);
            }
            else
                small.emplace_back(i);
        }
        for (auto i : small)
            move_outside(i);

        if (large.empty())
            R = k;
        else
        {
            for (auto i : large)
            {
                move_inside(i);
                if (press_button() == 2)
                    move_outside(i);
                else
                    out.emplace_back(i);
            }
            int g = out.size();
            for (auto i : small)
            {
                move_inside(i);
                if (press_button() == 2)
                    large.emplace_back(i);
                else
                    tmp.emplace_back(i);
                move_outside(i);
            }
            for (auto i : out)
                move_outside(i);

            if (tmp.empty())
            {
                if(g == 1)
                    return large.size();
                L = k + 1, R = min(R, (int)remain.size() / g);
            }
            else
                remain = tmp, R = k;
        }
    }
    return L;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:11:9: warning: unused variable 'M' [-Wunused-variable]
   11 |     int M = N, L = 1, R = N;
      |         ^

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 12 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 9 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 8 ms 208 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 12 ms 208 KB Output is correct
16 Correct 12 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 16 ms 208 KB Output is correct
21 Correct 13 ms 208 KB Output is correct
22 Correct 12 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 12 ms 208 KB Output is correct
8 Correct 7 ms 208 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 9 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 8 ms 208 KB Output is correct
14 Correct 8 ms 208 KB Output is correct
15 Correct 12 ms 208 KB Output is correct
16 Correct 12 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 8 ms 208 KB Output is correct
19 Correct 6 ms 208 KB Output is correct
20 Correct 16 ms 208 KB Output is correct
21 Correct 13 ms 208 KB Output is correct
22 Correct 12 ms 208 KB Output is correct
23 Correct 16 ms 336 KB Output is correct
24 Correct 36 ms 308 KB Output is correct
25 Correct 110 ms 208 KB Output is correct
26 Correct 69 ms 288 KB Output is correct
27 Correct 12 ms 308 KB Output is correct
28 Correct 52 ms 304 KB Output is correct
29 Correct 37 ms 292 KB Output is correct
30 Correct 50 ms 292 KB Output is correct
31 Correct 67 ms 300 KB Output is correct
32 Correct 53 ms 292 KB Output is correct
33 Correct 40 ms 304 KB Output is correct
34 Correct 59 ms 292 KB Output is correct
35 Correct 63 ms 304 KB Output is correct
36 Correct 69 ms 312 KB Output is correct
37 Correct 54 ms 288 KB Output is correct
38 Correct 61 ms 208 KB Output is correct
39 Correct 77 ms 312 KB Output is correct
40 Correct 64 ms 296 KB Output is correct
41 Correct 84 ms 308 KB Output is correct

Subtask #3
13.24 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 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 31 ms 312 KB Output is correct
8 Partially correct 184 ms 312 KB Output is partially correct
9 Partially correct 177 ms 316 KB Output is partially correct
10 Partially correct 80 ms 316 KB Output is partially correct
11 Correct 32 ms 308 KB Output is correct
12 Partially correct 101 ms 316 KB Output is partially correct
13 Partially correct 47 ms 312 KB Output is partially correct
14 Partially correct 111 ms 304 KB Output is partially correct
15 Partially correct 142 ms 308 KB Output is partially correct
16 Partially correct 194 ms 320 KB Output is partially correct
17 Partially correct 109 ms 300 KB Output is partially correct
18 Partially correct 93 ms 308 KB Output is partially correct
19 Partially correct 81 ms 308 KB Output is partially correct
20 Partially correct 121 ms 380 KB Output is partially correct
21 Partially correct 129 ms 312 KB Output is partially correct
22 Partially correct 143 ms 368 KB Output is partially correct
23 Partially correct 146 ms 420 KB Output is partially correct
24 Partially correct 186 ms 396 KB Output is partially correct
25 Partially correct 196 ms 304 KB Output is partially correct
26 Partially correct 190 ms 432 KB Output is partially correct
27 Partially correct 82 ms 300 KB Output is partially correct
28 Partially correct 97 ms 316 KB Output is partially correct
29 Partially correct 143 ms 304 KB Output is partially correct
30 Partially correct 98 ms 392 KB Output is partially correct
31 Partially correct 113 ms 308 KB Output is partially correct
32 Partially correct 92 ms 328 KB Output is partially correct
33 Partially correct 82 ms 316 KB Output is partially correct
34 Partially correct 110 ms 312 KB Output is partially correct
35 Partially correct 118 ms 388 KB Output is partially correct
36 Partially correct 85 ms 312 KB Output is partially correct
37 Partially correct 90 ms 312 KB Output is partially correct
38 Partially correct 73 ms 416 KB Output is partially correct
39 Partially correct 111 ms 320 KB Output is partially correct
40 Partially correct 138 ms 316 KB Output is partially correct
41 Partially correct 122 ms 308 KB Output is partially correct
42 Partially correct 88 ms 316 KB Output is partially correct
43 Correct 13 ms 208 KB Output is correct
44 Correct 33 ms 308 KB Output is correct
45 Partially correct 218 ms 312 KB Output is partially correct
46 Partially correct 76 ms 440 KB Output is partially correct
47 Partially correct 96 ms 304 KB Output is partially correct
48 Partially correct 125 ms 312 KB Output is partially correct