QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#723509 | #7281. How to Avoid Disqualification in 75 Easy Steps | RDFZchenyy | 0 | 1ms | 3800kb | C++14 | 416b | 2024-11-07 22:39:21 | 2024-11-07 22:39:22 |
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