oj.uz

Submission #472242

# Submission time Handle Problem Language Result Execution time Memory
472242 2021-09-13T10:09:33 Z SaraMostafa Cipele (COCI18_cipele) C++14
27 / 90
 1000 ms 1876 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];
    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;
    }
    ll mx=0;
    if(n<m)
    {
        ll mn=1e9;
        for(int i=0; i<=(m-1)-(n-1); i++)
        {
            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;
            mn=min(mn,mx);
        }
        cout<<mn<<endl;
        return 0;
    }
    ll mn=1e9;
        for(int i=0; i<=(n-1)-(m-1); i++)
        {
            mx=0;
            int k=0;
            for(int j=i; j<i+m; j++)
            {
                mx=max(mx,abs(a[j]-b[k]));
                k++;
            }
            mn=min(mn,mx);
        }
        cout<<mn<<endl;
        return 0;
    }

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 1876 KB Output is correct
2 Correct 41 ms 1868 KB Output is correct

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 9.0

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

Subtask #6
0 / 9.0

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

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 332 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 1090 ms 1484 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

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