QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#793067	#4565. Rarest Insects	_8_8_^#	25	50ms	4180kb	C++20	2.5kb	2024-11-29 16:28:09	2024-11-29 16:28:10

Judging History

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

[2024-11-29 16:28:10]
评测

测评结果：25
用时：50ms
内存：4180kb

查看

[2024-11-29 16:28:09]
提交

answer

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

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
vector<int> p;
set<int> cur;

void add(int i) {
    cur.insert(i);
    i = p[i];
    move_inside(i);
}
void del(int i) {
    cur.erase(i);
    i = p[i];
    move_outside(i);
}
vector<vector<int>> solve(int l, int r) {
    if(l == r) {
        add(l);
        return {{l}};
    }
    int mid = (l + r) >> 1;
    auto L = solve(l, mid);
    while(!cur.empty()) {
        del(*cur.begin());
    }
    auto R = solve(mid + 1, r);
    vector<vector<int>> ret = R;
    for(auto v : L) {
        add(v[0]);
        if(press_button() == 1) {
            ret.push_back(v);
        } else {
            int it = 0;
            for(auto j : R) {
                del(j[0]);
                if(press_button() == 1) {
                    for(int f : v) {
                        ret[it].push_back(f);
                    }
                    add(j[0]);
                    break;
                }
                it++;
                add(j[0]);
            }
            del(v[0]);
        }
    }
    return ret;
}

int try_solve() {
    for(int i = 0; i < n; i++) {
        add(i);
    }
    int x = press_button();
    if(x < 60) {
        set<int> left;
        for(int i = 0; i < n; i++) {
            del(i);
        }
        for(int i = 0; i < n; i++) {
            left.insert(i);
        }
        int st = 0, prev = -1;
        while(!left.empty()) {
            int col = 0;
            vector<int> dd;
            for(int j : left) {
                // cout << press_button() << "x\n";
                add(j);
                if(press_button() == 2) {
                    del(j);
                } else {
                    dd.push_back(j);
                    col++;
                }
            }
            if(prev !=- 1 && col != prev) {
                return st;
            }
            st++;
            for(int j : dd) {
                del(j);
                left.erase(j);
            }
            prev = col;
        }
        return st;  
    }
    return -1;
}
int min_cardinality(int NN) {
    n = NN;
    int res = (int)1e9;
    p.resize(n);
    iota(p.begin(), p.end(), 0);
    shuffle(p.begin(), p.end(), rng);
    int val = try_solve();
    if(val != -1) return val;
    auto f = solve(0, n - 1);
    for(auto j : f) {
        res = min(res, (int)j.size());
    }
    return res;
}

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: 3800kb

input:

output:

result:

ok

Test #2:

score: 10

Accepted

time: 0ms

memory: 3812kb

input:

output:

result:

ok

Test #3:

score: 10

Accepted

time: 1ms

memory: 4092kb

input:

output:

result:

ok

Test #4:

score: 10

Accepted

time: 1ms

memory: 3812kb

input:

output:

result:

ok

Test #5:

score: 10

Accepted

time: 1ms

memory: 3844kb

input:

output:

result:

ok

Test #6:

score: 10

Accepted

time: 0ms

memory: 3868kb

input:

output:

result:

ok

Test #7:

score: 10

Accepted

time: 3ms

memory: 4128kb

input:

output:

result:

ok

Test #8:

score: 10

Accepted

time: 2ms

memory: 3832kb

input:

output:

result:

ok

Test #9:

score: 10

Accepted

time: 0ms

memory: 4104kb

input:

output:

result:

ok

Test #10:

score: 10

Accepted

time: 8ms

memory: 4068kb

input:

output:

result:

ok

Test #11:

score: 10

Accepted

time: 3ms

memory: 3860kb

input:

output:

result:

ok

Test #12:

score: 10

Accepted

time: 4ms

memory: 3976kb

input:

output:

result:

ok

Test #13:

score: 10

Accepted

time: 3ms

memory: 3960kb

input:

output:

result:

ok

Test #14:

score: 10

Accepted

time: 2ms

memory: 3888kb

input:

output:

result:

ok

Test #15:

score: 10

Accepted

time: 8ms

