oj.uz

Submission #698948

# Submission time Handle Problem Language Result Execution time Memory
698948 2023-02-15T00:15:52 Z aryan12 Rarest Insects (IOI22_insects) C++17
53.16 / 100
 165 ms 580 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

int min_cardinality(int N) 
{
    int num_insects = 0;
    set<int> s;
    for(int i = 0; i < N; i++)
    {
        // cout << "moving inside[1]: " << i << endl;
        move_inside(i);
        s.insert(i);
        num_insects++;
        if(press_button() == 2)
        {
            // cout << "moving outside[1]: " << i << endl;
            move_outside(i);
            s.erase(i);
            num_insects--;
        }
    }
    // cout << "num_insects = " << num_insects << endl;
    int l = 2, r = N / num_insects, ans = 1;
    bool flag = true;
    set<int> last_iteration;
    while(l <= r)
    {
        int mid = (l + r) / 2;
        // cout << "mid = " << mid << endl;
        // cout << "s.size() = " << s.size() << endl;
        if(!flag)
        {
            for(auto i: last_iteration)
            {
                // cout << "i = " << i << endl;
                // cout << "moving outside[2]: " << i << endl;
                move_outside(i);
                s.erase(i);
            }
        }
        last_iteration.clear();
        // cout << "hello!" << endl;
        int current_insects = s.size();
        for(int i = 0; i < N; i++)
        {
            if(s.count(i)) continue;
            // cout << "moving inside[3]: " << i << endl;
            move_inside(i);
            s.insert(i);
            last_iteration.insert(i);
            current_insects++;
            if(press_button() > mid)
            {
                // cout << "moving outside[3]: " << i << endl;
                move_outside(i);
                s.erase(i);
                last_iteration.erase(i);
                current_insects--;
            }
            if(current_insects == mid * num_insects)
            {
                break;
            }
        }
        // cout << "current_insects = " << current_insects << endl;
        if(current_insects == mid * num_insects)
        {
            ans = mid;
            l = mid + 1;
            flag = true;
        }
        else
        {
            r = mid - 1;
            flag = false;
        }
    }
    return ans;
}

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

Subtask #3
28.16 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 208 KB Output is correct
7 Correct 35 ms 580 KB Output is correct
8 Correct 28 ms 328 KB Output is correct
9 Correct 32 ms 328 KB Output is correct
10 Partially correct 79 ms 368 KB Output is partially correct
11 Partially correct 155 ms 328 KB Output is partially correct
12 Correct 28 ms 312 KB Output is correct
13 Partially correct 165 ms 280 KB Output is partially correct
14 Partially correct 107 ms 332 KB Output is partially correct
15 Correct 44 ms 280 KB Output is correct
16 Correct 41 ms 288 KB Output is correct
17 Correct 42 ms 288 KB Output is correct
18 Correct 49 ms 292 KB Output is correct
19 Correct 69 ms 300 KB Output is correct
20 Partially correct 47 ms 280 KB Output is partially correct
21 Partially correct 77 ms 284 KB Output is partially correct
22 Partially correct 74 ms 332 KB Output is partially correct
23 Partially correct 64 ms 288 KB Output is partially correct
24 Correct 49 ms 312 KB Output is correct
25 Correct 16 ms 300 KB Output is correct
26 Correct 16 ms 336 KB Output is correct
27 Correct 55 ms 328 KB Output is correct
28 Correct 18 ms 368 KB Output is correct
29 Correct 50 ms 288 KB Output is correct
30 Correct 59 ms 372 KB Output is correct
31 Partially correct 73 ms 284 KB Output is partially correct
32 Partially correct 37 ms 296 KB Output is partially correct
33 Partially correct 94 ms 364 KB Output is partially correct
34 Partially correct 45 ms 368 KB Output is partially correct
35 Partially correct 44 ms 300 KB Output is partially correct
36 Correct 45 ms 368 KB Output is correct
37 Partially correct 65 ms 292 KB Output is partially correct
38 Partially correct 58 ms 296 KB Output is partially correct
39 Correct 60 ms 296 KB Output is correct
40 Correct 31 ms 280 KB Output is correct
41 Correct 46 ms 312 KB Output is correct
42 Partially correct 49 ms 368 KB Output is partially correct
43 Partially correct 38 ms 208 KB Output is partially correct
44 Partially correct 74 ms 304 KB Output is partially correct
45 Correct 25 ms 328 KB Output is correct
46 Correct 24 ms 292 KB Output is correct
47 Correct 24 ms 320 KB Output is correct
48 Correct 13 ms 344 KB Output is correct