제출 #1251980

#제출 시각아이디문제언어결과실행 시간메모리
1251980aritro_Finding Routers (IOI20_routers)C++20
0 / 100
1 ms320 KiB
#include "routers.h"
#include<bits/stdc++.h>
using namespace std;

/*int use_detector(int x){
    int tem;
    cout<<x;
    cin>>tem;
    return tem;
}*/

vector<int> find_routers(int mx, int n, int q){
    //call with: use_detector(x);
    vector<int> ans;
    ans.push_back(0);
    for(int i=0;i<n;i++){
        int cur=0;
        int l=ans[i],r=mx,mid;
        while(l<=r){
            mid=(l+r)/2;
            int tem=use_detector(mid);
            if(tem==i) cur=mid,l=mid+1;
            if(tem<i) l=mid+1;
            else r=mid-1;
        }
        if(i==0) ans.push_back(cur*2);
        else ans.push_back(cur+((cur-ans[i-1])+1));
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...