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>
#define fi first
#define se second
#define NAME "wiring"
using namespace std;
typedef long long LL;
typedef pair <int, int> pii;
typedef double DB;
typedef pair <LL, LL> pLL;
const int NMAX = 1e6+7;
int n, m;
LL min_total_length(vector <int> r, vector <int> b) {
LL res = 0;
n = r.size();
m = b.size();
if(r[n-1] < b[0]) {
for(int i = 0; i < n; ++i)
res -= r[i];
for(int i = 0; i < m; ++i)
res += b[i];
res += LL(max(n - m, 0)) * b[0];
res -= LL(max(m - n, 0)) * r[n-1];
return res;
}
return -1;
}
# | 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... |