QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#143071	#4565. Rarest Insects	bashkort^#	59.9	41ms	4168kb	C++17	5.2kb	2023-08-20 15:10:38	2024-07-04 01:50:27

Judging History

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

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

测评结果：59.9
用时：41ms
内存：4168kb

查看

[2023-08-20 15:10:38]
提交

answer

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

using namespace std;
using ll = long long;

mt19937 rnd(228);

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;
        int l = m, r = 0;
        for (int i = 0; i < N; ++i) {
            if (lo[i] + 1 < hi[i]) {
                int mid = lo[i] + hi[i] >> 1;
                l = min(l, lo[i] + 1);
                r = max(r, hi[i]);
                minPos = min(minPos, mid), maxPos = max(maxPos, mid);
                queries[lo[i] + hi[i] >> 1].push_back(i);
            }
        }
        if (minPos > maxPos) {
            break;
        }
        if (full) {
            for (int i = r; i > maxPos; --i) {
                erase(leaders[i]);
            }
            for (int i = l; 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 = r; i > minPos; --i) {
                erase(leaders[i]);
            }
            for (int i = l; 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: 3780kb

input:

output:

result:

ok

Test #2:

score: 0

Accepted

time: 1ms

memory: 3804kb

input:

2
1
2

output:

result:

ok

Test #3:

score: 0

Accepted

time: 0ms

memory: 3804kb

input:

2
1
1

output:

result:

ok

Test #4:

score: 0

Accepted

time: 1ms

memory: 3800kb

input:

output:

result:

ok

Test #5:

score: 0

Accepted

time: 1ms

memory: 3800kb

input:

output:

result:

ok

Test #6:

score: 0

Accepted

time: 1ms

memory: 3780kb

input:

output:

result:

ok

Test #7:

score: 0

Accepted

time: 2ms

memory: 3736kb

input:

output:

result:

ok

Test #8:

score: 0

Accepted

time: 1ms

memory: 3744kb

input:

output:

result:

ok

Test #9:

score: 0

Accepted

time: 0ms

memory: 4040kb

input:

output:

result:

ok

Test #10:

score: 0

Accepted

time: 0ms

memory: 3744kb

input:

output:

result:

ok

Test #11:

score: 0

Accepted

time: 2ms

memory: 3784kb

input:

output:

result:

ok

Test #12:

score: 0

Accepted

time: 0ms

memory: 3880kb

input:

output:

result:

ok

Test #13:

score: 0

Accepted

time: 0ms

memory: 4068kb

input:

output:

result:

ok

Test #14:

score: 0

Accepted

time: 5ms

memory: 4068kb

input:

output:

result:

ok

Test #15:

score: 0

Accepted

time: 0ms

memory: 3784kb

input:

output:

result:

ok

Test #16:

score: 0

Accepted

time: 0ms

memory: 3884kb

input:

output:

result:

ok

Test #17:

score: 0

Accepted

time: 5ms

memory: 4088kb

input:

output:

result:

ok

Test #18:

score: 0

Accepted

time: 3ms

memory: 3788kb

input:

output:

result:

ok

Test #19:

score: 0

Accepted

time: 0ms

memory: 4072kb

input:

output:

result:

ok

Test #20:

score: 0

Accepted

time: 3ms

memory: 3788kb

input:

output:

result:

ok

Test #21:

score: 0

Accepted

time: 3ms

memory: 3808kb

input:

output:

result:

ok

Test #22:

score: 0

Accepted

time: 0ms

memory: 4040kb

input:

output:

result:

ok

Test #23:

score: 0

Accepted

time: 0ms

memory: 3872kb

input:

output:

result:

ok

Subtask #2:

score: 15

Accepted

Test #24:

score: 15

Accepted

time: 6ms

memory: 4088kb

input:

output:

result:

ok

Test #25:

score: 0

Accepted

time: 6ms

memory: 4112kb

input:

output:

result:

ok

Test #26:

score: 0

Accepted

time: 10ms

memory: 3840kb

input:

output:

result:

ok

Test #27:

score: 0

Accepted

time: 3ms

memory: 4112kb

input:

output:

result:

ok

Test #28:

score: 0

Accepted

time: 0ms

memory: 3800kb

input:

output:

result:

ok

Test #29:

score: 0

Accepted

time: 8ms

memory: 3860kb

input:

output:

result:

ok

Test #30:

score: 0

Accepted

time: 7ms

memory: 3900kb

input:

output:

result:

ok

Test #31:

score: 0

Accepted

time: 17ms

memory: 3840kb

input:

output:

result:

ok

Test #32:

score: 0

Accepted

time: 0ms

memory: 4068kb

input:

output:

result:

ok

Test #33:

score: 0

Accepted

time: 12ms

memory: 3812kb

input:

output:

result:

ok

Test #34:

score: 0

Accepted

time: 0ms

memory: 3892kb

input:

output:

result:

ok

Test #35:

score: 0

Accepted

time: 8ms

memory: 3896kb

input:

output:

result:

ok

Test #36:

score: 0

Accepted

time: 3ms

memory: 3908kb

input:

output:

result:

ok

Test #37:

score: 0

Accepted

time: 14ms

memory: 3916kb

input:

output:

result:

ok

Test #38:

score: 0

Accepted

time: 8ms

memory: 3916kb

input:

output:

result:

ok

Test #39:

score: 0

Accepted

time: 5ms

memory: 4112kb

input:

output:

result:

ok

Test #40:

score: 0

Accepted

time: 0ms

memory: 3828kb

input:

output:

result:

ok

Test #41:

score: 0

Accepted

time: 4ms

memory: 3832kb

input:

output:

result:

ok

Test #42:

score: 0

Accepted

time: 5ms

memory: 3888kb

input:

output:

result:

ok

Subtask #3:

score: 34.9

Acceptable Answer

Test #43:

score: 75

Accepted

time: 1ms

memory: 3804kb

input:

2
1
2

output:

result:

ok

Test #44:

score: 75

Accepted

time: 1ms

memory: 4032kb

input:

2
1
1

output:

result:

ok

Test #45:

score: 75

Accepted

time: 1ms

memory: 4076kb

input:

output:

result:

ok

Test #46:

score: 75

Accepted

time: 1ms

memory: 3780kb

input:

output:

result:

ok

Test #47:

score: 75

Accepted

time: 1ms

memory: 3796kb

input:

output:

result:

ok

Test #48:

score: 75

Accepted

time: 0ms

memory: 3828kb

input:

output:

result:

ok

Test #49:

score: 75

Accepted

time: 7ms

memory: 3880kb

input:

output:

result:

ok

Test #50:

score: 50.56

Acceptable Answer

time: 25ms

memory: 4124kb

input:

output:

result:

points 0.67413333330 points  0.67413333330

Test #51:

score: 50.45

Acceptable Answer

time: 14ms

memory: 3872kb

input:

output:

result:

points 0.67266666670 points  0.67266666670

Test #52:

score: 75

Accepted

time: 3ms

memory: 3860kb

input:

output:

result:

ok

Test #53:

score: 64.3

Acceptable Answer

time: 0ms

memory: 3900kb

input:

output:

result:

points 0.85733333330 points  0.85733333330

Test #54:

score: 74.28

Acceptable Answer

time: 10ms

memory: 4144kb

input:

output:

result:

points 0.99040 points  0.99040

Test #55:

score: 50.73

Acceptable Answer

time: 16ms

memory: 4152kb

input:

output:

result:

points 0.67640 points  0.67640

Test #56:

score: 73.36

Acceptable Answer

time: 7ms

memory: 3876kb

input:

output:

result:

points 0.97813333330 points  0.97813333330

Test #57:

score: 70.39

Acceptable Answer

time: 4ms

memory: 3852kb

input:

output:

result:

points 0.93853333330 points  0.93853333330

Test #58:

score: 68.19

Acceptable Answer

time: 14ms

memory: 4104kb

input:

output:

result:

points 0.90920 points  0.90920

Test #59:

score: 66.66

Acceptable Answer

time: 5ms

memory: 3856kb

input:

output:

result:

points 0.88880 points  0.88880

Test #60:

score: 64.94

Acceptable Answer

time: 0ms

memory: 4152kb

input:

output:

result:

points 0.86586666670 points  0.86586666670

Test #61:

score: 62.01

Acceptable Answer

time: 22ms

memory: 3940kb

input:

output:

result:

points 0.82680 points  0.82680

Test #62:

score: 49.1

Acceptable Answer

time: 6ms

memory: 3956kb

input:

output:

result:

points 0.65466666670 points  0.65466666670

Test #63:

score: 41.26

Acceptable Answer

time: 24ms

memory: 3904kb

input:

output:

result:

points 0.55013333330 points  0.55013333330

Test #64:

score: 36.44

Acceptable Answer

time: 11ms

memory: 3908kb

input:

output:

result:

points 0.48586666670 points  0.48586666670

Test #65:

score: 34.9

Acceptable Answer

time: 12ms

memory: 3836kb

input:

output:

result:

points 0.46533333330 points  0.46533333330

Test #66:

score: 37.56

Acceptable Answer

time: 29ms

memory: 3884kb

input:

output:

result:

points 0.50080 points  0.50080

Test #67:

score: 44.56

Acceptable Answer

time: 7ms

memory: 3972kb

input:

output:

result:

points 0.59413333330 points  0.59413333330

Test #68:

score: 46.87

Acceptable Answer

time: 32ms

memory: 4156kb

input:

output:

result:

points 0.62493333330 points  0.62493333330

Test #69:

score: 46.88

Acceptable Answer

time: 22ms

memory: 3896kb

input:

output:

result:

points 0.62506666670 points  0.62506666670

Test #70:

score: 58.01

Acceptable Answer

time: 4ms

memory: 3888kb

input:

output:

result:

points 0.77346666670 points  0.77346666670

Test #71:

score: 58.02

Acceptable Answer

time: 9ms

memory: 3860kb

input:

output:

result:

points 0.77360 points  0.77360

Test #72:

score: 46.95

Acceptable Answer

time: 18ms

memory: 3876kb

input:

output:

result:

points 0.6260 points  0.6260

Test #73:

score: 46.9

Acceptable Answer

time: 14ms

memory: 3872kb

input:

output:

result:

points 0.62533333330 points  0.62533333330

Test #74:

score: 40.12

Acceptable Answer

time: 15ms

memory: 3904kb

input:

output:

result:

points 0.53493333330 points  0.53493333330

Test #75:

score: 40.12

Acceptable Answer

time: 22ms

memory: 3880kb

input:

output:

result:

points 0.53493333330 points  0.53493333330

Test #76:

score: 47.23

Acceptable Answer

time: 17ms

memory: 3892kb

input:

output:

result:

points 0.62973333330 points  0.62973333330

Test #77:

score: 47.3

Acceptable Answer

time: 23ms

memory: 3896kb

input:

output:

result:

points 0.63066666670 points  0.63066666670

Test #78:

score: 46.88

Acceptable Answer

time: 10ms

memory: 3868kb

input:

output:

result:

points 0.62506666670 points  0.62506666670

Test #79:

score: 46.88

Acceptable Answer

time: 12ms

memory: 3896kb

input:

output:

result:

points 0.62506666670 points  0.62506666670

Test #80:

score: 40.09

Acceptable Answer

time: 41ms

memory: 4168kb

input:

output:

result:

points 0.53453333330 points  0.53453333330

Test #81:

score: 40.1

Acceptable Answer

time: 24ms

memory: 4164kb

input:

output:

result:

points 0.53466666670 points  0.53466666670

Test #82:

score: 47.02

Acceptable Answer

time: 5ms

memory: 3876kb

input:

output:

result:

points 0.62693333330 points  0.62693333330

Test #83:

score: 46.98

Acceptable Answer

time: 8ms

memory: 3888kb

input:

output:

result:

points 0.62640 points  0.62640

Test #84:

score: 75

Accepted

time: 2ms

memory: 3804kb

input:

output:

result:

ok

Test #85:

score: 71.44

Acceptable Answer

time: 22ms

memory: 3848kb

input:

output:

result:

points 0.95253333330 points  0.95253333330

Test #86:

score: 75

Accepted

time: 3ms

memory: 4128kb

input:

output:

result:

ok

Test #87:

score: 64.44

Acceptable Answer

time: 23ms

memory: 3928kb

input:

output:

result:

points 0.85920 points  0.85920

Test #88:

score: 62.41

Acceptable Answer

time: 11ms

memory: 3928kb

input:

output:

result:

points 0.83213333330 points  0.83213333330

Test #89:

score: 64.48

Acceptable Answer

time: 19ms

memory: 3996kb

input:

output:

result:

points 0.85973333330 points  0.85973333330