| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366570 | Sofiatpc | How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid) | C++20 | 0 ms | 440 KiB |
#include "avoid.h"
#include <bits/stdc++.h>
using namespace std;
pair<int, int> scout(int r, int h) {
int n = 1000;
int la = 1, ra = n;
while(la != ra){
int mid = (la+ra)/2;
vector<int> v;
for(int i = 1; i <= mid; i++)v.push_back(i);
send(v);
vector<int> resp = wait();
if(resp[0] == 1)ra = mid;
else la = mid+1;
}
int lb = 1, rb = n;
while(lb != rb){
int mid = (lb+rb)/2;
vector<int> v;
for(int i = 1; i <= mid; i++)
if(i != la)v.push_back(i);
send(v);
vector<int> resp = wait();
if(resp[0] == 1)rb = mid;
else lb = mid+1;
}
return {la,lb};
}| # | 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... | ||||
