QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#520791	#4565. Rarest Insects	kimmoqt	64.34	45ms	4208kb	C++20	4.1kb	2024-08-15 15:49:25	2024-08-15 15:49:26

Judging History

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

[2024-08-15 15:49:26]
评测

测评结果：64.34
用时：45ms
内存：4208kb

查看

[2024-08-15 15:49:25]
提交

answer

#include "insects.h"

#include <bits/stdc++.h>
using namespace std;

const int MX=2005;

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

int cnt[MX], L[MX], R[MX];

int min_cardinality(int N) {
        vector<bool> vis(N);

        vector<int> pos;
        for(int i=0;i<N;i++) {
                if(vis[i]) continue;
                move_inside(i);

                if(press_button()==2) {
                        move_outside(i);
                } else {
                        vis[i]=true;
                        pos.push_back(i);
                }
        }

        int q0=N,q1=N;

        int cur=N-pos.size();
        while(cur>0) {
                q0+=cur/2;
                cur-=pos.size();
        }

        int p=pos.size();
        while(p>1) {
                p/=2;
                q1+=N-pos.size();
        }

        if(pos.size()>=128) {
                int p=pos.size(),res=1;
                while(true) {
                        for(auto x:pos) {
                                move_outside(x);
                        }
                        pos.clear();

                        vector<int> ord;
                        for(int i=0;i<N;i++) 
                                if(!vis[i]) ord.push_back(i);

                        shuffle(ord.begin(),ord.end(),rng);

                        for(auto i:ord) {
                                move_inside(i);

                                if(press_button()==2) {
                                        move_outside(i);
                                } else {
                                        vis[i]=true;
                                        pos.push_back(i);
                                }
                                if(pos.size()==p) break;
                        }

                        if(pos.size()!=p) break;
                        res++;
                }

                return res;
        } else {
                for(auto x:pos) {
                        move_outside(x);
                }

                for(int i=0;i<N;i++) {
                        L[i]=0;
                        R[i]=pos.size()-1;
                }

                for(int it=0;it<8;it++) {
                        vector<array<int,3>> seg;
                        for(int i=0;i<N;i++) {
                                if(vis[i]) continue;

                                int m=(L[i]+R[i])/2;
                                if(R[i]>L[i]) {
                                        seg.push_back({L[i],m,i});
                                }
                        }
                        sort(seg.begin(),seg.end());

                        for(int i=0;i<seg.size();i++) {
                                int j=i;
                                while(j+1<seg.size() && seg[j+1][0]==seg[j][0]) j++;

                                for(int k=seg[i][0];k<=seg[i][1];k++) {
                                        move_inside(pos[k]);
                                }

                                for(int k=i;k<=j;k++) {
                                        move_inside(seg[k][2]);
                                        if(press_button()==2) {
                                                R[seg[k][2]]=seg[k][1];
                                        } else {
                                                L[seg[k][2]]=seg[k][1]+1;
                                        }
                                        move_outside(seg[k][2]);
                                }

                                for(int k=seg[i][0];k<=seg[i][1];k++) {
                                        move_outside(pos[k]);
                                }

                                i=j;
                        }
                }

                for(int i=0;i<N;i++) {
                        if(vis[i]) continue;
                        cnt[L[i]]++;
                }

                int res=N;
                for(int i=0;i<pos.size();i++) {
                        res=min(res,cnt[i]);
                }

                return res+1;
        }       
}

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

input:

output:

result:

ok

Test #2:

score: 10

Accepted

time: 0ms

memory: 3908kb

input:

2
1
2

output:

result:

ok

Test #3:

score: 10

Accepted

time: 0ms

memory: 3844kb

input:

2
1
1

output:

result:

ok

Test #4:

score: 10

Accepted

time: 0ms

memory: 3880kb

input:

output:

result:

ok

Test #5:

score: 10

Accepted

time: 0ms

memory: 3816kb

input:

output:

result:

ok

Test #6:

score: 10

Accepted

time: 1ms

memory: 3912kb

input:

output:

result:

ok

Test #7:

score: 10

Accepted

time: 1ms

memory: 3908kb

input:

output:

result:

ok

Test #8:

score: 10

Accepted

time: 0ms

memory: 3900kb

input:

output:

result:

ok

Test #9:

score: 10

Accepted

time: 3ms

memory: 4148kb

input:

output:

result:

ok

Test #10:

score: 10

Accepted

time: 6ms

memory: 3868kb

input:

output:

result:

ok

Test #11:

score: 10

Accepted

time: 2ms

memory: 4148kb

input:

output:

result:

ok

Test #12:

score: 10

Accepted

time: 2ms

memory: 3856kb

input:

output:

result:

ok

Test #13:

score: 10

Accepted

time: 3ms

memory: 3920kb

input:

output:

result:

ok

Test #14:

score: 10

Accepted

time: 0ms

memory: 3924kb

input:

output:

result:

ok

Test #15:

score: 10

