# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1060883 | vjudge1 | Wiring (IOI17_wiring) | C++17 | 0 ms | 0 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;
#define ll long long
ll min_total_length(int r[],int b[]){
ll ans=0;
ll n=sizeof(r)/sizeof(r[0]);
ll m=sizeof(b)/sizeof(b[0]);
for(int i=0;i<n;i++)
ans+=r[n-1]-r[i];
for(int i=0;i<m;i++)
ans+=b[i]-r[n-1];
ans+=max(0LL,n-m)*(b[0]-r[n-1]);
return ans;
}
// int main(){
// }