제출 #1224485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1224485		LaMatematica14	How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid)	C++20	10 / 100	0 ms	428 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 ok, int fi) -> void {
    vector<int> ask, askk;
    for (int i = 1; i <= 1000; i++) {
      if ((i&ok) == ok) ask.push_back(i);
      else askk.push_back(i);
    }
    send(ask);
    if (fi) send(askk);
  };
  for (int i = 0; i < 10; i++) question(1<<i, 1);
  vector<int> ris = wait();
  vector<int> div;
  for (int i = 0; i < 20; i+=2) {
    if (ris[i] && ris[i+1]) {
      div.push_back(i/2);
    }
    else if (ris[i]) pos1 |= (1<<(i/2));
  }
  pos2 = pos1;
  if (div.size() == 0) return {pos1, pos1};
  for (int i = 0; i < div.size()-1; i++) {
    int ok = (1<<div[i])|(1<<div[i+1]);
    question(ok, 0);
  }
  ris = wait();
  pos1 |= 1<<div[0];
  int last = 1;
  for (int i = 0; i < div.size()-1; i++) {
    if (ris[i]^last) {
      pos2 |= (1<<div[i+1]); last = 0;
    }
    else {
      pos1 |= (1<<div[i+1]); last = 1;
    }
  } 
  return {pos1, pos2};
}

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