Submission #138842

#TimeUsernameProblemLanguageResultExecution timeMemory
138842muradeynHighway Tolls (IOI18_highway)C++14
6 / 100
130 ms2092 KiB
#include "highway.h" #include <bits/stdc++.h> #define F first #define S second #define intt long long using namespace std; const int maxx = 100000; vector<int>w; void find_pair(int n, vector<int> u, vector<int> vv, int a, int b) { int m = u.size(); w.resize(m , 0); intt ret = ask(w); intt len = ret / (1LL * a); int l = 0 , r = n - 1; while (r - l != len) { int mid = (l + r) >> 1; for (int i = l;i<mid;i++)w[i] = 0; for (int i = mid;i < r;i++)w[i] = 1; ret = ask(w); if (ret % len == 0 && ret / len == b) l = mid; else if (ret % len == 0 && ret / len == a) r = mid; else { for (int i = l;i<mid;i++) { intt res = 1LL * (mid - i) * a; res += 1LL * (len - (mid - i)) * b; if (res == ret) { l = i; r = i + len; break; } } } } answer(l , r); }
#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...