oj.uz

Submission #1010527

# Submission time Handle Problem Language Result Execution time Memory
1010527 2024-06-29T07:39:28 Z Almonther Cipele (COCI18_cipele) C++
90 / 90
 46 ms 3164 KB 
#include <bits/stdc++.h>

#define suiii ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define co cout<<
//#pragma GCC optimize("O3,Ofast,unroll-loops")
//#pragma GCC target("avx2,sse3,sse4,avx")
using namespace std;
//stuff
ll n,m;
ll arr[1000001];
ll arr1[1000001];
void solve(){
    cin>>n>>m;
    if(n>m){
        for(int i=1;i<=n;i++) cin>>arr1[i];
        for(int i=1;i<=m;i++) cin>>arr[i];
        swap(n,m);
    }
    else{
        for(int i=1;i<=n;i++) cin>>arr[i];
        for(int i=1;i<=m;i++) cin>>arr1[i];
    }
    sort(arr,arr+n);
    sort(arr1,arr1+m);
    ll l,r;
    l=0,r=1e15;
    while(l<=r){
        ll mid=(l+r)/2;
        ll l1,r1;
        l1=0,r1=0;
        while(l1<n&&r1<m){
            if(abs(arr[l1]-arr1[r1])<=mid) l1++,r1++;
            else r1++;
        }
        if(l1==n) r=mid-1;
        else l=mid+1;
    }
    co r+1;
}

int main()
{
    suiii
    int tt=1;
    // cin>>tt;
    while(tt--){
        solve();
    }
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 1884 KB Output is correct
2 Correct 44 ms 1880 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1884 KB Output is correct
2 Correct 45 ms 1880 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 432 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 600 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 3 ms 604 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 648 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 1628 KB Output is correct
2 Correct 23 ms 1116 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 1624 KB Output is correct
2 Correct 23 ms 1628 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 1628 KB Output is correct
2 Correct 46 ms 3164 KB Output is correct