Submission #1201438

#TimeUsernameProblemLanguageResultExecution timeMemory
1201438ezzzayFinding Routers (IOI20_routers)C++20
78.01 / 100
1 ms840 KiB
#include "routers.h" #include<bits/stdc++.h> using namespace std; const int N=1e6; bool vis[N]; int P[N]; int fun(int x){ if(vis[x]){ return P[x]; } vis[x]=1; return P[x]= use_detector(x); } std::vector<int> find_routers(int l, int n, int q) { vector<int>v={0}; for(int i=1;i<n;i++){ int lo=v.back(),hi=l; while(hi>=lo){ int mid=(hi+lo)/2; int idx = fun(mid); if(idx<i){ lo=mid+1; } else{ hi=mid-1; } } v.push_back(hi*2-v.back()); } return v; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...