oj.uz

Submission #164230

# Submission time Handle Problem Language Result Execution time Memory
164230 2019-11-18T17:41:20 Z Nashik Cipele (COCI18_cipele) C++14
90 / 90
 164 ms 2900 KB 
#include <iostream>
#include <algorithm>
using namespace std;
int v1[100005],v2[100005],n,m,sol=-1;
void cb(int st,int dr){
    if(st>dr)
        return;
    int mid=(st+dr)/2;
    int point=1;
    for(int i=1;i<=n;i++){
        if(point>m){
            cb(mid+1,dr);
                return;
        }
        while(abs(v1[i]-v2[point])>mid){
            point++;
            if(point==m+1){
                cb(mid+1,dr);
                return;
            }
        }
        point++;
    }
    sol=mid;
    cb(st,mid-1);
}
int main()
{
    cin>>n>>m;
    if(n>m){
        for(int i=1;i<=n;i++){
            cin>>v2[i];
        }
        for(int i=1;i<=m;i++){
            cin>>v1[i];
        }
        swap(n,m);
    }
    else{
        for(int i=1;i<=n;i++){
            cin>>v1[i];
        }
        for(int i=1;i<=m;i++)
            cin>>v2[i];
    }
    sort(v1+1,v1+n+1);
    sort(v2+1,v2+m+1);
    cb(0,1000000000);
    cout<<sol;
    return 0;
}
/*
4 3
2 39 41 45
39 42 46

2 3
2 3
1 2 3

5 5
7 6 1 2 10
9 11 6 3 12


3 5
1000000000 1000000000 1000000000
0 0 0 0 1
*/

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 1144 KB Output is correct
2 Correct 162 ms 1144 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 1144 KB Output is correct
2 Correct 164 ms 2900 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 376 KB Output is correct
2 Correct 11 ms 376 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 10 ms 376 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 11 ms 504 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 380 KB Output is correct
2 Correct 10 ms 376 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 376 KB Output is correct
2 Correct 10 ms 376 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 956 KB Output is correct
2 Correct 98 ms 808 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 1016 KB Output is correct
2 Correct 98 ms 2040 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 1064 KB Output is correct
2 Correct 137 ms 1016 KB Output is correct