# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
283400 | DystoriaX | Wiring (IOI17_wiring) | C++14 | 1 ms | 384 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 "wiring.h"
#include <algorithm>
#include <iostream>
#include <set>
using namespace std;
vector<pair<int, int> > v;
const long long INF = 1e18;
long long dp[200010], val[200010];
multiset<long long> s, sk;
long long lazy;
long long min_total_length(std::vector<int> r, std::vector<int> b) {
for(auto &k : r) v.emplace_back(k, 0);
for(auto &k : b) v.emplace_back(k, 1);
sort(v.begin(), v.end());
int last = -1;
for(int i = 1; i < (int) v.size(); i++){
if(v[i].second == v[i - 1].second) continue;
else {last = i; break;}
}
for(int i = 0; i < (int) v.size(); i++) dp[i] = 1e17;
// cerr << last << "\n";
int lpos = v[last - 1].first, cpos = v[last].first;
int ls = -1, conmax = 0;
Compilation message (stderr)
# | 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... |