Submission #830549

# Submission time Handle Problem Language Result Execution time Memory
830549 2023-08-19T07:55:57 Z tolbi Rarest Insects (IOI22_insects) C++17
50 / 100
164 ms 428 KB
#include <bits/stdc++.h>
using namespace std;
mt19937 ayahya(chrono::high_resolution_clock().now().time_since_epoch().count());
#include "insects.h"
int min_cardinality(int n) {
    function<int(int)> f;
    vector<int> hash(n);
    iota(hash.begin(), hash.end(), 0);
    for (int i = n-1; i >= 0; i--){
        swap(hash[i],hash[ayahya()%(i+1)]);
    }
    f = [&](int x)->int{
        int ans = 0;
        vector<int> crr;
        for (int i = 0; i < n; i++){
            crr.push_back(hash[i]);
            move_inside(hash[i]);
            if (press_button()>x){
                ans++;
                crr.pop_back();
                move_outside(hash[i]);
            }
        }
        for (int i = 0; i < crr.size(); ++i)
        {
            move_outside(crr[i]);
        }
        return ans;
    };
    int diff = n-f(1);
    if (diff==1) return n;
    int l = 1, r = n/diff;
    while (l<r){
        int mid = l+(r-l+1)/2;
        if (f(mid)>n-(mid*diff)){
            r=mid-1;
        }
        else l = mid;
    }
    return l;
}

Compilation message

insects.cpp: In lambda function:
insects.cpp:24:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |         for (int i = 0; i < crr.size(); ++i)
      |                         ~~^~~~~~~~~~~~
# 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 0 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Correct 11 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 13 ms 308 KB Output is correct
15 Correct 7 ms 300 KB Output is correct
16 Correct 6 ms 304 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 7 ms 208 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 3 ms 300 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
# 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 0 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 2 ms 208 KB Output is correct
8 Correct 10 ms 208 KB Output is correct
9 Correct 9 ms 208 KB Output is correct
10 Correct 11 ms 208 KB Output is correct
11 Correct 2 ms 208 KB Output is correct
12 Correct 8 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 13 ms 308 KB Output is correct
15 Correct 7 ms 300 KB Output is correct
16 Correct 6 ms 304 KB Output is correct
17 Correct 7 ms 208 KB Output is correct
18 Correct 5 ms 208 KB Output is correct
19 Correct 7 ms 208 KB Output is correct
20 Correct 5 ms 208 KB Output is correct
21 Correct 3 ms 300 KB Output is correct
22 Correct 2 ms 208 KB Output is correct
23 Correct 6 ms 208 KB Output is correct
24 Correct 8 ms 308 KB Output is correct
25 Correct 41 ms 208 KB Output is correct
26 Correct 46 ms 208 KB Output is correct
27 Correct 62 ms 296 KB Output is correct
28 Correct 10 ms 208 KB Output is correct
29 Correct 74 ms 288 KB Output is correct
30 Correct 35 ms 308 KB Output is correct
31 Correct 56 ms 296 KB Output is correct
32 Correct 31 ms 420 KB Output is correct
33 Correct 47 ms 208 KB Output is correct
34 Correct 70 ms 208 KB Output is correct
35 Correct 62 ms 312 KB Output is correct
36 Correct 47 ms 292 KB Output is correct
37 Correct 40 ms 208 KB Output is correct
38 Correct 15 ms 312 KB Output is correct
39 Correct 27 ms 312 KB Output is correct
40 Correct 15 ms 292 KB Output is correct
41 Correct 8 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 208 KB Output is correct
6 Partially correct 1 ms 208 KB Output is partially correct
7 Correct 17 ms 208 KB Output is correct
8 Correct 15 ms 316 KB Output is correct
9 Partially correct 102 ms 308 KB Output is partially correct
10 Partially correct 95 ms 304 KB Output is partially correct
11 Partially correct 164 ms 300 KB Output is partially correct
12 Correct 25 ms 300 KB Output is correct
13 Partially correct 101 ms 296 KB Output is partially correct
14 Partially correct 68 ms 304 KB Output is partially correct
15 Partially correct 110 ms 292 KB Output is partially correct
16 Partially correct 102 ms 312 KB Output is partially correct
17 Partially correct 114 ms 308 KB Output is partially correct
18 Partially correct 142 ms 308 KB Output is partially correct
19 Partially correct 108 ms 316 KB Output is partially correct
20 Partially correct 105 ms 396 KB Output is partially correct
21 Partially correct 105 ms 288 KB Output is partially correct
22 Partially correct 79 ms 208 KB Output is partially correct
23 Partially correct 41 ms 208 KB Output is partially correct
24 Correct 37 ms 300 KB Output is correct
25 Correct 33 ms 312 KB Output is correct
26 Correct 11 ms 308 KB Output is correct
27 Partially correct 99 ms 308 KB Output is partially correct
28 Partially correct 94 ms 300 KB Output is partially correct
29 Partially correct 101 ms 308 KB Output is partially correct
30 Partially correct 104 ms 308 KB Output is partially correct
31 Partially correct 78 ms 304 KB Output is partially correct
32 Partially correct 107 ms 312 KB Output is partially correct
33 Partially correct 59 ms 208 KB Output is partially correct
34 Partially correct 62 ms 308 KB Output is partially correct
35 Partially correct 101 ms 308 KB Output is partially correct
36 Partially correct 79 ms 308 KB Output is partially correct
37 Partially correct 72 ms 304 KB Output is partially correct
38 Partially correct 103 ms 308 KB Output is partially correct
39 Partially correct 66 ms 296 KB Output is partially correct
40 Partially correct 73 ms 428 KB Output is partially correct
41 Partially correct 120 ms 308 KB Output is partially correct
42 Partially correct 99 ms 304 KB Output is partially correct
43 Partially correct 22 ms 208 KB Output is partially correct
44 Partially correct 57 ms 208 KB Output is partially correct
45 Partially correct 139 ms 356 KB Output is partially correct
46 Correct 22 ms 316 KB Output is correct
47 Correct 33 ms 308 KB Output is correct
48 Correct 17 ms 308 KB Output is correct