# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
116166 | RezwanArefin01 | Highway Tolls (IOI18_highway) | C++17 | 366 ms | 9820 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 <bits/stdc++.h>
using namespace std;
#include "highway.h"
typedef long long ll;
const int MX = 9e4 + 5;
vector<int> adj[MX], q, t[2];
int d[MX];
bool vis[MX];
void find_pair(int n, vector<int> l, vector<int> r, int a, int b) {
int m = l.size();
for(int i = 0; i < m; ++i) {
adj[l[i]].push_back(i);
adj[r[i]].push_back(i);
}
q = vector<int> (m, 0);
ll base = ask(q);
int lo = 0, hi = m - 1, e;
while(lo <= hi) {
int mid = lo + hi >> 1;
for(int i = 0; i < m; ++i)
q[i] = i <= mid;
if(ask(q) != base)
e = mid, hi = mid - 1;
else lo = mid + 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... |