# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
681748 | penguin133 | Cipele (COCI18_cipele) | C++17 | 38 ms | 3620 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;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
int n, m, L[100005], R[100005];
void solve(){
cin >> n >> m;
for(int i=1;i<=n;i++)cin >> L[i];
for(int i=1;i<=m;i++)cin >> R[i];
sort(L+1, L+1+n);
sort(R+1, R+1+m);
int lo = 0, hi = 2e9, ans = hi + 1;
while(lo <= hi){
int mid = (lo + hi) >> 1;
int in = 1;
bool die = 0;
if(n < m){
for(int i=1;i<=n;i++){
while(in <= m && L[i] - R[in] > mid)in++;
if(in == m + 1 || abs(L[i] - R[in]) > mid)die = 1;
in++;
}
}
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... |