제출 #1225608

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1225608		tamzid	Finding Routers (IOI20_routers)	C++20	0 / 100	2095 ms	320 KiB

routers

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

vector<int> find_routers(int l, int n, int q) 
{
    vector<int> ans;
    ans.push_back(0);

    int low = 1;
    int high = l - 1;
    while(low <= high)
    {
      int m = low + (high - low) / 2;
      if(m & 1)
        ++m;
      if(m >= l)
        break;
      if(use_detector(m) == 1)
      {
        low = m + 1;
        if(low < l)
          ans.push_back(low);
      }
      else
      {
        high = m - 1;
      }
    }
    if(ans.size() == 1)
    {
      ans.push_back(l-1);
    }
    return {0,ans.back()};
}

• Subtask 1: 0 / 16
• Subtask 2: 0 / 21
• Subtask 3: 0 / 23
• Subtask 4: 0 / 40