Submission #1251932

#TimeUsernameProblemLanguageResultExecution timeMemory
1251932aritro_Finding Routers (IOI20_routers)C++20
16 / 100
1 ms328 KiB
#include "routers.h" #include<bits/stdc++.h> using namespace std; vector<int> find_routers(int mx, int n, int q){ //call with: use_detector(x); //solve for: 2 routers /*int l=0,r=mx,mid; int ans=0; while(l<=r){ mid=(l+r)/2; int tem=use_detector(mid); if(tem==0) ans=mid,l=mid+1; else r=mid-1; }*/ //cout<<"ANS: "<<(((ans+3)/2)+ans)+1<<endl; //return {0,(((ans+1)/2)+ans)+1}; for(int i=0;i<=mx;i++){ int res=use_detector(i); if(res) return {0,(i-1)*2}; } return {0,69}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...