memory: 4072kb

input:

output:

result:

ok

Test #16:

score: 10

Accepted

time: 13ms

memory: 3884kb

input:

output:

result:

ok

Test #17:

score: 10

Accepted

time: 8ms

memory: 3876kb

input:

output:

result:

ok

Test #18:

score: 10

Accepted

time: 9ms

memory: 4116kb

input:

output:

result:

ok

Test #19:

score: 10

Accepted

time: 0ms

memory: 3804kb

input:

output:

result:

ok

Test #20:

score: 10

Accepted

time: 3ms

memory: 4104kb

input:

output:

result:

ok

Test #21:

score: 10

Accepted

time: 2ms

memory: 3884kb

input:

output:

result:

ok

Test #22:

score: 10

Accepted

time: 2ms

memory: 3964kb

input:

output:

result:

ok

Test #23:

score: 10

Accepted

time: 2ms

memory: 3884kb

input:

output:

result:

ok

Subtask #2:

score: 15

Accepted

Test #24:

score: 15

Accepted

time: 11ms

memory: 3920kb

input:

output:

result:

ok

Test #25:

score: 15

Accepted

time: 7ms

memory: 3916kb

input:

output:

result:

ok

Test #26:

score: 15

Accepted

time: 28ms

memory: 3864kb

input:

output:

result:

ok

Test #27:

score: 15

Accepted

time: 39ms

memory: 3892kb

input:

output:

result:

ok

Test #28:

score: 15

Accepted

time: 0ms

memory: 3852kb

input:

output:

result:

ok

Test #29:

score: 15

Accepted

time: 15ms

memory: 4080kb

input:

output:

result:

ok

Test #30:

score: 15

Accepted

time: 6ms

memory: 3856kb

input:

output:

result:

ok

Test #31:

score: 15

Accepted

time: 0ms

memory: 4044kb

input:

output:

result:

ok

Test #32:

score: 15

Accepted

time: 5ms

memory: 3920kb

input:

output:

result:

ok

Test #33:

score: 15

Accepted

time: 16ms

memory: 4116kb

input:

output:

result:

ok

Test #34:

score: 15

Accepted

time: 7ms

memory: 3924kb

input:

output:

result:

ok

Test #35:

score: 15

Accepted

time: 21ms

memory: 3924kb

input:

output:

result:

ok

Test #36:

score: 15

Accepted

time: 7ms

memory: 4124kb

input:

output:

result:

ok

Test #37:

score: 15

Accepted

time: 19ms

memory: 3888kb

input:

output:

result:

ok

Test #38:

score: 15

Accepted

time: 7ms

memory: 3848kb

input:

output:

result:

ok

Test #39:

score: 15

Accepted

time: 6ms

memory: 3924kb

input:

output:

result:

ok

Test #40:

score: 15

Accepted

time: 0ms

memory: 3944kb

input:

output:

result:

ok

Test #41:

score: 15

Accepted

time: 0ms

memory: 4136kb

input:

output:

result:

ok

Test #42:

score: 15

Accepted

time: 4ms

memory: 4180kb

input:

output:

result:

ok

Subtask #3:

score: 0

Wrong Answer

Test #43:

score: 75

Accepted

time: 1ms

memory: 3868kb

input:

output:

result:

ok

Test #44:

score: 75

Accepted

time: 0ms

memory: 4036kb

input:

output:

result:

ok

Test #45:

score: 75

Accepted

time: 0ms

memory: 3796kb

input:

output:

result:

ok

Test #46:

score: 75

Accepted

time: 1ms

memory: 3876kb

input:

output:

result:

ok

Test #47:

score: 70.33

Acceptable Answer

time: 0ms

memory: 3868kb

input:

output:

result:

points 0.93773333330 points  0.93773333330

Test #48:

score: 70.34

Acceptable Answer

time: 12ms

memory: 3992kb

input:

output:

result:

points 0.93786666670 points  0.93786666670

Test #49:

score: 75

Accepted

time: 3ms

memory: 4004kb

input:

output:

result:

ok

Test #50:

score: 0

Wrong Answer

time: 50ms

memory: 3976kb

input:

output:

result:

wrong answer Too many queries.