Submission #1224428

#TimeUsernameProblemLanguageResultExecution timeMemory
1224428LaMatematica14How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid)C++20
10 / 100
0 ms420 KiB
#include "avoid.h"
#include <bits/stdc++.h>
using namespace std;

pair<int, int> scout(int R, int H) {
  int pos = 0;
  auto question = [&](int bit) -> void {
    int ok = 1<<bit;
    vector<int> ask;
    for (int i = 1; i <= 1000; i++) {
      if (i&ok) ask.push_back(i);
    }
    send(ask);
  };
  for (int i = 0; i < 10; i++) question(i);
  vector<int> b = wait();
  for (int i = 0; i < 10; i++) pos += b[i]*(1<<i);
  return {pos, pos};
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...