#include <bits/stdc++.h>
#include "routers.h"
using namespace std;
vector<int> find_routers(int l, int n, int q) {
    vector<int> res(n);
    res[0] = 0;
    int low = 2, high = l;
    while (low < high) {
        int mid = (low + high) / 2;
        if (mid % 2 != 0) mid++;
        int label = use_detector(mid);
        if (label == 2) {
            high = mid;
        } else {
            low = mid + 2;
        }
    }
    res[1] = low;
    return res;
}
| # | 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... |