QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#143308	#4565. Rarest Insects	bashkort	54.77	57ms	3844kb	C++20	4.0kb	2023-08-21 01:42:46	2023-08-21 01:42:50

Judging History

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

[2023-08-21 01:42:50]
评测

测评结果：54.77
用时：57ms
内存：3844kb

查看

[2023-08-21 01:42:46]
提交

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, cntIn = 0, lastQueryT = 0;
    int queriesCnt[3]{};

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

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

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

    vector<int> others;

    for (int x : a) {
        insert(x);
        if (query() == 1) {
            leaders.push_back(x);
        } else {
            others.push_back(x);
            erase(x);
        }
    };


    int ans = N;
    if (size(leaders) > size(others)) {
        return 1;
    } else if (size(leaders) == 1) {
        return N;
    }

    if (0) {
        shuffle(leaders.begin(), leaders.end(), rnd);
        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;
    } else {
        shuffle(others.begin(), others.end(), rnd);
        int lo = 1, hi = 2 + size(others) / size(leaders);
        while (lo + 1 < hi) {
            int mid = lo + hi >> 1;
            if (query() > mid) {
                for (int x : others) {
                    erase(x);
                }
            }
            bool yay = size(leaders) * mid == cntIn;
            if (!yay) {
                int left = size(others) + size(leaders) - cntIn;
                for (int x : others) {
                    if (insert(x)) {
                        left -= 1;
                        if (query() > mid) {
                            erase(x);
                        }
                        if (size(leaders) * mid == cntIn) {
                            yay = true;
                            break;
                        } else if (size(leaders) * mid > cntIn + left) {
                            break;
                        }
                    }
                }
            }
            if (yay) {
                lo = mid;
            } else {
                hi = mid;
            }
        }
        return lo;
    }
}

源文件, 语言: C++20

詳細信息

Subtask #1:

score: 10

Accepted

Test #1:

score: 10

Accepted

time: 1ms

memory: 3744kb

input:

output:

result:

ok

Test #2:

score: 0

Accepted

time: 1ms

memory: 3696kb

input:

2
1
2

output:

result:

ok

Test #3:

score: 0

Accepted

time: 1ms

memory: 3696kb

input:

2
1
1

output:

result:

ok

Test #4:

score: 0

Accepted

time: 2ms

memory: 3692kb

input:

output:

result:

ok

Test #5:

score: 0

Accepted

time: 1ms

memory: 3764kb

input:

output:

result:

ok

Test #6:

score: 0

Accepted

time: 0ms

memory: 3704kb

input:

output:

result:

ok

Test #7:

score: 0

Accepted

time: 3ms

memory: 3756kb

input:

output:

result:

ok

Test #8:

score: 0

Accepted

time: 0ms

memory: 3720kb

input:

output:

result:

ok

Test #9:

score: 0

Accepted

time: 10ms

memory: 3692kb

input:

output:

result:

ok

Test #10:

score: 0

Accepted

time: 1ms

memory: 3704kb

input:

output:

result:

ok

Test #11:

score: 0

Accepted

time: 2ms

memory: 3704kb

input:

output:

result:

ok

Test #12:

score: 0

Accepted

time: 0ms

memory: 3704kb

input:

output:

result:

ok

Test #13:

score: 0

Accepted

time: 0ms

memory: 3716kb

input:

output:

result:

ok

Test #14:

score: 0

Accepted

time: 0ms

memory: 3764kb

input:

output:

result:

ok

Test #15:

score: 0

Accepted

time: 0ms

memory: 3788kb

input:

output:

result:

ok

Test #16:

score: 0

Accepted

time: 2ms

memory: 3696kb

input:

output:

result:

ok

Test #17:

score: 0

Accepted

time: 0ms

memory: 3708kb

input:

output:

result:

ok

Test #18:

score: 0

Accepted

time: 0ms

memory: 3712kb

input:

output:

result:

ok

Test #19:

score: 0

Accepted

time: 3ms

memory: 3700kb

input:

output:

result:

ok

Test #20:

score: 0

Accepted

time: 0ms

memory: 3696kb

input:

output:

result:

ok

Test #21:

score: 0

Accepted

time: 0ms

memory: 3712kb

input:

output:

result:

ok

Test #22:

score: 0

Accepted

time: 1ms

memory: 3720kb

input:

output:

result:

ok

Test #23:

score: 0

Accepted

time: 5ms

memory: 3704kb

input:

output:

result:

ok

Subtask #2:

score: 15

Accepted

Test #24:

score: 15

Accepted

time: 6ms

memory: 3832kb

input:

output:

result:

ok

Test #25:

score: 0

Accepted

time: 2ms

memory: 3780kb

input:

output:

result:

ok

Test #26:

score: 0

Accepted

time: 1ms

memory: 3712kb

input:

output:

result:

ok

Test #27:

score: 0

Accepted

time: 20ms

memory: 3712kb

input:

output:

result:

ok

Test #28:

score: 0

Accepted

time: 13ms

memory: 3720kb

input:

output:

result:

ok

Test #29:

score: 0

Accepted

time: 0ms

memory: 3768kb

input:

output:

result:

ok

Test #30:

score: 0

Accepted

time: 11ms

memory: 3728kb

input:

output:

result:

ok

Test #31:

score: 0

Accepted

time: 35ms

memory: 3716kb

input:

output:

result:

ok

Test #32:

score: 0

Accepted

time: 1ms

memory: 3780kb

input:

output:

result:

ok

Test #33:

score: 0

Accepted

time: 8ms

memory: 3732kb

input:

output:

result:

ok

Test #34:

score: 0

Accepted

time: 24ms

memory: 3796kb

input:

output:

result:

ok

Test #35:

score: 0

Accepted

time: 9ms

memory: 3712kb

input:

output:

result:

ok

Test #36:

score: 0

Accepted

time: 12ms

memory: 3720kb

input:

output:

result:

ok

Test #37:

score: 0

Accepted

time: 6ms

memory: 3712kb

input:

output:

result:

ok

Test #38:

score: 0

Accepted

time: 0ms

memory: 3712kb

input:

output:

result:

ok

Test #39:

score: 0

Accepted

time: 14ms

memory: 3736kb

input:

output:

result:

ok

Test #40:

score: 0

Accepted

time: 6ms

memory: 3800kb

input:

output:

result:

ok

Test #41:

score: 0

Accepted

time: 0ms

memory: 3804kb

input:

output:

result:

ok

Test #42:

score: 0

Accepted

time: 15ms

memory: 3732kb

input:

output:

result:

ok

Subtask #3:

score: 29.77

Acceptable Answer

Test #43:

score: 75

Accepted

time: 1ms

memory: 3704kb

input:

2
1
2

output:

result:

ok

Test #44:

score: 75

Accepted

time: 2ms

memory: 3780kb

input:

2
1
1

output:

result:

ok

Test #45:

score: 75

Accepted

time: 1ms

memory: 3688kb

input:

output:

result:

ok

Test #46:

score: 75

Accepted

time: 2ms

memory: 3756kb

input:

output:

result:

ok

Test #47:

score: 75

Accepted

time: 0ms

memory: 3648kb

input:

output:

result:

ok

Test #48:

score: 75

Accepted

time: 5ms

memory: 3724kb

input:

output:

result:

ok

Test #49:

score: 75

Accepted

time: 4ms

memory: 3748kb

input:

output:

result:

ok

Test #50:

score: 75

Accepted

time: 6ms

memory: 3744kb

input:

output:

result:

ok

Test #51:

score: 62.04

Acceptable Answer

time: 46ms

memory: 3796kb

input:

output:

result:

points 0.82720 points  0.82720

Test #52:

score: 29.99

Acceptable Answer

time: 29ms

memory: 3844kb

input:

output:

result:

points 0.39986666670 points  0.39986666670

Test #53:

score: 75

Accepted

time: 12ms

memory: 3788kb

input:

output:

result:

ok

Test #54:

score: 29.77

Acceptable Answer

time: 10ms

memory: 3728kb

input:

output:

result:

points 0.39693333330 points  0.39693333330

Test #55:

score: 57.99

Acceptable Answer

time: 23ms

memory: 3800kb

input:

output:

result:

points 0.77320 points  0.77320

Test #56:

score: 69.11

Acceptable Answer

time: 16ms

memory: 3844kb

input:

output:

result:

points 0.92146666670 points  0.92146666670

Test #57:

score: 69.17

Acceptable Answer

time: 10ms

memory: 3728kb

input:

output:

result:

