QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#519792	#4565. Rarest Insects	kimmoqt^#	0	40ms	4140kb	C++20	2.4kb	2024-08-15 01:52:17	2024-08-15 01:52:18

Judging History

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

[2024-08-15 01:52:18]
评测

测评结果：0
用时：40ms
内存：4140kb

查看

[2024-08-15 01:52:17]
提交

answer

#include "insects.h"

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


int min_cardinality(int N) {
        vector<bool> vis(N);
        // strategy 1 : large max cardinality

        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--) {
                        move_outside(i);
                }
                for(int i=inc.back();i>=0;i--) {
                        move_outside(i);
                        int cur=press_button();
                        if(cur<lst) {
                                vis[i]=true;
                        }
                        move_inside(i);
                }
                for(int i=0;i<=inc.back();i++) {
                        move_outside(i);
                }

                bool ok=1;
                for(int i=0;i<N;i++) {
                        ok&=vis[i];
                }

                if(ok) return lst;
                if(lst<=0) break;
        }


        // strategy 2 : small max cardinality

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

源文件, 语言: C++20

詳細信息

Subtask #1:

score: 0

Wrong Answer

Test #1:

score: 10

Accepted

time: 1ms

memory: 3828kb

input:

output:

result:

ok

Test #2:

score: 10

Accepted

time: 1ms

memory: 3796kb

input:

output:

result:

ok

Test #3:

score: 10

Accepted

time: 1ms

memory: 3820kb

input:

output:

result:

ok

Test #4:

score: 10

Accepted

time: 0ms

memory: 4140kb

input:

output:

result:

ok

Test #5:

score: 10

Accepted

time: 1ms

memory: 3768kb

input:

output:

result:

ok

Test #6:

score: 10

Accepted

time: 1ms

memory: 3824kb

input:

output:

result:

ok

Test #7:

score: 10

Accepted

time: 0ms

memory: 3860kb

input:

output:

result:

ok

Test #8:

score: 0

Wrong Answer

time: 30ms

memory: 3828kb

input:

output:

result:

wrong answer Too many queries.

Subtask #2:

score: 0

Wrong Answer

Test #24:

score: 15

Accepted

time: 0ms

memory: 3892kb

input:

output:

result:

ok

Test #25:

score: 0

Wrong Answer

time: 40ms

memory: 4116kb

input:

output:

result:

wrong answer Too many queries.

Subtask #3:

score: 0

Wrong Answer

Test #43:

score: 75

Accepted

time: 1ms

memory: 4116kb

input:

output:

result:

ok

Test #44:

score: 72.83

Acceptable Answer

time: 0ms

memory: 4108kb

input:

output:

result:

points 0.97106666670 points  0.97106666670

Test #45:

score: 73.59

Acceptable Answer

time: 1ms

memory: 3828kb

input:

output:

result:

points 0.98120 points  0.98120

Test #46:

score: 72.83

Acceptable Answer

time: 1ms

memory: 4120kb

input:

output:

result:

points 0.97106666670 points  0.97106666670

Test #47:

score: 71.37

Acceptable Answer

time: 0ms

memory: 4120kb

input:

output:

result:

points 0.95160 points  0.95160

Test #48:

score: 75

Accepted

time: 12ms

memory: 3828kb

input:

output:

result:

ok

Test #49:

score: 0

Wrong Answer

time: 33ms

memory: 3752kb

input:

output:

result:

wrong answer Too many queries.