#include "wiring.h"
#include <bits/stdc++.h>
#define pos first
#define col second
using namespace std;
using ll = long long;
const int N = 2e5+1;
const ll INF = 1e17;
int n;
vector<pair<int,int> > a;
ll s[N], dp[N];
inline ll fl(int j, int k) { // j, k part of sum when i-k < k-j
return dp[j] + s[j] - 2*s[k] - (j-2*k)*a[k+1].pos;
}
inline ll fg(int j, int k) {
return dp[j] + s[j] - 2*s[k] - (j-2*k)*a[k].pos;
}
set<pair<int,int> > stl, stg; // l: j <= 2*k-i, g: j > 2*k-i
ll min_total_length(std::vector<int> r, std::vector<int> b) {
n = r.size() + b.size();
for(int i = 0; i < r.size(); i++) a.emplace_back(r[i], 0);
for(int i = 0; i < b.size(); i++) a.emplace_back(b[i], 1);
a.emplace_back(INT_MIN, INT_MIN);
sort(a.begin(), a.end());
for(int i = 1; i <= n; i++) s[i] = s[i-1] + a[i].pos;
fill(dp+1, dp+n+1, INF);
for(int i = 2, k = 0; i <= n; i++) {
if(a[i].col != a[i-1].col) {
k = i-1;
stl.clear();
stg.clear();
for(int j = k-1; j >= 0 && a[j+1].col == a[k].col; j--)
stl.emplace(fl(j, k), j);
}
if(!k) continue;
// case segments completely disjoint
if(!stl.empty()) dp[i] = min(stl.begin()->first + s[i] - 1ll * i * a[k+1].pos, dp[i]);
if(!stg.empty()) dp[i] = min(stg.begin()->first + s[i] - 1ll * i * a[k].pos, dp[i]);
if(!stl.empty()) {
stl.erase(make_pair(fl(2*k-i, k), 2*k-i));
stg.emplace(make_pair(fg(2*k-i, k), 2*k-i));
}
// special case: segments intersect at one node
if(k-1 >= 1 && a[k-1].col == a[i].col)
dp[i] = min(dp[k] + s[i] - s[k] - 1ll * (i-k) * a[k].pos, dp[i]);
}
return dp[n];
}
Compilation message
wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:22:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < r.size(); i++) a.emplace_back(r[i], 0);
^
wiring.cpp:23:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < b.size(); i++) a.emplace_back(b[i], 1);
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
1 ms |
352 KB |
Output is correct |
| 3 |
Correct |
1 ms |
352 KB |
Output is correct |
| 4 |
Correct |
2 ms |
552 KB |
Output is correct |
| 5 |
Correct |
2 ms |
552 KB |
Output is correct |
| 6 |
Correct |
1 ms |
552 KB |
Output is correct |
| 7 |
Correct |
2 ms |
672 KB |
Output is correct |
| 8 |
Correct |
2 ms |
672 KB |
Output is correct |
| 9 |
Correct |
2 ms |
672 KB |
Output is correct |
| 10 |
Correct |
1 ms |
672 KB |
Output is correct |
| 11 |
Correct |
2 ms |
672 KB |
Output is correct |
| 12 |
Correct |
2 ms |
672 KB |
Output is correct |
| 13 |
Correct |
2 ms |
672 KB |
Output is correct |
| 14 |
Correct |
1 ms |
672 KB |
Output is correct |
| 15 |
Correct |
2 ms |
672 KB |
Output is correct |
| 16 |
Correct |
2 ms |
672 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
672 KB |
Output is correct |
| 2 |
Correct |
1 ms |
672 KB |
Output is correct |
| 3 |
Incorrect |
157 ms |
10012 KB |
3rd lines differ - on the 1st token, expected: '41596985758595', found: '-24845617503342' |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
10012 KB |
Output is correct |
| 2 |
Correct |
1 ms |
10012 KB |
Output is correct |
| 3 |
Incorrect |
87 ms |
10012 KB |
3rd lines differ - on the 1st token, expected: '1068938599', found: '-99805376289484' |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
10012 KB |
Output is correct |
| 2 |
Incorrect |
111 ms |
10012 KB |
3rd lines differ - on the 1st token, expected: '373710605', found: '-21101125875' |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
1 ms |
352 KB |
Output is correct |
| 3 |
Correct |
1 ms |
352 KB |
Output is correct |
| 4 |
Correct |
2 ms |
552 KB |
Output is correct |
| 5 |
Correct |
2 ms |
552 KB |
Output is correct |
| 6 |
Correct |
1 ms |
552 KB |
Output is correct |
| 7 |
Correct |
2 ms |
672 KB |
Output is correct |
| 8 |
Correct |
2 ms |
672 KB |
Output is correct |
| 9 |
Correct |
2 ms |
672 KB |
Output is correct |
| 10 |
Correct |
1 ms |
672 KB |
Output is correct |
| 11 |
Correct |
2 ms |
672 KB |
Output is correct |
| 12 |
Correct |
2 ms |
672 KB |
Output is correct |
| 13 |
Correct |
2 ms |
672 KB |
Output is correct |
| 14 |
Correct |
1 ms |
672 KB |
Output is correct |
| 15 |
Correct |
2 ms |
672 KB |
Output is correct |
| 16 |
Correct |
2 ms |
672 KB |
Output is correct |
| 17 |
Correct |
2 ms |
672 KB |
Output is correct |
| 18 |
Correct |
1 ms |
672 KB |
Output is correct |
| 19 |
Incorrect |
157 ms |
10012 KB |
3rd lines differ - on the 1st token, expected: '41596985758595', found: '-24845617503342' |
| 20 |
Halted |
0 ms |
0 KB |
- |
