QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#142708	#4565. Rarest Insects	Qwerty1232^#	25	73ms	4076kb	C++20	1.2kb	2023-08-19 18:19:51	2024-07-04 01:49:02

Judging History

你现在查看的是最新测评结果

[2024-07-04 01:49:02]
评测

测评结果：25
用时：73ms
内存：4076kb

查看

[2023-08-19 18:19:51]
提交

answer

#include "insects.h"

#include <numeric>
#include <vector>

int min_cardinality(int n) {
    int beg = 0, end = n;
    while (beg + 1 < end) {
        int mid = (beg + end) / 2;
        std::vector<bool> fucked(n);
        std::vector<int> vec;

        int th1 = (mid + 1) / 2;
        int th2 = (mid + 1) / 2;
        if (mid % 2 == 0) {
            th2++;
        }
        for (int i = 0; i < n; i++) {
            move_inside(i);
            if (th1 < press_button()) {
                fucked[i] = true;
                move_outside(i);
            } else {
                vec.push_back(i);
            }
        }
        for (int i : vec) {
            move_outside(i);
        }
        vec.clear();
        for (int i = n - 1; i >= 0; i--) {
            move_inside(i);
            if (th2 < press_button()) {
                fucked[i] = true;
                move_outside(i);
            } else {
                vec.push_back(i);
            }
        }
        for (int i : vec) {
            move_outside(i);
        }
        vec.clear();

        if (std::accumulate(fucked.begin(), fucked.end(), 0) == n) {
            beg = mid;
        } else {
            end = mid;
        }
    }
    return end;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 10

Accepted

Test #1:

score: 10

Accepted

time: 1ms

memory: 3792kb

input:

output:

result:

ok

Test #2:

score: 0

Accepted

time: 0ms

memory: 4052kb

input:

output:

result:

ok

Test #3:

score: 0

Accepted

time: 1ms

memory: 3672kb

input:

output:

result:

ok

Test #4:

score: 0

Accepted

time: 1ms

memory: 4028kb

input:

output:

result:

ok

Test #5:

score: 0

Accepted

time: 1ms

memory: 3796kb

input:

output:

result:

ok

Test #6:

score: 0

Accepted

time: 1ms

memory: 3776kb

input:

output:

result:

ok

Test #7:

score: 0

Accepted

time: 3ms

memory: 3772kb

input:

output:

result:

ok

Test #8:

score: 0

Accepted

time: 0ms

memory: 3772kb

input:

output:

result:

ok

Test #9:

score: 0

Accepted

time: 15ms

memory: 3776kb

input:

output:

result:

ok

Test #10:

score: 0

Accepted

time: 0ms

memory: 3824kb

input:

output:

result:

ok

Test #11:

score: 0

Accepted

time: 0ms

memory: 3800kb

input:

output:

result:

ok

Test #12:

score: 0

Accepted

time: 0ms

memory: 3776kb

input:

output:

result:

ok

Test #13:

score: 0

Accepted

time: 3ms

memory: 3772kb

input:

output:

result:

ok

Test #14:

score: 0

Accepted

time: 3ms

memory: 3776kb

input:

output:

result:

ok

Test #15:

score: 0

Accepted

time: 6ms

memory: 3772kb

input:

output:

result:

ok

Test #16:

score: 0

Accepted

time: 0ms

memory: 3796kb

input:

output:

result:

ok

Test #17:

score: 0

Accepted

time: 0ms

memory: 3864kb

input:

output:

result:

ok

Test #18:

score: 0

Accepted

time: 9ms

memory: 3792kb

input:

output:

result:

ok

Test #19:

score: 0

Accepted

time: 3ms

memory: 3792kb

input:

output:

result:

ok

Test #20:

score: 0

Accepted

time: 3ms

memory: 3792kb

input:

output:

result:

ok

Test #21:

score: 0

Accepted

time: 11ms

memory: 3768kb

input:

output:

result:

ok

Test #22:

score: 0

Accepted

time: 3ms

memory: 4056kb

input:

output:

result:

ok

Test #23:

score: 0

Accepted

time: 2ms

memory: 4024kb

input:

output:

result:

ok

Subtask #2:

score: 15

Accepted

Test #24:

score: 15

Accepted

time: 18ms

memory: 3800kb

input:

output:

result:

ok

Test #25:

score: 0

Accepted

time: 25ms

memory: 3796kb

input:

output:

result:

ok

Test #26:

score: 0

Accepted

time: 16ms

memory: 4032kb

input:

output:

result:

ok

Test #27:

score: 0

Accepted

time: 25ms

memory: 3780kb

input:

output:

result:

ok

Test #28:

score: 0

Accepted

time: 15ms

memory: 4072kb

input:

output:

result:

ok

Test #29:

score: 0

Accepted

time: 55ms

memory: 4076kb

input:

output:

result:

ok

Test #30:

score: 0

Accepted

time: 38ms

memory: 3780kb

input:

output:

result:

ok

Test #31:

score: 0

Accepted

time: 36ms

memory: 3872kb

input:

output:

result:

ok

Test #32:

score: 0

Accepted

time: 5ms

memory: 3796kb

input:

output:

result:

ok

Test #33:

score: 0

Accepted

time: 39ms

memory: 4076kb

input:

output:

result:

ok

Test #34:

score: 0

Accepted

time: 17ms

memory: 3784kb

input:

output:

result:

ok

Test #35:

score: 0

Accepted

time: 32ms

memory: 3804kb

input:

output:

result:

ok

Test #36:

score: 0

Accepted

time: 24ms

memory: 4076kb

input:

output:

result:

ok

Test #37:

score: 0

Accepted

time: 14ms

memory: 3780kb

input:

output:

result:

ok

Test #38:

score: 0

Accepted

time: 28ms

memory: 3804kb

input:

output:

result:

ok

Test #39:

score: 0

Accepted

time: 16ms

memory: 3804kb

input:

output:

result:

ok

Test #40:

score: 0

Accepted

time: 23ms

memory: 4064kb

input:

output:

result:

ok

Test #41:

score: 0

Accepted

time: 30ms

memory: 3796kb

input:

output:

result:

ok

Test #42:

score: 0

Accepted

time: 19ms

memory: 3776kb

input:

output:

result:

ok

Subtask #3:

score: 0

Wrong Answer

Test #43:

score: 75

Accepted

time: 0ms

memory: 4024kb

input:

output:

result:

ok

Test #44:

score: 75

Accepted

time: 0ms

memory: 3856kb

input:

output:

result:

ok

Test #45:

score: 75

Accepted

time: 1ms

memory: 3764kb

input:

output:

result:

ok

Test #46:

score: 70.33

Acceptable Answer

time: 1ms

memory: 3796kb

input:

output:

result:

points 0.93773333330 points  0.93773333330

Test #47:

score: 37.5

Acceptable Answer

time: 1ms

memory: 3728kb

input:

output:

result:

points 0.50 points  0.50

Test #48:

score: 0

Wrong Answer

time: 73ms

memory: 3804kb

input:

output:

result:

wrong answer Too many queries.