Submission #1232204

#TimeUsernameProblemLanguageResultExecution timeMemory
1232204VMaksimoski008Highway Tolls (IOI18_highway)C++20
6 / 100
32 ms2180 KiB
#include "highway.h" #include <bits/stdc++.h> using namespace std; using ll = long long; using pii = pair<int, int>; const int mxn = 9e4 + 5; void find_pair(int n, vector<int> U, vector<int> V, int A, int B) { int m = U.size(); ll len = ask(vector<int>(m)) / A; int l=len, r=n-1, p=n-1; while(l <= r) { int mid = (l + r) / 2; vector<int> to_get(m, 1); for(int i=0; i<mid; i++) to_get[i] = 0; if(ask(to_get) == len * A) p = mid, r = mid - 1; else l = mid + 1; } answer(p-len, p); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...