# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1081788 | erray | Highway Tolls (IOI18_highway) | C++17 | 178 ms | 10460 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "highway.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "/home/ioi/contests/ioi18_d2/debug.h"
#else
#define debug(...) void(37)
#endif
template<typename F = function<bool(const int&)>>
int find_first(int l, int r, F good) {
++r;
int bad = r;
while (l < r) {
int mid = (l + r) >> 1;
if (!good(mid)) {
l = mid + 1;
} else {
r = mid;
}
}
return (l == bad ? -1 : l);
}
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
int M = U.size();
vector<vector<int>> g(N);
for (int i = 0; i < M; ++i) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |