oj.uz

Submission #464660

# Submission time Handle Problem Language Result Execution time Memory
464660 2021-08-13T15:43:34 Z Blobo2_Blobo2 Cipele (COCI18_cipele) C++14
90 / 90
 59 ms 2380 KB 
/*
Editor: Abdelrahman Hossam
Nickname: Blobo2_Blobo2
IOI next year isA :)
*/
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx2,tune=native")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-funroll-all-loops,-fpeel-loops,-funswitch-loops")
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define endl "\n"
#define all(v)  v.begin(),v.end()
#define gen(arr,n,nxt)  generate(arr,arr+n,nxt)
#define Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty ios_base::sync_with_stdio(false);cin.tie(0);

const int mo=1e9+7,INF=1e18;
int nxt(){int x;cin>>x;return x;}
signed main(){
    Blobo2_el_7akim_elly_3ayz_yro7_IOI_w_3ayz_yakol_jilaty
    int n=nxt(),m=nxt();
    int left[max(n,m)],right[max(n,m)];
    gen(left,n,nxt);
    gen(right,m,nxt);
    int szl=n,szr=m;
    if(n>m){
        int temp[n];
        swap(szl,szr);
        for(int i=0;i<n;i++)
            temp[i]=left[i];
        memset(left,0,sizeof left);
        for(int i=0;i<m;i++)
            left[i]=right[i];
        memset(right,0,sizeof right);
        for(int i=0;i<n;i++)
            right[i]=temp[i];
    }
    sort(left,left+szl);
    sort(right,right+szr);
    int s=0,e=1e9;
    while(s<=e){
        int mid = (s+e)>>1;
        int j=0;
        for(int i=0;i<szr&&j<szl;i++)
            if(abs(left[j] - right[i])<=mid)
                j++;
        if(j == szl)e=mid-1;
        else s=mid+1;
    }
    cout<<s;
    return 0;
}

Compilation message

cipele.cpp:19:24: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   19 | const int mo=1e9+7,INF=1e18;
      |                        ^~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 972 KB Output is correct
2 Correct 59 ms 1084 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 972 KB Output is correct
2 Correct 58 ms 2352 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
9.0 / 9.0

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

Subtask #7
9.0 / 9.0

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

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 1048 KB Output is correct
2 Correct 36 ms 988 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 1032 KB Output is correct
2 Correct 30 ms 2380 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 1000 KB Output is correct
2 Correct 50 ms 1228 KB Output is correct