# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1110209 | vjudge1 | Growing Vegetables is Fun 5 (JOI24_vegetables5) | C++17 | 5068 ms | 592 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int n;
int a[20],b[20];
bool check(vector<int>&p){
int f1=0,l1=0;
int f2=0,l2=0;
for(int i=2*n-1;i>=0;i--){
if(p[i]<n)f1=i;
else f2=i;
}
for(int i=0;i<2*n;i++){
if(p[i]<n)l1=i;
else l2=i;
}
return ((l1-f1)<n||(l2-f2)<n);
}
int cal(vector<int>p){
int res=0;
for(int i=0;i<2*n;i++){
res=max(res,abs(a[i]-b[p[i]]));
}
return res;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
if(fopen("c.INP","r")){
freopen("c.INP","r",stdin);
freopen("c.OUT","w",stdout);
}
cin >>n;
vector<int>p;
for(int i=0;i<2*n;i++){
cin >>a[i];
p.push_back(i);
}
for(int i=0;i<n;i++){
cin >>b[i];
}
for(int i=n;i<2*n;i++){
cin >>b[i];
}
int asw=2e9+1;
asw=min(asw,cal(p));
while(next_permutation(p.begin(),p.end())){
if(check(p))asw=min(asw,cal(p));
}
cout <<asw;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |