| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366569 | Sofiatpc | How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid) | C++20 | 0 ms | 412 KiB |
#include "avoid.h"
#include <bits/stdc++.h>
using namespace std;
pair<int, int> scout(int r, int h) {
int n = 1000;
for( int b = 0; b < 10; b++){
vector<int> v;
for(int i = 1; i <= n; i++)
if(i & (1<<b)) v.push_back(i);
send(v);
}
vector<int> resp = wait();
int x = 0;
for(int b = 0; b < 10; b++)
if(resp[b]) x += (1<<b);
return {x,x};
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
