oj.uz

Submission #779314

# Submission time Handle Problem Language Result Execution time Memory
779314 2023-07-11T10:22:18 Z vjudge1 Cipele (COCI18_cipele) C++17
18 / 90
 1000 ms 3252 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);
#define OYY 1000000005
#define mod 998244353
vector <int> v,t;
int n,m,mid,cev=OYY,tut;
bool stop=true;
int gec[100005];

inline bool yes(int x){
    tut=0;
    for(int i=0;i<m;i++){
        if(tut>=n){
            return 0;
        }
        if(abs(t[i]-v[tut])>x)continue;
        if(abs(t[i]-v[tut])<=x)tut++;
    }
    if(tut>=n)return true;
    else return false;
}

int32_t main(){
    faster
    cin>>n>>m;
    int deg;
    for(int i=0;i<n;i++){
        cin>>deg;
        v.push_back(deg);
    }
    for(int i=0;i<m;i++){
        cin>>deg;
        t.push_back(deg);
    }
    if(n==m){
        sort(v.begin(),v.end());
        sort(t.begin(),t.end());
        int maxi=0;
        for(int i=0;i<n;i++){
            maxi=max(maxi,abs(v[i]-t[i]));
        }
        cout<<maxi<<'\n';
        return 0;
    }
    if(m<n){
        swap(n,m);
        swap(v,t);
       /* for(int i=0;i<n;i++){
            gec[i]=v[i];
            v[i]=t[i];
        }
        for(int i=0;i<m;i++){
            t[i]=gec[i];
        }*/
    }
    int l=0,r=1000000009;
    while(l<=r){
        mid=(l+r)/2;
        if(yes(mid)){
            r=mid-1;
            cev=mid;
        }
        else l=mid-1;
    }
    cout<<cev<<'\n';
    return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 2640 KB Output is correct
2 Correct 32 ms 3252 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 2656 KB Output is correct
2 Correct 32 ms 3036 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1084 ms 340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1075 ms 340 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1080 ms 468 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 468 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 468 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1078 ms 2404 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 2512 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1077 ms 2384 KB Time limit exceeded
2 Halted 0 ms 0 KB -