# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66709 | leejseo | Wiring (IOI17_wiring) | C++11 | 3 ms | 564 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>
#include "wiring.h"
using namespace std;
typedef long long lld;
typedef pair<int, int> pii;
vector<pii> X;
vector<pii> Y;
lld S[200005];
int con[200001];
int lst[400002];
lld D[200002];
long long min_total_length(vector<int> A, vector<int> B) {
int N = A.size(), M = B.size();
int K = N+M;
int i = 0, j = 0;
while (i+j < K){
if (j >= M || (i < N && A[i] <= B[j])){
X.push_back(pii(A[i], 0));
if (j >= M) Y.push_back(pii(abs(A[i] - B.back()), M-1));
else Y.push_back(min(pii(abs(A[i]-B[j-1]), j-1), pii(abs(A[i]-B[j]), j)));
i++;
}
else{
X.push_back(pii(B[j], 1));
if (i >= N) Y.push_back(pii(abs(B[j] - A.back()), N-1));
else Y.push_back(min(pii(abs(A[i-1]-B[j]), i-1), pii(abs(A[i]-B[j]), i)));
# | 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... |