oj.uz

Submission #472378

# Submission time Handle Problem Language Result Execution time Memory
472378 2021-09-13T12:39:38 Z SaraMostafa Cipele (COCI18_cipele) C++14
36 / 90
 1000 ms 3928 KB 
    #include <bits/stdc++.h>
    #include<unordered_map>
    using namespace std;
    #define ll long long
    #define endl "\n"
    #define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    const long long mod=998244353;
    const double PI=acos(-1);
    int main()
    {
        //freopen("input.in","r",stdin);
        Sara
    // 2nd st
        int n,m;
        cin>>n>>m;
        vector<ll>a(n),b(m);
        for(int i=0; i<n; i++)
            cin>>a[i];
        for(int i=0; i<m; i++)
            cin>>b[i];
               
        int id=0;
        sort(a.begin(),a.end());
        sort(b.begin(),b.end());
         if(n==m){
            ll mx=0;
    for(int i=0;i<n;i++){
        mx=max(mx,abs(a[i]-b[i]));
    }
    cout<<mx<<endl;
    return 0;
        }
        if(n<m)
        {
            ll mn1=1e9;
            for(int i=0; i<=(m-1)-(n-1); i++)
            {
                ll mx=0;
                int k=0;
                for(int j=i; j<i+n; j++)
                {
                    mx=max(mx,abs(b[j]-a[k]));
                   // cout<<b[j]<<' '<<a[k]<<endl;
                    k++;
                }
                //cout<<mx<<endl;
                mn1=min(mn1,mx);
            }
            //
            vector<bool>vs(m);
            vector<ll>bn(n);
            for(int i=0;i<n;i++)
            {
                ll mn=1e9;
                for(int j=0; j<m; j++)
                {
                    if(vs[j])
                        continue;
                    if(abs(a[i]-b[j])<mn)
                    {
                        mn=abs(a[i]-b[j]);
                        id=j;
                    }
                }
                vs[id]=1;
                bn[i]=b[id];
            }
            ll mx=0;
            for(int i=0; i<n; i++)
            {
                mx=max(mx,abs(a[i]-bn[i]));
            }
            cout<<min(mx,mn1)<<endl;
            return 0;
        }
            ll mn1=1e9;
            for(int i=0; i<=(n-1)-(m-1); i++)
            {
                ll mx=0;
                int k=0;
                for(int j=i; j<i+m; j++)
                {
                    mx=max(mx,abs(a[j]-b[k]));
                    k++;
                }
                mn1=min(mn1,mx);
            }
            //
        vector<bool>vs(n);
        vector<ll>an(m);
        for(int i=0;i<m;i++)
        {
            ll mn=1e9;
            for(int j=0; j<n; j++)
            {
                if(vs[j])
                    continue;
                if(abs(b[i]-a[j])<mn)
                {
                    mn=abs(b[i]-a[j]);
                    id=j;
                }
            }
            vs[id]=1;
            an[i]=a[id];
        }
        ll mx=0;
        for(int i=0; i<m; i++)
        {
            mx=max(mx,abs(b[i]-an[i]));
        }
        cout<<min(mx,mn1)<<endl;
        return 0;
    }

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 3408 KB Output is correct
2 Correct 42 ms 3672 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 3664 KB Output is correct
2 Correct 43 ms 3660 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 332 KB Output is correct
2 Correct 32 ms 488 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 32 ms 460 KB Output is correct

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 432 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1092 ms 3020 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 1098 ms 3928 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 1095 ms 2964 KB Time limit exceeded
2 Halted 0 ms 0 KB -