QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#143235	#4565. Rarest Insects	bashkort	61.82	54ms	3956kb	C++17	5.6kb	2023-08-20 22:42:03	2023-08-20 22:42:06

Judging History

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

[2023-08-20 22:42:06]
评测

测评结果：61.82
用时：54ms
内存：3956kb

查看

[2023-08-20 22:42:03]
提交

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);
    
    for (int t = 0; t < 3; ++t) {
        for (int i = 0; i < N; ++i) {
            swap(a[i], a[rnd() % N]);
        }
    }
    
    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;

    if (0) {
        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: 0ms

memory: 3836kb

input:

output:

result:

ok

Test #2:

score: 0

Accepted

time: 1ms

memory: 3716kb

input:

2
1
2

output:

result:

ok

Test #3:

score: 0

Accepted

time: 1ms

memory: 3648kb

input:

2
1
1

output:

result:

ok

Test #4:

score: 0

Accepted

time: 1ms

memory: 3708kb

input:

output:

result:

ok

Test #5:

score: 0

Accepted

time: 1ms

memory: 3840kb

input:

output:

result:

ok

Test #6:

score: 0

Accepted

time: 2ms

memory: 3816kb

input:

output:

result:

ok

Test #7:

score: 0

Accepted

time: 5ms

memory: 3716kb

input:

output:

result:

ok

Test #8:

score: 0

Accepted

time: 1ms

memory: 3708kb

input:

output:

result:

ok

Test #9:

score: 0

Accepted

time: 9ms

memory: 3716kb

input:

output:

result:

ok

Test #10:

score: 0

Accepted

time: 5ms

memory: 3716kb

input:

output:

result:

ok

Test #11:

score: 0

Accepted

time: 0ms

memory: 3712kb

input:

output:

result:

ok

Test #12:

score: 0

Accepted

time: 5ms

memory: 3720kb

input:

output:

result:

ok

Test #13:

score: 0

Accepted

time: 1ms

memory: 3716kb

input:

output:

result:

ok

Test #14:

score: 0

Accepted

time: 7ms

memory: 3716kb

input:

output:

result:

ok

Test #15:

score: 0

Accepted

time: 5ms

memory: 3712kb

input:

output:

result:

ok

Test #16:

score: 0

Accepted

time: 14ms

memory: 3656kb

input:

output:

result:

ok

Test #17:

score: 0

Accepted

time: 13ms

memory: 3720kb

input:

output:

result:

ok

Test #18:

score: 0

Accepted

time: 4ms

memory: 3800kb

input:

output:

result:

ok

Test #19:

score: 0

Accepted

time: 0ms

memory: 3792kb

input:

output:

result:

ok

Test #20:

score: 0

Accepted

time: 0ms

memory: 3840kb

input:

output:

result:

ok

Test #21:

score: 0

Accepted

time: 4ms

memory: 3716kb

input:

output:

result:

ok

Test #22:

score: 0

Accepted

time: 0ms

memory: 3824kb

input:

output:

result:

ok

Test #23:

score: 0

Accepted

time: 0ms

memory: 3704kb

input:

output:

result:

ok

Subtask #2:

score: 15

Accepted

Test #24:

score: 15

Accepted

time: 4ms

memory: 3852kb

input:

output:

result:

ok

Test #25:

score: 0

Accepted

time: 12ms

memory: 3848kb

input:

output:

result:

ok

Test #26:

score: 0

Accepted

time: 7ms

memory: 3692kb

input:

output:

result:

ok

Test #27:

score: 0

Accepted

time: 0ms

memory: 3744kb

input:

output:

result:

ok

Test #28:

score: 0

Accepted

time: 4ms

memory: 3856kb

input:

output:

result:

ok

Test #29:

score: 0

Accepted

time: 15ms

memory: 3744kb

input:

output:

result:

ok

Test #30:

score: 0

Accepted

time: 6ms

memory: 3744kb

input:

output:

result:

ok

Test #31:

score: 0

Accepted

time: 19ms

memory: 3800kb

input:

output:

result:

ok

Test #32:

score: 0

Accepted

time: 8ms

memory: 3752kb

input:

output:

result:

ok

Test #33:

score: 0

Accepted

time: 9ms

memory: 3744kb

input:

output:

result:

ok

Test #34:

score: 0

Accepted

time: 7ms

memory: 3756kb

input:

output:

result:

ok

Test #35:

score: 0

Accepted

time: 6ms

memory: 3864kb

input:

output:

result:

ok

Test #36:

score: 0

Accepted

time: 10ms

memory: 3744kb

input:

output:

result:

ok

Test #37:

score: 0

Accepted

time: 29ms

memory: 3756kb

input:

output:

result:

ok

Test #38:

score: 0

Accepted

time: 5ms

memory: 3748kb

input:

output:

result:

ok

Test #39:

score: 0

Accepted

time: 8ms

memory: 3876kb

input:

output:

result:

ok

Test #40:

score: 0

Accepted

time: 1ms

memory: 3740kb

input:

output:

result:

ok

Test #41:

score: 0

Accepted

time: 1ms

memory: 3752kb

input:

output:

result:

ok

Test #42:

score: 0

Accepted

time: 8ms

memory: 3844kb

input:

output:

result:

ok

Subtask #3:

score: 36.82

Acceptable Answer

Test #43:

score: 75

Accepted

time: 1ms

memory: 3752kb

input:

2
1
2

output:

result:

ok

Test #44:

score: 75

Accepted

time: 0ms

memory: 3832kb

input:

2
1
1

output:

result:

ok

Test #45:

score: 75

Accepted

time: 1ms

memory: 3704kb

input:

output:

result:

ok

Test #46:

score: 75

Accepted

time: 0ms

memory: 3788kb

input:

output:

result:

ok

Test #47:

score: 75

Accepted

time: 1ms

memory: 3760kb

input:

output:

result:

ok

Test #48:

score: 75

Accepted

time: 0ms

memory: 3812kb

input:

output:

result:

ok

Test #49:

score: 75

Accepted

time: 1ms

memory: 3764kb

input:

output:

result:

ok

Test #50:

score: 50.58

Acceptable Answer

time: 25ms

memory: 3868kb

input:

output:

result:

points 0.67440 points  0.67440

Test #51:

score: 50.73

Acceptable Answer

time: 22ms

memory: 3808kb

input:

output:

result:

points 0.67640 points  0.67640

Test #52:

score: 75

Accepted

time: 25ms

memory: 3780kb

input:

output:

result:

ok

Test #53:

score: 60.83

Acceptable Answer

time: 31ms

memory: 3788kb

input:

output:

result:

points 0.81106666670 points  0.81106666670

Test #54:

score: 73.98

Acceptable Answer

time: 5ms

memory: 3908kb

input:

output:

result:

points 0.98640 points  0.98640

Test #55:

score: 50.67

Acceptable Answer

time: 54ms

memory: 3908kb

input:

output:

result:

points 0.67560 points  0.67560

Test #56:

score: 73.4

Acceptable Answer

time: 7ms

memory: 3792kb

input:

output:

result:

points 0.97866666670 points  0.97866666670

Test #57:

score: 70.39

Acceptable Answer

time: 9ms

memory: 3784kb

input:

output:

result:

points 0.93853333330 points  0.93853333330

Test #58:

score: 68.27

Acceptable Answer

time: 17ms

memory: 3760kb

input:

output:

result:

points 0.91026666670 points  0.91026666670

Test #59:

score: 66.68

Acceptable Answer

time: 5ms

memory: 3792kb

input:

output:

result:

points 0.88906666670 points  0.88906666670

Test #60:

score: 64.91

Acceptable Answer

time: 29ms

memory: 3876kb

input:

output:

result:

points 0.86546666670 points  0.86546666670

Test #61:

score: 61.81

Acceptable Answer

time: 21ms

memory: 3916kb

input:

output:

result:

points 0.82413333330 points  0.82413333330

Test #62:

score: 48.86

Acceptable Answer

time: 34ms

memory: 3792kb

input:

output:

result:

points 0.65146666670 points  0.65146666670

Test #63:

score: 41.32

Acceptable Answer

time: 15ms

memory: 3788kb

input:

output:

result:

points 0.55093333330 points  0.55093333330

Test #64:

score: 36.82

Acceptable Answer

time: 41ms

memory: 3792kb

input:

output:

result:

points 0.49093333330 points  0.49093333330

Test #65:

score: 75

Accepted

time: 8ms

memory: 3792kb

input:

output:

result:

ok

Test #66:

score: 75

Accepted

time: 10ms

memory: 3792kb

input:

output:

result:

ok

Test #67:

score: 75

Accepted

time: 4ms

memory: 3772kb

input:

output:

result:

ok

Test #68:

score: 46.95

Acceptable Answer

time: 45ms

memory: 3772kb

input:

output:

result:

points 0.6260 points  0.6260

Test #69:

score: 46.95

Acceptable Answer

time: 32ms

memory: 3780kb

input:

output:

result:

points 0.6260 points  0.6260

Test #70:

score: 58

Acceptable Answer

time: 17ms

memory: 3784kb

input:

output:

result:

points 0.77333333330 points  0.77333333330

Test #71:

score: 58

Acceptable Answer

time: 24ms

memory: 3780kb

input:

output:

result:

points 0.77333333330 points  0.77333333330

Test #72:

score: 46.95

Acceptable Answer

time: 39ms

memory: 3860kb

input:

output:

result:

points 0.6260 points  0.6260

Test #73:

score: 46.95

Acceptable Answer

time: 36ms

memory: 3864kb

input:

output:

result:

points 0.6260 points  0.6260

Test #74:

score: 40.26

Acceptable Answer

time: 54ms

memory: 3784kb

input:

output:

result:

points 0.53680 points  0.53680

Test #75:

score: 40.26

Acceptable Answer

time: 35ms

memory: 3912kb

input:

output:

result:

points 0.53680 points  0.53680

Test #76:

score: 47.26

Acceptable Answer

time: 40ms

memory: 3864kb

input:

output:

result:

points 0.63013333330 points  0.63013333330

Test #77:

score: 47.25

Acceptable Answer

time: 30ms

memory: 3912kb

input:

output:

result:

points 0.630 points  0.630

Test #78:

score: 46.95

Acceptable Answer

time: 11ms

memory: 3784kb

input:

output:

result:

points 0.6260 points  0.6260

Test #79:

score: 46.95

Acceptable Answer

time: 51ms

memory: 3780kb

input:

output:

result:

points 0.6260 points  0.6260

Test #80:

score: 40.19

Acceptable Answer

time: 20ms

memory: 3916kb

input:

output:

result:

points 0.53586666670 points  0.53586666670

Test #81:

score: 40.2

Acceptable Answer

time: 23ms

memory: 3784kb

input:

output:

result:

points 0.5360 points  0.5360

Test #82:

score: 47.09

Acceptable Answer

time: 18ms

memory: 3784kb

input:

output:

result:

points 0.62786666670 points  0.62786666670

Test #83:

score: 47.08

Acceptable Answer

time: 33ms

memory: 3908kb

input:

output:

result:

points 0.62773333330 points  0.62773333330

Test #84:

score: 74.17

Acceptable Answer

time: 17ms

memory: 3732kb

input:

output:

result:

points 0.98893333330 points  0.98893333330

Test #85:

score: 70.54

Acceptable Answer

time: 23ms

memory: 3880kb

input:

output:

result:

points 0.94053333330 points  0.94053333330

Test #86:

score: 75

Accepted

time: 4ms

memory: 3772kb

input:

output:

result:

ok

Test #87:

score: 60.83

Acceptable Answer

time: 22ms

memory: 3956kb

input:

output:

result:

points 0.81106666670 points  0.81106666670

Test #88:

score: 60.83

Acceptable Answer

time: 23ms

memory: 3792kb

input:

output:

result:

points 0.81106666670 points  0.81106666670

Test #89:

score: 60.83

Acceptable Answer

time: 16ms

memory: 3864kb

input:

output:

result:

points 0.81106666670 points  0.81106666670