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;
typedef long long ll;
int n, m, a, b;
vector<int> u;
vector<int> v;
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B)
{
n = N;
a = A;
b = B;
u = U;
v = V;
m = v.size();
vector<int> w(m);
ll cost = ask(w);
ll edges = cost / a;
answer(0, 0 + edges);
}
# | 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... |