QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#520324	#4565. Rarest Insects	kimmoqt	10	75ms	4128kb	C++20	3.3kb	2024-08-15 12:54:37	2024-08-15 12:54:37

Judging History

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

[2024-08-15 12:54:37]
评测

测评结果：10
用时：75ms
内存：4128kb

查看

[2024-08-15 12:54:37]
提交

answer

#include "insects.h"

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


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

        // strategy 1 : large distinct (> 20)

        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(auto x:pos) {
                        move_outside(x);
                }
                pos.clear();
                for(int i=0;i<N;i++) {
                        vis[i]=false;
                }

                while(true) {
                        vector<int> inc;
                        int lst=0;
                        for(int i=0;i<N;i++) {
                                if(vis[i]) continue;

                                move_inside(i);
                                int cur=press_button();
                                if(cur>lst) {
                                        lst=cur;
                                        inc.push_back(i);
                                }
                        }

                        for(int i=N-1;i>inc.back();i--) {
                                if(vis[i]) continue;
                                move_outside(i);
                        }
                        vector<int> pnd;
                        for(int i=inc.back();i>=0;i--) {
                                if(vis[i]) continue;
                                move_outside(i);
                                int cur=press_button();
                                if(cur<lst) {
                                        pnd.push_back(i);
                                }
                                move_inside(i);
                        }
                        for(int i=0;i<=inc.back();i++) {
                                if(vis[i]) continue;
                                move_outside(i);
                        }
                        for(auto x:pnd) {
                                vis[x]=true;
                        }

                        int n=0;
                        for(int i=0;i<N;i++) n+=!vis[i];
                        if(n==0) return lst;
                }
        }
}

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: 0ms

memory: 4084kb

input:

output:

result:

ok

Test #2:

score: 10

Accepted

time: 1ms

memory: 3832kb

input:

output:

result:

ok

Test #3:

score: 10

Accepted

time: 1ms

memory: 3816kb

input:

output:

result:

ok

Test #4:

score: 10

Accepted

time: 0ms

memory: 3824kb

input:

output:

result:

ok

Test #5:

score: 10

Accepted

time: 1ms

memory: 3880kb

input:

output:

result:

ok

Test #6:

score: 10

Accepted

time: 1ms

memory: 3900kb

input:

output:

result:

ok

Test #7:

score: 10

Accepted

time: 0ms

memory: 3772kb

input:

output:

result:

ok

Test #8:

score: 10

Accepted

time: 2ms

memory: 3832kb

input:

output:

result:

ok

Test #9:

score: 10

Accepted

time: 4ms

memory: 3828kb

input:

output:

result:

ok

Test #10:

score: 10

Accepted

time: 0ms

memory: 3804kb

input:

output:

result:

ok

Test #11:

score: 10

Accepted

time: 4ms

memory: 4112kb

input:

output:

result:

ok

Test #12:

score: 10

Accepted

time: 2ms

memory: 4104kb

input:

output:

result:

ok

Test #13:

score: 10

Accepted

time: 7ms

memory: 4124kb

input:

output:

result:

ok

Test #14:

score: 10

Accepted

time: 4ms

memory: 3772kb

input:

output:

result:

ok

Test #15:

score: 10

Accepted

time: 4ms

memory: 3776kb

input:

output:

result:

ok

Test #16:

score: 10

Accepted

time: 4ms

memory: 4112kb

input:

output:

result:

ok

Test #17:

score: 10

Accepted

time: 0ms

memory: 4084kb

input:

output:

result:

ok

Test #18:

score: 10

Accepted

time: 8ms

memory: 3876kb

input:

output:

result:

ok

Test #19:

score: 10

Accepted

time: 3ms

memory: 4120kb

input:

output:

result:

ok

Test #20:

score: 10

Accepted

time: 11ms

memory: 3772kb

input:

output:

result:

ok

Test #21:

score: 10

Accepted

time: 27ms

memory: 4084kb

input:

output:

result:

ok

Test #22:

score: 10

Accepted

time: 2ms

memory: 3884kb

input:

output:

result:

ok

Test #23:

score: 10

Accepted

time: 2ms

memory: 4120kb

input:

output:

result:

ok

Subtask #2:

score: 0

Wrong Answer

Test #24:

score: 15

Accepted

time: 6ms

memory: 3820kb

input:

output:

result:

ok

Test #25:

score: 15

Accepted

time: 6ms

memory: 3840kb

input:

output:

result:

ok

Test #26:

score: 15

Accepted

time: 53ms

memory: 3836kb

input:

output:

result:

ok

Test #27:

score: 15

Accepted

time: 14ms

memory: 3820kb

input:

output:

result:

ok

Test #28:

score: 15

Accepted

time: 6ms

memory: 3828kb

input:

output:

result:

ok

Test #29:

score: 15

Accepted

time: 0ms

memory: 4092kb

input:

output:

result:

ok

Test #30:

score: 15

Accepted

time: 9ms

memory: 4124kb

input:

output:

result:

ok

Test #31:

score: 15

Accepted

time: 41ms

memory: 4120kb

input:

output:

result:

ok

Test #32:

score: 15

Accepted

time: 17ms

memory: 3828kb

input:

output:

result:

ok

Test #33:

score: 15

Accepted

time: 22ms

memory: 4124kb

input:

output:

result:

ok

Test #34:

score: 15

Accepted

time: 13ms

memory: 3880kb

input:

output:

result:

ok

Test #35:

score: 15

Accepted

time: 21ms

memory: 3856kb

input:

output:

result:

ok

Test #36:

score: 15

Accepted

time: 28ms

memory: 3768kb

input:

output:

result:

ok

Test #37:

score: 15

Accepted

time: 0ms

memory: 3900kb

input:

output:

result:

ok

Test #38:

score: 0

Wrong Answer

time: 75ms

memory: 4084kb

input:

output:

result:

wrong answer Too many queries.

Subtask #3:

score: 0

Wrong Answer

Test #43:

score: 75

Accepted

time: 1ms

memory: 3828kb

input:

output:

result:

ok

Test #44:

score: 72.83

Acceptable Answer

time: 0ms

memory: 3856kb

input:

output:

result:

points 0.97106666670 points  0.97106666670

Test #45:

score: 72.04

Acceptable Answer

time: 1ms

memory: 3804kb

input:

output:

result:

points 0.96053333330 points  0.96053333330

Test #46:

score: 73.59

Acceptable Answer

time: 1ms

memory: 3824kb

input:

output:

result:

points 0.98120 points  0.98120

Test #47:

score: 71.37

Acceptable Answer

time: 1ms

memory: 4120kb

input:

output:

result:

points 0.95160 points  0.95160

Test #48:

score: 75

Accepted

time: 6ms

memory: 3836kb

input:

output:

result:

ok

Test #49:

score: 75

Accepted

time: 13ms

memory: 4128kb

input:

output:

result:

ok

Test #50:

score: 0

Wrong Answer

time: 60ms

memory: 3880kb

input:

output:

result:

wrong answer Too many queries.