제출 #426597

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
426597		radaiosm7	Finding Routers (IOI20_routers)	C++17	100 / 100	2 ms	204 KiB

routers

#include <routers.h>
#include <bits/stdc++.h>
using namespace std;
int i, mx[1005];

void compute(int lo, int hi, int x, int y) {
  if (x == y) return;
  int mid = (lo+hi)/2;
  int curr = use_detector(mid);
  mx[curr] = max(mx[curr], mid);
  
  if (x != curr && mid-lo > 1) {
    compute(lo, mid, x, curr);
  }
  
  if (y != curr && hi-mid > 1) {
    compute(mid, hi, curr, y);
  }
}


vector<int> find_routers(int l, int n, int q) {
  vector<int> ans(n);
  fill(mx, mx+n, -1);
  mx[n-1] = l;
  
  compute(0, l, 0, n-1);
  
  ans[0] = 0;  
  for (i=1; i < n; ++i) {
    ans[i] = 2*mx[i-1]-ans[i-1];
  }

  return ans;
}

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