제출 #604489

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
604489		ogibogi2004	Finding Routers (IOI20_routers)	C++14	96.77 / 100	5 ms	692 KiB

routers

#include "routers.h"
#include <bits/stdc++.h>
using namespace std;
map<int,int> found;
int use_detector1(int x)
{
    if(found.count(x))return found[x];
    auto it=found.lower_bound(x);
    if(it!=found.end()&&it!=found.begin())
    {
        int t1=(*it).second;
        it--;
        int t2=(*it).second;
        if(t1==t2)return t1;
    }
    int t=use_detector(x);
    found[x]=t;
    return t;
}
vector<int> find_routers(int l, int n, int q) {
    vector<int>r;
    r.push_back(0);
    for(int j=1;j<n;j++)
    {
        int last=r.back();
        int low=(last+2)/2,high=(l-l%2)/2-(n-j-1);
        int mid=(low+high)/2,ans;
        while(low<=high)
        {
            mid=(low+high)/2;
            if(use_detector1((mid*2+last)/2)==j-1)
            {
                ans=mid*2;
                low=mid+1;
            }
            else high=mid-1;
        }
        r.push_back(ans);
    }
    //for(int i=0;i<r.size();i++)cout<<r[i]<<" ";
    //cout<<endl;
    return r;
}

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