# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
859810 | Alexandruabcde | Measures (CEOI22_measures) | C++14 | 112 ms | 3444 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;
constexpr int NMAX = 2e5 + 5;
typedef long long LL;
typedef long double LD;
constexpr LL INF = 1LL * 1e18;
int N, M, D;
int A[NMAX];
int B[NMAX];
void Read () {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> M >> D;
for (int i = 1; i <= N; ++ i )
cin >> A[i];
for (int i = 1; i <= M; ++ i )
cin >> B[i];
}
bool Check (LD t, int m) {
LD first_dist = -INF;
int i = 1, j = 1;
while (i <= N || j <= m) {
LD next_dist = 0;
# | 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... |