제출 #1258661

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

routers

#include <bits/stdc++.h>
#include "routers.h"
using namespace std;
using ll = long long;

std::vector<int> find_routers(int l, int n, int q) {
    vector<int> answer;
    answer.push_back(0);
    int last = 0;
    for(int i=1;i<n;++i)
    {
      int low = answer.back() + 1, high = l, ans = -1;
      while(low <= high)
      {
        int mid = (low + high) / 2;
        if(use_detector(mid) == last)
        {
          low = mid + 1;
        }
        else
        {
          ans = mid;
          high = mid - 1;
        }
        ++last;
        answer.push_back(answer.back() + ((ans - answer.back() - 1) * 2));
      }
    }
    return answer;
}

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