QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#520343	#4565. Rarest Insects	kimmoqt	25	55ms	4140kb	C++20	2.5kb	2024-08-15 13:04:14	2024-08-15 13:04:15

Judging History

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

[2024-08-15 13:04:15]
评测

测评结果：25
用时：55ms
内存：4140kb

查看

[2024-08-15 13:04:14]
提交

answer

#include "insects.h"

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

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

int cnt[2005];

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

        // strategy 1 : large distinct (>= 52)

        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);
                }
        }

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

                        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);
                                }
                        }

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

                return res;
        } else {
                for(int i=0;i<N;i++) {
                        if(vis[i]) continue;

                        move_inside(i);

                        vector<bool> done(pos.size());
                        while(true) {
                                int id=rng()%pos.size();
                                if(done[id]) continue;
                                done[id]=true;
                                move_outside(pos[id]);
                                if(press_button()==1) {
                                        cnt[pos[id]]+=1;
                                        move_inside(pos[id]);
                                        break;
                                }
                                move_inside(pos[id]);
                        }

                        move_outside(i);
                }

                int res=N;
                for(auto j:pos) {
                        res=min(res,cnt[j]);
                }

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

input:

output:

result:

ok

Test #2:

score: 10

Accepted

time: 1ms

memory: 3904kb

input:

output:

result:

ok

Test #3:

score: 10

Accepted

time: 0ms

memory: 3840kb

input:

2
1
1

output:

result:

ok

Test #4:

score: 10

Accepted

time: 0ms

memory: 3904kb

input:

output:

result:

ok

Test #5:

score: 10

Accepted

time: 0ms

memory: 4132kb

input:

output:

result:

ok

Test #6:

score: 10

Accepted

time: 1ms

memory: 4136kb

input:

output:

result:

ok

Test #7:

score: 10

Accepted

time: 0ms

memory: 3804kb

input:

output:

result:

ok

Test #8:

score: 10

Accepted

time: 1ms

memory: 3800kb

input:

output:

result:

ok

Test #9:

score: 10

Accepted

time: 0ms

memory: 3832kb

input:

output:

result:

ok

Test #10:

score: 10

Accepted

time: 5ms

memory: 4132kb

input:

output:

result:

ok

Test #11:

score: 10

Accepted

time: 3ms

memory: 3836kb

input:

output:

result:

ok

Test #12:

score: 10

Accepted

time: 2ms

memory: 3844kb

input:

output:

result:

ok

Test #13:

score: 10

Accepted

time: 4ms

memory: 3896kb

input:

output:

result:

ok

Test #14:

score: 10

Accepted

time: 0ms

memory: 3804kb

input:

output:

result:

ok

Test #15:

score: 10

Accepted

time: 0ms

memory: 3832kb

input:

output:

result:

ok

Test #16:

score: 10

Accepted

time: 5ms

memory: 3976kb

input:

output:

result:

ok

Test #17:

score: 10

Accepted

time: 0ms

memory: 4128kb

input:

output:

result:

ok

Test #18:

score: 10

Accepted

time: 10ms

memory: 4096kb

input:

output:

result:

ok

Test #19:

score: 10

Accepted

time: 8ms

memory: 3900kb

input:

output:

result:

ok

Test #20:

score: 10

Accepted

time: 0ms

memory: 3896kb

input:

output:

result:

ok

Test #21:

score: 10

Accepted

time: 8ms

memory: 4124kb

input:

output:

result:

ok

Test #22:

score: 10

Accepted

time: 2ms

memory: 3828kb

input:

output:

result:

ok

Test #23:

score: 10

Accepted

time: 2ms

memory: 3832kb

input:

output:

result:

ok

Subtask #2:

score: 15

Accepted

Test #24:

score: 15

Accepted

time: 0ms

memory: 3908kb

input:

output:

result:

ok

Test #25:

score: 15

Accepted

time: 6ms

memory: 3904kb

input:

output:

result:

ok

Test #26:

score: 15

Accepted

time: 46ms

memory: 3904kb

input:

output:

result:

ok

Test #27:

score: 15

Accepted

time: 51ms

memory: 4100kb

input:

output:

result:

ok

Test #28:

score: 15

Accepted

time: 0ms

memory: 3816kb

input:

output:

result:

ok

Test #29:

score: 15

Accepted

time: 7ms

memory: 3840kb

input:

output:

result:

ok

Test #30:

score: 15

Accepted

time: 0ms

memory: 3868kb

input:

output:

result:

ok

Test #31:

score: 15

Accepted

time: 22ms

memory: 3804kb

input:

output:

result:

ok

Test #32:

score: 15

Accepted

time: 6ms

memory: 3896kb

input:

output:

result:

ok

Test #33:

score: 15

Accepted

time: 8ms

memory: 3836kb

input:

output:

result:

ok

Test #34:

score: 15

Accepted

time: 7ms

memory: 4140kb

input:

output:

result:

ok

Test #35:

score: 15

Accepted

time: 15ms

memory: 3912kb

input:

output:

result:

ok

Test #36:

score: 15

Accepted

time: 0ms

memory: 3872kb

input:

output:

result:

ok

Test #37:

score: 15

Accepted

time: 19ms

memory: 3908kb

input:

output:

result:

ok

Test #38:

score: 15

Accepted

time: 36ms

memory: 3844kb

input:

output:

result:

ok

Test #39:

score: 15

Accepted

time: 3ms

memory: 4128kb

input:

output:

result:

ok

Test #40:

score: 15

Accepted

time: 0ms

memory: 4132kb

input:

output:

result:

ok

Test #41:

score: 15

Accepted

time: 9ms

memory: 3872kb

input:

output:

result:

ok

Test #42:

score: 15

Accepted

time: 4ms

memory: 3832kb

input:

output:

result:

ok

Subtask #3:

score: 0

Wrong Answer

Test #43:

score: 75

Accepted

time: 1ms

memory: 3832kb

input:

output:

result:

ok

Test #44:

score: 75

Accepted

time: 1ms

memory: 3976kb

input:

2
1
1

output:

result:

ok

Test #45:

score: 75

Accepted

time: 0ms

memory: 4124kb

input:

output:

result:

ok

Test #46:

score: 75

Accepted

time: 1ms

memory: 3900kb

input:

output:

result:

ok

Test #47:

score: 74.59

Acceptable Answer

time: 1ms

memory: 4128kb

input:

output:

result:

points 0.99453333330 points  0.99453333330

Test #48:

score: 75

Accepted

time: 0ms

memory: 3804kb

input:

output:

result:

ok

Test #49:

score: 75

Accepted

time: 0ms

memory: 3916kb

input:

output:

result:

ok

Test #50:

score: 0

Wrong Answer

time: 55ms

memory: 3836kb

input:

output:

result:

wrong answer Too many queries.