제출 #1255410

#제출 시각아이디문제언어결과실행 시간메모리
1255410robijoyFinding Routers (IOI20_routers)C++17
16 / 100
0 ms328 KiB
/* * Starting with the name of almighty ALLAH */ #include "routers.h" // #include <bits/stdc++.h> using namespace std; // #define int long long // vector<int> p = {0,8}; // int use_detector(int x) // { // vector<int>::iterator left, right; // right = upper_bound(p.begin(), p.end(), x); // left = prev(right); // if (right == p.end()) { // return p.size() - 1; // } else if ((x - *left) <= (*right - x)){ // return std::distance(p.begin(), left); // } else { // return std::distance(p.begin(), right); // } // } vector<int> find_routers(int l, int n, int q) { vector<int> ans; ans.push_back(0); for (int i = 1; i < l; i++) { int x = use_detector(i); if(x == 1) { int y = (i-1)*2; ans.push_back(y); break; } } return ans; } // int32_t main() { // ios::sync_with_stdio(false); // cin.tie(0); // int l, n, q; // cin>>l>>n>>q; // vector<int> robi = find_routers(l,n,q); // for (int i = 0; i < robi.size(); ++i) // { // cout<<robi[i]<<' '; // } // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...