제출 #434378

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434378		jeqcho	Finding Routers (IOI20_routers)	C++17	78.01 / 100	8 ms	972 KiB

routers

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

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define F0R(i,b) FOR(i,0,b)
#define ROF(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define R0F(i,b) ROF(i,0,b)
#define all(x) begin(x),end(x)
#define sz(x) int(x.size())
#define pb push_back
#define rsz resize
#define trav(a,x) for(auto&a :x)
#define fi first
#define se second

map<int,int>ca;

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

vi find_routers(int l, int n, int q)
{
  vi v;
  v.pb(0);
  FOR(i,1,n)
  {
    int lef=v.back();
    int rig=l;
    int ans=-1;
    while(lef<=rig)
    {
      int mid=(lef+rig)/2;
      int res=ask(mid);
      if(res<i)
      {
        lef=mid+1;
        ans=mid;
      }
      else{
        rig=mid-1;
      }
    }
    v.pb(ans*2-v.back());
  }
  return v;
}

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