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 "wiring.h"
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;
/*
Number of wires = max(r.size(), b.size())
*/
//Subtask 2: r[i] < b[j]
long long min_total_length(vector<int> r, vector<int> b)
{
int R = r.size(), B = b.size();
long long res = 0;
for(int x: b) res += (long long)(x);
for(int x: r) res -= (long long)(x);
for(int i = 0; i < R-B; i++) res += (long long)(b[0]);
for(int i = 0; i < B-R; i++) res -= (long long)(r[R-1]);
return res;
}
# | 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... |