QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#723509#7281. How to Avoid Disqualification in 75 Easy StepsRDFZchenyy0 1ms3800kbC++14416b2024-11-07 22:39:212024-11-07 22:39:22

Judging History

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

  • [2024-11-07 22:39:22]
  • 评测
  • 测评结果:0
  • 用时:1ms
  • 内存:3800kb
  • [2024-11-07 22:39:21]
  • 提交

answer

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

std::pair<int,int> scout(int R,int H){
    std::vector<int> now;
    for(int i=0;i<10;i++){
        now.clear();
        for(int j=1;j<=1000;j++){
            if((j>>i)&1) now.push_back(j);
        }
        send(now);
    }
    int res=0;
    now=wait();
    for(int i=0;i<10;i++){
        res=(res<<1)|now[i];
    }
    return std::make_pair(res,res);
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3800kb

input:



output:


result:

wrong answer Not correct

Subtask #2:

score: 0
Wrong Answer

Test #11:

score: 0
Wrong Answer
time: 0ms
memory: 3596kb

input:

\x14

output:


result:

wrong answer Not correct

Subtask #3:

score: 0
Wrong Answer

Test #66:

score: 0
Wrong Answer
time: 1ms
memory: 3772kb

input:

\x1e

output:


result:

wrong answer Not correct

Subtask #4:

score: 0
Wrong Answer

Test #120:

score: 0
Wrong Answer
time: 0ms
memory: 3796kb

input:

K

output:


result:

wrong answer Not correct