Submission #472346

#	Time	Username	Problem	Language	Result	Execution time	Memory
472346		AbdoMo	Cipele (COCI18_cipele)	C++17	18 / 90	1093 ms	1956 KiB

cipele

#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
const int mod = 1e9+7;
using namespace std;
bool comp(pair<int,int>&a ,pair<int,int>&b)
{
    if(a.first==b.first)
    {
        return a.second>b.second;
    }
    return a.first<b.first;

}
int gans(int n,int m,int arr[],int arr2[])
{
    int tans=0;
    bool vis1[100005]={};
    int c=0;
    for(int i=0;i<n;i++)
    {
        int t=1e13;
        int ind=0;
        for(int j=0;j<m;j++)
        {
            if(vis1[j])continue;
            if(abs(arr[i]-arr2[j])<=t)
            {
                t=abs(arr[i]-arr2[j]);
                ind = j;
            }

        }
        vis1[ind]=1;
        tans=max(tans,t);
        
    }
    return tans;
}
void solve()
{
    int n,m;
    cin>>n>>m;
    int arr[100005],arr2[100005];
    for(int i=0;i<n;i++)
    {
        cin>>arr[i];
    }
    for(int i=0;i<m;i++)
    {
        cin>>arr2[i];
    }
    int ans=1e13;
    sort(arr,arr+n);
    sort(arr2,arr2+m);
    ans=min(ans,gans(n,m,arr,arr2));
    ans=min(ans,gans(m,n,arr2,arr));

    reverse(arr,arr+n);
    ans=min(ans,gans(n,m,arr,arr2));
    ans=min(ans,gans(m,n,arr2,arr));

    reverse(arr2,arr2+m);
    ans=min(ans,gans(n,m,arr,arr2));
    ans=min(ans,gans(m,n,arr2,arr));

    reverse(arr2,arr2+m);
    ans=min(ans,gans(n,m,arr,arr2));
    ans=min(ans,gans(m,n,arr2,arr));
    cout<<ans<<endl;


}
int32_t main(){
	int t=1;
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //cin>>t;
	while(t--){solve();}
	return 0;
}

Compilation message (stderr)

cipele.cpp: In function 'long long int gans(long long int, long long int, long long int*, long long int*)':
cipele.cpp:20:9: warning: unused variable 'c' [-Wunused-variable]
   20 |     int c=0;
      |         ^

• Subtask 1: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9