points 0.92226666670 points  0.92226666670

Test #58:

score: 68.13

Acceptable Answer

time: 31ms

memory: 3688kb

input:

output:

result:

points 0.90840 points  0.90840

Test #59:

score: 67.55

Acceptable Answer

time: 26ms

memory: 3748kb

input:

output:

result:

points 0.90066666670 points  0.90066666670

Test #60:

score: 72.6

Acceptable Answer

time: 19ms

memory: 3792kb

input:

output:

result:

points 0.9680 points  0.9680

Test #61:

score: 67.2

Acceptable Answer

time: 16ms

memory: 3788kb

input:

output:

result:

points 0.8960 points  0.8960

Test #62:

score: 65.62

Acceptable Answer

time: 10ms

memory: 3732kb

input:

output:

result:

points 0.87493333330 points  0.87493333330

Test #63:

score: 72.34

Acceptable Answer

time: 13ms

memory: 3728kb

input:

output:

result:

points 0.96453333330 points  0.96453333330

Test #64:

score: 71.89

Acceptable Answer

time: 21ms

memory: 3736kb

input:

output:

result:

points 0.95853333330 points  0.95853333330

Test #65:

score: 75

Accepted

time: 22ms

memory: 3736kb

input:

output:

result:

ok

Test #66:

score: 75

Accepted

time: 10ms

memory: 3732kb

input:

output:

result:

ok

Test #67:

score: 75

Accepted

time: 8ms

memory: 3732kb

input:

output:

result:

ok

Test #68:

score: 75

Accepted

time: 12ms

memory: 3788kb

input:

output:

result:

ok

Test #69:

score: 75

Accepted

time: 0ms

memory: 3812kb

input:

output:

result:

ok

Test #70:

score: 75

Accepted

time: 11ms

memory: 3796kb

input:

output:

result:

ok

Test #71:

score: 75

Accepted

time: 19ms

memory: 3736kb

input:

output:

result:

ok

Test #72:

score: 62.01

Acceptable Answer

time: 21ms

memory: 3732kb

input:

output:

result:

points 0.82680 points  0.82680

Test #73:

score: 62.8

Acceptable Answer

time: 18ms

memory: 3724kb

input:

output:

result:

points 0.83733333330 points  0.83733333330

Test #74:

score: 68.78

Acceptable Answer

time: 23ms

memory: 3708kb

input:

output:

result:

points 0.91706666670 points  0.91706666670

Test #75:

score: 66.23

Acceptable Answer

time: 11ms

memory: 3736kb

input:

output:

result:

points 0.88306666670 points  0.88306666670

Test #76:

score: 75

Accepted

time: 22ms

memory: 3732kb

input:

output:

result:

ok

Test #77:

score: 75

Accepted

time: 8ms

memory: 3784kb

input:

output:

result:

ok

Test #78:

score: 62.79

Acceptable Answer

time: 57ms

memory: 3728kb

input:

output:

result:

points 0.83720 points  0.83720

Test #79:

score: 64.27

Acceptable Answer

time: 33ms

memory: 3784kb

input:

output:

result:

points 0.85693333330 points  0.85693333330

Test #80:

score: 75

Accepted

time: 10ms

memory: 3748kb

input:

output:

result:

ok

Test #81:

score: 75

Accepted

time: 13ms

memory: 3736kb

input:

output:

result:

ok

Test #82:

score: 75

Accepted

time: 5ms

memory: 3732kb

input:

output:

result:

ok

Test #83:

score: 75

Accepted

time: 3ms

memory: 3732kb

input:

output:

result:

ok

Test #84:

score: 50.04

Acceptable Answer

time: 6ms

memory: 3712kb

input:

output:

result:

points 0.66720 points  0.66720

Test #85:

score: 35.21

Acceptable Answer

time: 34ms

memory: 3792kb

input:

output:

result:

points 0.46946666670 points  0.46946666670

Test #86:

score: 75

Accepted

time: 13ms

memory: 3728kb

input:

output:

result:

ok

Test #87:

score: 75

Accepted

time: 0ms

memory: 3732kb

input:

output:

result:

ok

Test #88:

score: 75

Accepted

time: 12ms

memory: 3780kb

input:

output:

result:

ok

Test #89:

score: 75

Accepted

time: 6ms

memory: 3728kb

input:

output:

result:

ok