oj.uz

Submission #361203

# Submission time Handle Problem Language Result Execution time Memory
361203 2021-01-28T16:17:10 Z daringtrifles Cipele (COCI18_cipele) C++17
45 / 90
 1000 ms 19180 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define FOR(i, a, b) for (signed ll i = (signed ll)(a); i < (signed ll)(b); i++)
#define NEGFOR(i, a, b) for (ll i = (a); i > (b); i--)
#define vll vector<ll>
#define sll set<ll>
#define ld long double
#define inf 1000000000000000000
#define mll multiset<ll>
#define vpll vector<pll>
#define nn << "\n"
#define ss << " "
//10^8 operations per second
//greatest int is 2,147,483,647
//greates long long is 9.22337204e18
ll l, r;
mll le, ri;
bool check(ll n)
{
    mll x=le;
    mll y=ri;
    if (l > r)
    {
        swap(l, r);
        swap(x, y);
    }
    for (auto i:x){
        auto it=y.lower_bound(i-n);
                //    cout<<"bye" <<endl;
      //  if (n==0) cout<<*--y.end() ss;

       // if 
        if (abs(*it-i)<=n){
         //    if (n==0) cout<<*it-i ss;
            y.erase(it);
        }
        else return 0;
    }
    return 1;
    
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> l >> r;

    FOR(i, 0, l)
    {
        ll a;
        cin >> a;
        le.insert(a);
    }
    FOR(i, 0, r)
    {
        ll a;
        cin >> a;
        ri.insert(a);
    }
    ll l=-1, r=inf;

    while (check(r)){
        ll mid=l+(r-l)/2;
        //cout<<mid <<endl;
        if (check(mid)){
            r=mid-1;
            //if (r==0) cout<<"yes";
        }
        else{
            l=mid+1;
        }
    }
    cout<<r+1;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 9.0

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

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 876 KB Output is correct
2 Correct 88 ms 1516 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 876 KB Output is correct
2 Correct 90 ms 1520 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 1132 KB Output is correct
2 Correct 86 ms 1388 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 1132 KB Output is correct
2 Correct 87 ms 1388 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 1260 KB Output is correct
2 Correct 87 ms 1388 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1099 ms 15724 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 1087 ms 17208 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 1089 ms 15468 KB Time limit exceeded
2 Halted 0 ms 0 KB -