제출 #1203103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1203103		moha1111	Finding Routers (IOI20_routers)	C++20	100 / 100	1 ms	584 KiB

routers

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

unordered_map<int , int> askd;

int ask(int i)
{
    if(askd.find(i) != askd.end())
        return askd[i];
    
    return askd[i] = use_detector(i);
}

vector<int> find_routers(int l, int n, int q)
{
    vector<int> ans;
    ans.push_back(0);
    while(ans.size() < n)
    {
        int st = 0 , en = l , i;
        while(st <= en)
        {
            int mid = (st + en) / 2;
            if(ans.size() - 1 < ask(mid))
                en = mid - 1;
            
            else
                st = mid + 1 , i = mid;
        }
        ans.push_back(2 * i - ans.back());
    }
    return ans;
}

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