Submission #1191314

#TimeUsernameProblemLanguageResultExecution timeMemory
1191314MatteoArcariHighway Tolls (IOI18_highway)C++20
6 / 100
32 ms2180 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; ll ask(const vector<int> &w); void answer(int s, int t); void find_pair(int n, vector<int> u, vector<int> v, int a, int b) { int m = u.size(); vector<int> w(m, 0); ll dst = ask(w) / a; int s = 0; for (int k = 1 << 30; k; k >>= 1) { if (s + k >= n) continue; for (int i = 0; i < m; i++) { w[i] = i < (s + k) ? 1 : 0; } if (ask(w) == a * dst) s += k; } answer(s, s + dst); }
#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...