제출 #1224442

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1224442		LaMatematica14	How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid)	C++20	0 / 100	1 ms	420 KiB

avoid

#include "avoid.h"
#include <bits/stdc++.h>
using namespace std;

pair<int, int> scout(int R, int H) {
  int pos1 = 0, pos2 = 0;
  /*
  auto question = [&](int bit) -> int {
    int ok = 1<<bit;
    vector<int> ask;
    for (int i = 1; i <= 1000; i++) {
      if (i&ok) ask.push_back(i);
    }
    send(ask);
    return wait()[0];
  };*/
  for (int i = 0; i < 10; i++) {
    int ok = (1<<i)|pos1;
    vector<int> ask;
    for (int i = 1; i <= 1000; i++) {
      if ((i&ok) == ok) ask.push_back(i);
    }
    send(ask);
    pos1 |= (wait()[0])<<i;
  }
  for (int i = 0; i < 10; i++) {
    int ok = (1<<i);
    vector<int> ask;
    for (int i = 1; i <= 1000; i++) {
      if (i == pos1) continue;
      if (i&ok) ask.push_back(i);
    }
    if (ask.size() == 0) return {pos1, pos1};
    send(ask);
    pos2 |= (wait()[0])<<i;
  }
  return {pos1, pos2};
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 10
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 0 / 75