# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92661 | Kastanda | Cipele (COCI18_cipele) | C++11 | 52 ms | 3060 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;
int n, m;
vector < int > A, B;
bool Solve(int md)
{
int r = 0;
for (int i = 0; i < A.size(); i++)
{
if (r >= B.size())
return false;
while (r < B.size() && B[r] <= A[i] && A[i] - B[r] > md)
r ++;
if (r >= B.size() || abs(A[i] - B[r]) > md)
return false;
r ++;
}
return true;
}
int main()
{
scanf("%d%d", &n, &m);
A.resize(n); B.resize(m);
for (int i = 0; i < n; i++)
scanf("%d", &A[i]);
for (int i = 0; i < m; i++)
scanf("%d", &B[i]);
if (n > m) A.swap(B);
sort(A.begin(), A.end());
sort(B.begin(), B.end());
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... |
# | 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... |