oj.uz

Submission #825851

# Submission time Handle Problem Language Result Execution time Memory
825851 2023-08-15T08:50:00 Z LittleCube Rarest Insects (IOI22_insects) C++17
37.5 / 100
 227 ms 500 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);
            }
            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())
                L = k + 1;
            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 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 24 ms 208 KB Output is correct
7 Correct 10 ms 208 KB Output is correct
8 Correct 17 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 11 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 10 ms 208 KB Output is correct
15 Correct 10 ms 208 KB Output is correct
16 Correct 17 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 12 ms 208 KB Output is correct
20 Correct 13 ms 208 KB Output is correct
21 Correct 18 ms 208 KB Output is correct
22 Correct 15 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 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 24 ms 208 KB Output is correct
7 Correct 10 ms 208 KB Output is correct
8 Correct 17 ms 208 KB Output is correct
9 Correct 7 ms 208 KB Output is correct
10 Correct 3 ms 208 KB Output is correct
11 Correct 11 ms 208 KB Output is correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 7 ms 208 KB Output is correct
14 Correct 10 ms 208 KB Output is correct
15 Correct 10 ms 208 KB Output is correct
16 Correct 17 ms 208 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 9 ms 208 KB Output is correct
19 Correct 12 ms 208 KB Output is correct
20 Correct 13 ms 208 KB Output is correct
21 Correct 18 ms 208 KB Output is correct
22 Correct 15 ms 208 KB Output is correct
23 Correct 141 ms 308 KB Output is correct
24 Correct 72 ms 328 KB Output is correct
25 Correct 102 ms 308 KB Output is correct
26 Correct 73 ms 208 KB Output is correct
27 Correct 18 ms 208 KB Output is correct
28 Correct 39 ms 308 KB Output is correct
29 Correct 32 ms 292 KB Output is correct
30 Correct 42 ms 296 KB Output is correct
31 Correct 59 ms 304 KB Output is correct
32 Correct 31 ms 304 KB Output is correct
33 Correct 41 ms 292 KB Output is correct
34 Correct 35 ms 312 KB Output is correct
35 Correct 53 ms 296 KB Output is correct
36 Correct 55 ms 308 KB Output is correct
37 Correct 51 ms 308 KB Output is correct
38 Correct 62 ms 312 KB Output is correct
39 Correct 97 ms 304 KB Output is correct
40 Correct 118 ms 308 KB Output is correct
41 Correct 54 ms 296 KB Output is correct

Subtask #3
12.5 / 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 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Partially correct 150 ms 384 KB Output is partially correct
8 Partially correct 182 ms 316 KB Output is partially correct
9 Partially correct 184 ms 312 KB Output is partially correct
10 Partially correct 58 ms 312 KB Output is partially correct
11 Correct 24 ms 208 KB Output is correct
12 Partially correct 50 ms 316 KB Output is partially correct
13 Partially correct 31 ms 312 KB Output is partially correct
14 Partially correct 98 ms 312 KB Output is partially correct
15 Partially correct 162 ms 424 KB Output is partially correct
16 Partially correct 170 ms 324 KB Output is partially correct
17 Partially correct 71 ms 412 KB Output is partially correct
18 Partially correct 137 ms 316 KB Output is partially correct
19 Partially correct 68 ms 316 KB Output is partially correct
20 Partially correct 100 ms 300 KB Output is partially correct
21 Partially correct 114 ms 308 KB Output is partially correct
22 Partially correct 138 ms 312 KB Output is partially correct
23 Partially correct 141 ms 436 KB Output is partially correct
24 Partially correct 98 ms 304 KB Output is partially correct
25 Partially correct 165 ms 304 KB Output is partially correct
26 Partially correct 227 ms 316 KB Output is partially correct
27 Partially correct 146 ms 332 KB Output is partially correct
28 Partially correct 160 ms 312 KB Output is partially correct
29 Partially correct 163 ms 368 KB Output is partially correct
30 Partially correct 175 ms 300 KB Output is partially correct
31 Partially correct 69 ms 416 KB Output is partially correct
32 Partially correct 115 ms 308 KB Output is partially correct
33 Partially correct 98 ms 312 KB Output is partially correct
34 Partially correct 108 ms 328 KB Output is partially correct
35 Partially correct 197 ms 312 KB Output is partially correct
36 Partially correct 145 ms 312 KB Output is partially correct
37 Partially correct 118 ms 316 KB Output is partially correct
38 Partially correct 53 ms 312 KB Output is partially correct
39 Partially correct 120 ms 308 KB Output is partially correct
40 Partially correct 117 ms 308 KB Output is partially correct
41 Partially correct 215 ms 308 KB Output is partially correct
42 Partially correct 165 ms 500 KB Output is partially correct
43 Correct 14 ms 208 KB Output is correct
44 Correct 41 ms 316 KB Output is correct
45 Partially correct 192 ms 432 KB Output is partially correct
46 Partially correct 83 ms 312 KB Output is partially correct
47 Partially correct 81 ms 408 KB Output is partially correct
48 Partially correct 92 ms 308 KB Output is partially correct