#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 left = 1;
int right = l;
while(left < right)
{
int m = left + (right - left) / 2;
if(m & 1)
++m;
if(use_detector(m) == 2)
{
left = m + 1;
}
else
{
right = m - 1;
}
}
ans.push_back(left);
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |