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;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
#include "wiring.h"
long long min_total_length(std::vector<int> r, std::vector<int> b) {
int n,m;
n=r.size();
m=b.size();
llo ans=0;
for(int i=0;i<min(n,m);i++){
ans+=b[i]-r[i];
}
for(int i=min(n,m);i<n;i++){
ans+=b[0]-r[i];
}
for(int i=min(n,m);i<m;i++){
ans+=b[i]-r[n-1];
}
/*vector<int> rr;
vector<int> bb;
while(r.size() or b.size()){
for(auto i:r){
for(auto j:b){
}
}
}
*/
return ans;
}
/*int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
return 0;
}
*/
# | 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... |