Submission #472525

#TimeUsernameProblemLanguageResultExecution timeMemory
472525Beboo44Cipele (COCI18_cipele)C++17
27 / 90
200 ms262148 KiB
#include <bits/stdc++.h> using namespace std; #define all(v) ((v).begin()), ((v).end()) #define sz(v) ((int)((v).size())) typedef long long ll; typedef vector<int> vi; typedef vector<pair<ll , int> > vpli; typedef set<char> st; typedef stack<int> s; typedef deque<int> dq; typedef queue<int> q; #define fast_io ios_base::sync_with_stdio(0); cin.tie(0) int minugly (vector<ll> x, vector<ll> y, int i,int j){ if(j-i+1==y.size()){ ll ans =0; for(int f=0; f<x.size();++f){ ans = max(ans,abs(x[f]-y[f])); } return ans; } else{ if(abs(x[i]-y[0])>abs(x[j]-y[y.size()-1])){ x.erase(x.begin()+i); return minugly(x,y,i,x.size()-1); } else if (abs(x[j]-y[y.size()-1])>abs(x[i]-y[0])){ x.erase(x.begin()+j); return minugly(x,y,i,x.size()-1); } else{ int choice1 = minugly(x,y,i+1,j); int choice2 = minugly(x,y,i,j-1); return min(choice1,choice2); } } } int main() { ll n,m; cin>>n>>m; vector<ll>leftt(n); vector<ll>rightt(m); for(int i=0; i<n; ++i){ cin>>leftt[i]; } for(int i=0; i<m; ++i){ cin>>rightt[i]; } sort(leftt.begin(),leftt.end()); sort(rightt.begin(),rightt.end()); ll ans=0; if(leftt.size()>rightt.size()){ ans = minugly(leftt,rightt,0,n-1); } else if (leftt.size()<rightt.size()){ ans = minugly(rightt,leftt,0,m-1); } else{ for(int i=0; i<n; ++i){ ans=max(ans,abs(leftt[i]-rightt[i])); } } cout<<ans<<endl; return 0; }

Compilation message (stderr)

cipele.cpp: In function 'int minugly(std::vector<long long int>, std::vector<long long int>, int, int)':
cipele.cpp:14:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     if(j-i+1==y.size()){
      |        ~~~~~^~~~~~~~~~
cipele.cpp:16:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |         for(int f=0; f<x.size();++f){
      |                      ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...