| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1362775 | mariaclara | How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid) | C++20 | 0 ms | 428 KiB |
#include "avoid.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second
pii scout(int R, int H) {
int l = 1, r = 1000;
while(l < r) {
int mid = (l+r)/2;
vi rob;
for(int i = l; i <= mid; i++) rob.pb(i);
send(rob);
vi ans = wait();
if(ans[0]) r = mid;
else l = mid+1;
}
int a = l;
l++; r = 1000;
while(l < r) {
int mid = (l+r)/2;
vi rob;
for(int i = l; i <= mid; i++) rob.pb(i);
send(rob);
vi ans = wait();
if(ans[0]) r = mid;
else l = mid+1;
}
return mk(a, min(1000, l));
}| # | 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... | ||||
