# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
162948 | Minnakhmetov | Highway Tolls (IOI18_highway) | C++14 | 332 ms | 13740 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;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
struct E {
int to, i;
};
const int N = 2e5 + 5;
vector<E> g[N];
int anc[N], d[N], pr[N];
void find_pair(int n, vector<int> u, vector<int> v, int a, int b) {
int m = u.size();
for (int i = 0; i < m; i++) {
g[u[i]].push_back({v[i], i});
g[v[i]].push_back({u[i], i});
pr[i] = rand();
}
ll dist = ask(vector<int>(m, 0)) / a;
int l = -1, r = m - 1;
while (r - l > 1) {
int p = (l + r) >> 1;
Compilation message (stderr)
# | 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... |