# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
85974 | theknife2001 | Cipele (COCI18_cipele) | C++17 | 113 ms | 12296 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>
#define mid (l+r)/2
using namespace std;
const int N=1e5+55;
int a[N];
int b[N];
int n,m;
bool ok(int x)
{
int j=0,i=0;
if(n<m)
{
for(j=0,i=0;i<n;i++,j++)
{
while(abs(a[i]-b[j])>x&&j<m)
{
j++;
}
if(j==m)
return 0;
}
return (i==n);
}
else
{
for(j=0,i=0;j<m;i++,j++)
{
while(abs(a[i]-b[j])>x&&i<n)
# | 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... |