| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1331544 | huutuan | How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid) | C++20 | 0 ms | 400 KiB |
#include "avoid.h"
using namespace std;
pair<int, int> scout(int R, int H){
if (R==10 && H==1){
for (int i=0; i<10; ++i){
vector<int> vv;
for (int j=1; j<=1000; ++j) if (j>>i&1) vv.push_back(j);
send(vv);
}
auto v=wait();
int ans=0;
for (int i=0; i<10; ++i) ans|=v[i]<<i;
return {ans, ans};
}
return {-1, -1};
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
