제출 #1230242

#제출 시각아이디문제언어결과실행 시간메모리
1230242altern23Finding Routers (IOI20_routers)C++20
100 / 100
1 ms584 KiB
#include "routers.h" #include <bits/stdc++.h> using namespace std; vector<int> find_routers(int l, int n, int q) { vector<int> ans(n), dp(l + 1, -1); ans[0] = 0; for(int i = 1; i < n; i++){ int lf = 0, rg = l, pos = -1; for(;lf <= rg;){ int md = (lf + rg) / 2; int val = (dp[md] == -1 ? use_detector(md) : dp[md]); dp[md] = val; if(val >= i){ pos = md; rg = md - 1; } else lf = md + 1; } int sz = pos - ans[i - 1]; ans[i] = pos + (sz - 1) - 1; } return ans; } /* 0 0 0 1 1 */
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...