oj.uz

Submission #787871

# Submission time Handle Problem Language Result Execution time Memory
787871 2023-07-19T13:42:31 Z Andrey Rarest Insects (IOI22_insects) C++17
100 / 100
 53 ms 416 KB 
#include "insects.h"
#include<bits/stdc++.h>
using namespace std;

int n,p = 0,l,r,x = 1;
vector<bool> idk(10000,true);
vector<bool> no(10000,true);

void check(int a) {
    vector<bool> bruh(n,true);
    vector<int> wut(0);
    vector<int> yay(0);
    int br = x*p;
    for(int i = 0; i < n && br < p*a; i++) {
        if(idk[i] && no[i]) {
            move_inside(i);
            if(press_button() > a) {
                bruh[i] = false;
                yay.push_back(i);
                move_outside(i);
            }
            else {
                br++;
                wut.push_back(i);
            }
        }
    }
    if(br == p*a) {
        l = a;
        for(int i = 0; i < wut.size(); i++) {
            idk[wut[i]] = false;
        }
        x = a;
        return;
    }
    else {
        r = a-((p*a-br)/p)-1;
        l = max(l,br-(p-1)*a);
        if(l == r) {
            return;
        }
        for(int i = 0; i < n; i++) {
            if(bruh[i] && idk[i] && no[i]) {
                move_outside(i);
            }
        }
        for(int i = 0; i < yay.size(); i++) {
            no[yay[i]] = false;
        }
        return;
    }
}

int min_cardinality(int N) {
    n = N;
    int m;
    l = 1;
    vector<bool> bruh(n,true);
    vector<int> yay(0);
    for(int i = 0; i < n; i++) {
        move_inside(i);
        if(press_button() > 1) {
            move_outside(i);
            bruh[i] = false;
        }
        else {
            p++;
            yay.push_back(i);
        }
    }
    for(int i = 0; i < p; i++) {
        idk[yay[i]] = false;
    }
    r = n/p;
    if(p == 1) {
        return n;
    }
    while(l < r) {
        m = (l+r+1)/2;
        if(m < r-1 && (rand()%2) == 1) {
            m++;
        }
        check(m);
    }
    return l;
}

Compilation message

insects.cpp: In function 'void check(int)':
insects.cpp:30:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         for(int i = 0; i < wut.size(); i++) {
      |                        ~~^~~~~~~~~~~~
insects.cpp:47:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for(int i = 0; i < yay.size(); i++) {
      |                        ~~^~~~~~~~~~~~

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

Subtask #3
75.0 / 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 220 KB Output is correct
7 Correct 17 ms 208 KB Output is correct
8 Correct 17 ms 208 KB Output is correct
9 Correct 31 ms 208 KB Output is correct
10 Correct 26 ms 280 KB Output is correct
11 Correct 26 ms 288 KB Output is correct
12 Correct 20 ms 416 KB Output is correct
13 Correct 46 ms 280 KB Output is correct
14 Correct 37 ms 288 KB Output is correct
15 Correct 30 ms 208 KB Output is correct
16 Correct 34 ms 284 KB Output is correct
17 Correct 27 ms 288 KB Output is correct
18 Correct 38 ms 280 KB Output is correct
19 Correct 34 ms 284 KB Output is correct
20 Correct 42 ms 284 KB Output is correct
21 Correct 46 ms 288 KB Output is correct
22 Correct 18 ms 332 KB Output is correct
23 Correct 27 ms 412 KB Output is correct
24 Correct 38 ms 304 KB Output is correct
25 Correct 22 ms 332 KB Output is correct
26 Correct 16 ms 312 KB Output is correct
27 Correct 45 ms 208 KB Output is correct
28 Correct 33 ms 208 KB Output is correct
29 Correct 48 ms 208 KB Output is correct
30 Correct 46 ms 208 KB Output is correct
31 Correct 25 ms 280 KB Output is correct
32 Correct 30 ms 208 KB Output is correct
33 Correct 52 ms 284 KB Output is correct
34 Correct 38 ms 328 KB Output is correct
35 Correct 44 ms 208 KB Output is correct
36 Correct 34 ms 284 KB Output is correct
37 Correct 39 ms 292 KB Output is correct
38 Correct 53 ms 292 KB Output is correct
39 Correct 25 ms 284 KB Output is correct
40 Correct 24 ms 292 KB Output is correct
41 Correct 31 ms 208 KB Output is correct
42 Correct 48 ms 280 KB Output is correct
43 Correct 9 ms 208 KB Output is correct
44 Correct 35 ms 288 KB Output is correct
45 Correct 34 ms 284 KB Output is correct
46 Correct 20 ms 304 KB Output is correct
47 Correct 25 ms 304 KB Output is correct
48 Correct 23 ms 296 KB Output is correct