Accepted

time: 4ms

memory: 3904kb

input:

output:

result:

ok

Test #16:

score: 10

Accepted

time: 0ms

memory: 3844kb

input:

output:

result:

ok

Test #17:

score: 10

Accepted

time: 3ms

memory: 3868kb

input:

output:

result:

ok

Test #18:

score: 10

Accepted

time: 1ms

memory: 3916kb

input:

output:

result:

ok

Test #19:

score: 10

Accepted

time: 0ms

memory: 3848kb

input:

output:

result:

ok

Test #20:

score: 10

Accepted

time: 2ms

memory: 3860kb

input:

output:

result:

ok

Test #21:

score: 10

Accepted

time: 4ms

memory: 4156kb

input:

output:

result:

ok

Test #22:

score: 10

Accepted

time: 0ms

memory: 3928kb

input:

output:

result:

ok

Test #23:

score: 10

Accepted

time: 2ms

memory: 3844kb

input:

output:

result:

ok

Subtask #2:

score: 15

Accepted

Test #24:

score: 15

Accepted

time: 0ms

memory: 4144kb

input:

output:

result:

ok

Test #25:

score: 15

Accepted

time: 4ms

memory: 3816kb

input:

output:

result:

ok

Test #26:

score: 15

Accepted

time: 8ms

memory: 4164kb

input:

output:

result:

ok

Test #27:

score: 15

Accepted

time: 0ms

memory: 4136kb

input:

output:

result:

ok

Test #28:

score: 15

Accepted

time: 0ms

memory: 3864kb

input:

output:

result:

ok

Test #29:

score: 15

Accepted

time: 0ms

memory: 3840kb

input:

output:

result:

ok

Test #30:

score: 15

Accepted

time: 4ms

memory: 3868kb

input:

output:

result:

ok

Test #31:

score: 15

Accepted

time: 4ms

memory: 3932kb

input:

output:

result:

ok

Test #32:

score: 15

Accepted

time: 12ms

memory: 4016kb

input:

output:

result:

ok

Test #33:

score: 15

Accepted

time: 6ms

memory: 3872kb

input:

output:

result:

ok

Test #34:

score: 15

Accepted

time: 6ms

memory: 4172kb

input:

output:

result:

ok

Test #35:

score: 15

Accepted

time: 4ms

memory: 3940kb

input:

output:

result:

ok

Test #36:

score: 15

Accepted

time: 8ms

memory: 3936kb

input:

output:

result:

ok

Test #37:

score: 15

Accepted

time: 0ms

memory: 4172kb

input:

output:

result:

ok

Test #38:

score: 15

Accepted

time: 0ms

memory: 4168kb

input:

output:

result:

ok

Test #39:

score: 15

Accepted

time: 10ms

memory: 4020kb

input:

output:

result:

ok

Test #40:

score: 15

Accepted

time: 0ms

memory: 4044kb

input:

output:

result:

ok

Test #41:

score: 15

Accepted

time: 3ms

memory: 3880kb

input:

output:

result:

ok

Test #42:

score: 15

Accepted

time: 0ms

memory: 4144kb

input:

output:

result:

ok

Subtask #3:

score: 39.34

Acceptable Answer

Test #43:

score: 75

Accepted

time: 0ms

memory: 3912kb

input:

2
1
2

output:

result:

ok

Test #44:

score: 75

Accepted

time: 0ms

memory: 4132kb

input:

2
1
1

output:

result:

ok

Test #45:

score: 75

Accepted

time: 0ms

memory: 3848kb

input:

output:

result:

ok

Test #46:

score: 75

Accepted

time: 0ms

memory: 3840kb

input:

output:

result:

ok

Test #47:

score: 75

Accepted

time: 1ms

memory: 4136kb

input:

output:

result:

ok

Test #48:

score: 75

Accepted

time: 0ms

memory: 3912kb

input:

output:

result:

ok

Test #49:

score: 75

Accepted

time: 4ms

memory: 3852kb

input:

output:

result:

ok

Test #50:

score: 50.1

Acceptable Answer

time: 11ms

memory: 4184kb

input:

output:

result:

points 0.6680 points  0.6680

Test #51:

score: 49.68

Acceptable Answer

time: 5ms

memory: 3976kb

input:

output:

result:

points 0.66240 points  0.66240

Test #52:

score: 75

Accepted

time: 5ms

memory: 3872kb

input:

output:

result:

ok

Test #53:

score: 75

Accepted

time: 0ms

memory: 3988kb

input:

output:

result:

ok

Test #54:

score: 72.85

Acceptable Answer

time: 12ms

memory: 4208kb

input:

output:

result:

points 0.97133333330 points  0.97133333330

Test #55:

score: 49.98

Acceptable Answer

time: 45ms

memory: 4196kb

input:

output:

result:

points 0.66640 points  0.66640

Test #56:

score: 73.22

Acceptable Answer

time: 20ms

memory: 3960kb

input:

output:

