QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#143068	#4565. Rarest Insects	bashkort^#	57.41	30ms	4204kb	C++17	5.2kb	2023-08-20 15:05:04	2024-07-04 01:50:21

Judging History

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

[2024-07-04 01:50:21]
评测

测评结果：57.41
用时：30ms
内存：4204kb

查看

[2023-08-20 15:05:04]
提交

answer

#include "insects.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

int min_cardinality(int N) {
    vector<int> a(N);
    iota(a.begin(), a.end(), 0);
    shuffle(a.begin(), a.end(), rnd);
    
    vector<int> leaders, inside(N);
    int maxSize = 0, T = 0, lastQueryT = 0;
    int queriesCnt[3]{};

    auto insert = [&](int x) -> void {
        if (inside[x]) {
            return;
        }
        move_inside(x);
        T += 1;
        queriesCnt[0] += 1;
        inside[x] = true;
    };

    auto erase = [&](int x) -> void {
        if (!inside[x]) {
            return;
        }
        move_outside(x);
        T += 1;
        queriesCnt[1] += 1;
        inside[x] = false;
    };

    auto query = [&]() -> int {
        if (T == lastQueryT) {
            return maxSize;
        }
        lastQueryT = T;
        queriesCnt[2] += 1;
        return maxSize = press_button();
    };

    vector<int> others, lo(N, -1), hi(N, -1);

    for (int x : a) {
        insert(x);
        if (query() == 1) {
            leaders.push_back(x);
        } else {
            others.push_back(x);
            lo[x] = -1, hi[x] = size(leaders) - 1;
            erase(x);
        }
    };

    int ans = N;

    int minPos = 0, maxPos = size(leaders), full = true;
    int m = size(leaders);
    vector<vector<int>> queries(m);
    vector<int> siz(m);

    while (true) {
        for (int i = 0; i < m; ++i) {
            queries[i].clear();
        }
        minPos = N, maxPos = 0;
        for (int i = 0; i < N; ++i) {
            if (lo[i] + 1 < hi[i]) {
                int mid = lo[i] + hi[i] >> 1;
                minPos = min(minPos, mid), maxPos = max(maxPos, mid);
                queries[lo[i] + hi[i] >> 1].push_back(i);
            }
        }
        if (minPos > maxPos) {
            break;
        }
        full = rnd() % 2;
        if (full) {
            for (int i = m - 1; i > maxPos; --i) {
                erase(leaders[i]);
            }
            for (int i = 0; i <= maxPos; ++i) {
                insert(leaders[i]);
            }
            for (int i = maxPos; i >= minPos; --i) {
                for (int x : queries[i]) {
                    insert(x);
                    if (query() == 2) {
                        hi[x] = i;
                        if (lo[x] + 1 < hi[x]) {
                            int mid = lo[x] + hi[x] >> 1;
                            if (mid >= minPos) {
                                queries[mid].push_back(x);
                            }
                        }
                    } else {
                        lo[x] = i;
                    }
                    erase(x);
                }
                if (i > minPos) {
                    erase(leaders[i]);
                }
            }
            full = false;
        } else {
            for (int i = m - 1; i > minPos; --i) {
                erase(leaders[i]);
            }
            for (int i = 0; i < minPos; ++i) {
                insert(leaders[i]);
            }
            for (int i = minPos; i <= maxPos; ++i) {
                insert(leaders[i]);
                for (int x : queries[i]) {
                    insert(x);
                    if (query() == 2) {
                        hi[x] = i;
                    } else {
                        lo[x] = i;
                        if (lo[x] + 1 < hi[x]) {
                            int mid = lo[x] + hi[x] >> 1;
                            if (mid <= maxPos) {
                                queries[mid].push_back(x);
                            }
                        }
                    }
                    erase(x);
                }
            }
            full = true;
        }
    }

    for (int i = 0; i < N; ++i) {
        if (hi[i] != -1) {
            siz[hi[i]] += 1;
        }
    }

    for (int i = 0; i < m; ++i) {
        ans = min(ans, 1 + siz[i]);
    }

    auto dfs = [&](auto dfs, vector<int> lead, vector<int> oth, int isFull) -> void {
        if (ans == 1) {
            return;
        }
        if (size(lead) == 1) {
            ans = min<int>(ans, 1 + size(oth));
            return;
        }
        if (size(lead) > size(oth)) {
            ans = 1;
            return;
        }
        int mid = size(lead) / 2;
        vector<int> leadLeft(lead.begin(), lead.begin() + mid);
        vector<int> leadRight(lead.begin() + mid, lead.end());
        vector<int> nxt[2];
        if (isFull) {
            for (int x : leadRight) {
                erase(x);
            }
        } else {
            for (int x : leadLeft) {
                insert(x);
            }
        }
        for (int x : oth) {
            insert(x);
            if (query() == 1) {
                nxt[1].push_back(x);
            } else {
                nxt[0].push_back(x);
            }
            erase(x);
        }
        dfs(dfs, leadLeft, nxt[0], true);
        dfs(dfs, leadRight, nxt[1], false);
    };

    // dfs(dfs, leaders, others, true);

    return ans;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 10

Accepted

Test #1:

score: 10

Accepted

time: 1ms

memory: 3804kb

input:

output:

result:

ok

Test #2:

score: 0

Accepted

time: 1ms

memory: 3844kb

input:

2
1
2

output:

result:

ok

Test #3:

score: 0

Accepted

time: 0ms

memory: 3860kb

input:

2
1
1

output:

result:

ok

Test #4:

score: 0

Accepted

time: 1ms

memory: 3848kb

input:

output:

result:

ok

Test #5:

score: 0

Accepted

time: 0ms

memory: 3776kb

input:

output:

result:

ok

Test #6:

score: 0

Accepted

time: 1ms

memory: 3800kb

input:

output:

result:

ok

Test #7:

score: 0

Accepted

time: 1ms

memory: 4072kb

input:

output:

result:

ok

Test #8:

score: 0

Accepted

time: 1ms

memory: 3808kb

input:

output:

result:

ok

Test #9:

score: 0

Accepted

time: 0ms

memory: 3784kb

input:

output:

result:

ok

Test #10:

score: 0

Accepted

time: 5ms

memory: 3740kb

input:

output:

result:

ok

Test #11:

score: 0

Accepted

time: 2ms

memory: 3944kb

input:

output:

result:

ok

Test #12:

score: 0

Accepted

time: 0ms

memory: 3788kb

input:

output:

result:

ok

Test #13:

score: 0

Accepted

time: 2ms

memory: 3808kb

input:

output:

result:

ok

Test #14:

score: 0

Accepted

time: 6ms

memory: 4072kb

input:

output:

result:

ok

Test #15:

score: 0

Accepted

time: 4ms

memory: 3812kb

input:

output:

result:

ok

Test #16:

score: 0

Accepted

time: 0ms

memory: 4084kb

input:

output:

result:

ok

Test #17:

score: 0

Accepted

time: 2ms

memory: 3872kb

input:

output:

result:

ok

Test #18:

score: 0

Accepted

time: 0ms

memory: 3808kb

input:

output:

result:

ok

Test #19:

score: 0

Accepted

time: 0ms

memory: 3784kb

input:

output:

result:

ok

Test #20:

score: 0

Accepted

time: 0ms

memory: 3864kb

input:

output:

result:

ok

Test #21:

score: 0

Accepted

time: 6ms

memory: 4036kb

input:

output:

result:

ok

Test #22:

score: 0

Accepted

time: 2ms

memory: 4044kb

input:

output:

result:

ok

Test #23:

score: 0

Accepted

time: 4ms

memory: 4024kb

input:

output:

result:

ok

Subtask #2:

score: 15

Accepted

Test #24:

score: 15

Accepted

time: 0ms

memory: 3964kb

input:

output:

result:

ok

Test #25:

score: 0

Accepted

time: 0ms

memory: 3916kb

input:

output:

result:

ok

Test #26:

score: 0

Accepted

time: 0ms

memory: 3836kb

input:

output:

result:

ok

Test #27:

score: 0

Accepted

time: 4ms

memory: 4072kb

input:

output:

result:

ok

Test #28:

score: 0

Accepted

time: 6ms

memory: 3824kb

input:

output:

result:

ok

Test #29:

score: 0

Accepted

time: 9ms

memory: 3904kb

input:

output:

result:

ok

Test #30:

score: 0

Accepted

time: 5ms

memory: 3876kb

input:

output:

result:

ok

Test #31:

score: 0

Accepted

time: 11ms

memory: 3840kb

input:

output:

result:

ok

Test #32:

score: 0

Accepted

time: 8ms

memory: 4068kb

input:

output:

result:

ok

Test #33:

score: 0

Accepted

time: 4ms

memory: 3808kb

input:

output:

result:

ok

Test #34:

score: 0

Accepted

time: 14ms

memory: 4072kb

input:

output:

result:

ok

Test #35:

score: 0

Accepted

time: 11ms

memory: 3808kb

input:

output:

result:

ok

Test #36:

score: 0

Accepted

time: 0ms

memory: 3976kb

input:

output:

result:

ok

Test #37:

score: 0

Accepted

time: 11ms

memory: 4108kb

input:

output:

result:

ok

Test #38:

score: 0

Accepted

time: 0ms

memory: 4112kb

input:

output:

result:

ok

Test #39:

score: 0

Accepted

time: 5ms

memory: 4112kb

input:

output:

result:

ok

Test #40:

score: 0

Accepted

time: 13ms

memory: 3892kb

input:

output:

result:

ok

Test #41:

score: 0

Accepted

time: 0ms

memory: 3920kb

input:

output:

result:

ok

Test #42:

score: 0

Accepted

time: 6ms

memory: 4124kb

input:

output:

result:

ok

Subtask #3:

score: 32.41

Acceptable Answer

Test #43:

score: 75

Accepted

time: 1ms

memory: 3840kb

input:

2
1
2

output:

result:

ok

Test #44:

score: 75

Accepted

time: 0ms

memory: 4064kb

input:

2
1
1

output:

result:

ok

Test #45:

score: 75

Accepted

time: 0ms

memory: 3804kb

input:

output:

result:

ok

Test #46:

score: 75

Accepted

time: 0ms

memory: 3940kb

input:

output:

result:

ok

Test #47:

score: 75

Accepted

time: 1ms

memory: 3844kb

input:

output:

result:

ok

Test #48:

score: 75

Accepted

time: 0ms

memory: 3856kb

input:

output:

result:

ok

Test #49:

score: 75

Accepted

time: 0ms

memory: 4168kb

input:

output:

result:

ok

Test #50:

score: 50.31

Acceptable Answer

time: 15ms

memory: 3872kb

input:

output:

result:

points 0.67080 points  0.67080

Test #51:

score: 50.69

Acceptable Answer

time: 11ms

memory: 3964kb

input:

output:

result:

points 0.67586666670 points  0.67586666670

Test #52:

score: 75

Accepted

time: 0ms

memory: 3836kb

input:

output:

result:

ok

Test #53:

score: 61.63

Acceptable Answer

time: 19ms

memory: 4156kb

input:

output:

result:

points 0.82173333330 points  0.82173333330

Test #54:

score: 74.06

Acceptable Answer

time: 3ms

memory: 3868kb

input:

output:

result:

points 0.98746666670 points  0.98746666670

Test #55:

score: 50.28

Acceptable Answer

time: 19ms

memory: 3956kb

input:

output:

result:

points 0.67040 points  0.67040

Test #56:

score: 73.27

Acceptable Answer

time: 4ms

memory: 4136kb

input:

output:

result:

points 0.97693333330 points  0.97693333330

Test #57:

score: 70.39

Acceptable Answer

time: 5ms

memory: 4008kb

input:

output:

result:

points 0.93853333330 points  0.93853333330

Test #58:

score: 68.16

Acceptable Answer

time: 26ms

memory: 4148kb

input:

output:

result:

points 0.90880 points  0.90880

Test #59:

score: 66.41

Acceptable Answer

time: 15ms

memory: 3876kb

input:

output:

result:

points 0.88546666670 points  0.88546666670

Test #60:

score: 64.95

Acceptable Answer

time: 4ms

memory: 3900kb

input:

output:

result:

points 0.8660 points  0.8660

Test #61:

score: 61.8

Acceptable Answer

time: 17ms

memory: 3928kb

input:

output:

result:

points 0.8240 points  0.8240

Test #62:

score: 48.49

Acceptable Answer

time: 15ms

memory: 4112kb

input:

output:

result:

points 0.64653333330 points  0.64653333330

Test #63:

score: 40.2

Acceptable Answer

time: 20ms

memory: 3880kb

input:

output:

result:

points 0.5360 points  0.5360

Test #64:

score: 35.29

Acceptable Answer

time: 19ms

memory: 4168kb

input:

output:

result:

points 0.47053333330 points  0.47053333330

Test #65:

score: 32.68

Acceptable Answer

time: 16ms

memory: 3908kb

input:

output:

result:

points 0.43573333330 points  0.43573333330

Test #66:

score: 34.01

Acceptable Answer

time: 15ms

memory: 4168kb

input:

output:

result:

points 0.45346666670 points  0.45346666670

Test #67:

score: 32.41

Acceptable Answer

time: 14ms

memory: 4184kb

input:

output:

result:

points 0.43213333330 points  0.43213333330

Test #68:

score: 46.69

Acceptable Answer

time: 19ms

memory: 3864kb

input:

output:

result:

points 0.62253333330 points  0.62253333330

Test #69:

score: 46.52

Acceptable Answer

time: 12ms

memory: 3960kb

input:

output:

result:

points 0.62026666670 points  0.62026666670

Test #70:

score: 57.86

Acceptable Answer

time: 8ms

memory: 3948kb

input:

output:

result:

points 0.77146666670 points  0.77146666670

Test #71:

score: 57.77

Acceptable Answer

time: 7ms

memory: 4088kb

input:

output:

result:

points 0.77026666670 points  0.77026666670

Test #72:

score: 46.5

Acceptable Answer

time: 17ms

memory: 4024kb

input:

output:

result:

points 0.620 points  0.620

Test #73:

score: 46.83

Acceptable Answer

time: 16ms

memory: 4152kb

input:

output:

result:

points 0.62440 points  0.62440

Test #74:

score: 39.64

Acceptable Answer

time: 24ms

memory: 3900kb

input:

output:

result:

points 0.52853333330 points  0.52853333330

Test #75:

score: 39.46

Acceptable Answer

time: 11ms

memory: 4168kb

input:

output:

result:

points 0.52613333330 points  0.52613333330

Test #76:

score: 47.06

Acceptable Answer

time: 16ms

memory: 4168kb

input:

output:

result:

points 0.62746666670 points  0.62746666670

Test #77:

score: 46.95

Acceptable Answer

time: 30ms

memory: 4120kb

input:

output:

result:

points 0.6260 points  0.6260

Test #78:

score: 46.45

Acceptable Answer

time: 14ms

memory: 4124kb

input:

output:

result:

points 0.61933333330 points  0.61933333330

Test #79:

score: 46.36

Acceptable Answer

time: 10ms

memory: 3860kb

input:

output:

result:

points 0.61813333330 points  0.61813333330

Test #80:

score: 39.17

Acceptable Answer

time: 0ms

memory: 3908kb

input:

output:

result:

points 0.52226666670 points  0.52226666670

Test #81:

score: 39.02

Acceptable Answer

time: 19ms

memory: 3904kb

input:

output:

result:

points 0.52026666670 points  0.52026666670

Test #82:

score: 46.87

Acceptable Answer

time: 13ms

memory: 3936kb

input:

output:

result:

points 0.62493333330 points  0.62493333330

Test #83:

score: 46.55

Acceptable Answer

time: 10ms

memory: 4124kb

input:

output:

result:

points 0.62066666670 points  0.62066666670

Test #84:

score: 71.96

Acceptable Answer

time: 0ms

memory: 3792kb

input:

output:

result:

points 0.95946666670 points  0.95946666670

Test #85:

score: 73.39

Acceptable Answer

time: 13ms

memory: 4100kb

input:

output:

result:

points 0.97853333330 points  0.97853333330

Test #86:

score: 75

Accepted

time: 7ms

memory: 3868kb

input:

output:

result:

ok

Test #87:

score: 60.69

Acceptable Answer

time: 20ms

memory: 4204kb

input:

output:

result:

points 0.80920 points  0.80920

Test #88:

score: 61.05

Acceptable Answer

time: 15ms

memory: 3932kb

input:

output:

result:

points 0.8140 points  0.8140

Test #89:

score: 64.47

Acceptable Answer

time: 15ms

memory: 3924kb

input:

output:

result:

points 0.85960 points  0.85960