result:

points 0.97626666670 points  0.97626666670

Test #57:

score: 70.37

Acceptable Answer

time: 7ms

memory: 3980kb

input:

output:

result:

points 0.93826666670 points  0.93826666670

Test #58:

score: 68.12

Acceptable Answer

time: 16ms

memory: 4192kb

input:

output:

result:

points 0.90826666670 points  0.90826666670

Test #59:

score: 66.48

Acceptable Answer

time: 16ms

memory: 4156kb

input:

output:

result:

points 0.88640 points  0.88640

Test #60:

score: 64.86

Acceptable Answer

time: 9ms

memory: 3896kb

input:

output:

result:

points 0.86480 points  0.86480

Test #61:

score: 61.59

Acceptable Answer

time: 9ms

memory: 3868kb

input:

output:

result:

points 0.82120 points  0.82120

Test #62:

score: 48.13

Acceptable Answer

time: 14ms

memory: 4192kb

input:

output:

result:

points 0.64173333330 points  0.64173333330

Test #63:

score: 40.43

Acceptable Answer

time: 11ms

memory: 4040kb

input:

output:

result:

points 0.53906666670 points  0.53906666670

Test #64:

score: 75

Accepted

time: 6ms

memory: 4120kb

input:

output:

result:

ok

Test #65:

score: 75

Accepted

time: 0ms

memory: 3860kb

input:

output:

result:

ok

Test #66:

score: 75

Accepted

time: 0ms

memory: 4124kb

input:

output:

result:

ok

Test #67:

score: 75

Accepted

time: 0ms

memory: 3996kb

input:

output:

result:

ok

Test #68:

score: 46.43

Acceptable Answer

time: 21ms

memory: 3920kb

input:

output:

result:

points 0.61906666670 points  0.61906666670

Test #69:

score: 46.43

Acceptable Answer

time: 21ms

memory: 4164kb

input:

output:

result:

points 0.61906666670 points  0.61906666670

Test #70:

score: 57.81

Acceptable Answer

time: 21ms

memory: 3908kb

input:

output:

result:

points 0.77080 points  0.77080

Test #71:

score: 57.81

Acceptable Answer

time: 20ms

memory: 3904kb

input:

output:

result:

points 0.77080 points  0.77080

Test #72:

score: 46.43

Acceptable Answer

time: 10ms

memory: 4196kb

input:

output:

result:

points 0.61906666670 points  0.61906666670

Test #73:

score: 46.43

Acceptable Answer

time: 16ms

memory: 3936kb

input:

output:

result:

points 0.61906666670 points  0.61906666670

Test #74:

score: 39.4

Acceptable Answer

time: 22ms

memory: 3984kb

input:

output:

result:

points 0.52533333330 points  0.52533333330

Test #75:

score: 39.4

Acceptable Answer

time: 32ms

memory: 3968kb

input:

output:

result:

points 0.52533333330 points  0.52533333330

Test #76:

score: 46.74

Acceptable Answer

time: 10ms

memory: 4176kb

input:

output:

result:

points 0.62320 points  0.62320

Test #77:

score: 46.74

Acceptable Answer

time: 8ms

memory: 3968kb

input:

output:

result:

points 0.62320 points  0.62320

Test #78:

score: 46.43

Acceptable Answer

time: 19ms

memory: 3896kb

input:

output:

result:

points 0.61906666670 points  0.61906666670

Test #79:

score: 46.36

Acceptable Answer

time: 22ms

memory: 4140kb

input:

output:

result:

points 0.61813333330 points  0.61813333330

Test #80:

score: 39.34

Acceptable Answer

time: 31ms

memory: 3872kb

input:

output:

result:

points 0.52453333330 points  0.52453333330

Test #81:

score: 39.34

Acceptable Answer

time: 21ms

memory: 3896kb

input:

output:

result:

points 0.52453333330 points  0.52453333330

Test #82:

score: 46.57

Acceptable Answer

time: 8ms

memory: 3968kb

input:

output:

result:

points 0.62093333330 points  0.62093333330

Test #83:

score: 46.56

Acceptable Answer

time: 10ms

memory: 3932kb

input:

output:

result:

points 0.62080 points  0.62080

Test #84:

score: 70.65

Acceptable Answer

time: 0ms

memory: 3868kb

input:

output:

result:

points 0.9420 points  0.9420

Test #85:

score: 70.36

Acceptable Answer

time: 6ms

memory: 3932kb

input:

output:

result:

points 0.93813333330 points  0.93813333330

Test #86:

score: 75

Accepted

time: 10ms

memory: 4192kb

input:

output:

result:

ok

Test #87:

score: 75

Accepted

time: 0ms

memory: 4144kb

input:

output:

result:

ok

Test #88:

score: 75

Accepted

time: 0ms

memory: 3920kb

input:

output:

result:

ok

Test #89:

score: 75

Accepted

time: 4ms

memory: 3988kb

input:

output:

result:

ok