#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF=1e18;
ll dp[200001],mn[200001],mn2,val[200002],sum[200001];
pair <int, int> position[200001];
int id,cur[2],l,r,lo;
ll min_total_length(vector <int> a, vector <int> b){
for (int i:a)
position[++id]={i,0};
for (int i:b)
position[++id]={i,1};
sort(position+1,position+id+1);
for (int i=id;i;i--){
val[i]=cur[position[i].second^1]-position[i].first;
if (i<id&&position[i+1].second==position[i].second)
val[i]+=val[i+1];
if (position[i].second!=position[i-1].second)
cur[position[i].second]=position[i].first;
}
for (int i=1;i<=id;i++)
sum[i]=sum[i-1]+position[i].first;
mn[0]=val[1];
for (int i=1;i<=id;i++){
dp[i]=INF;
if (l){
if (i-r>=r-l+1)
dp[i]=mn2+sum[i]-sum[r]-position[r].first*(i-r);
else
dp[i]=mn[r*2-i]-val[r*2-i+1]+sum[i]-sum[r]*2+sum[r*2-i];
}
mn[i]=min(mn[i-1],dp[i]+val[i+1]);
if (i==1||position[i-1].second!=position[i].second){
lo=i;
mn[i]=min(dp[i-1]+val[i],dp[i]+val[i+1]);
}
if (position[i].second!=position[i+1].second){
l=lo;
r=i;
mn2=INF;
for (int i=l-1;i<r;i++)
mn2=min(mn2,dp[i]+position[r].first*(r-i)-sum[r]+sum[i]);
}
}
return dp[id];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
2396 KB |
3rd lines differ - on the 1st token, expected: '25859', found: '26187' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Correct |
1 ms |
2584 KB |
Output is correct |
3 |
Correct |
18 ms |
9052 KB |
Output is correct |
4 |
Correct |
16 ms |
9052 KB |
Output is correct |
5 |
Incorrect |
16 ms |
8976 KB |
3rd lines differ - on the 1st token, expected: '41752125325332', found: '58373648760852' |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Correct |
1 ms |
2396 KB |
Output is correct |
3 |
Incorrect |
34 ms |
11548 KB |
3rd lines differ - on the 1st token, expected: '1068938599', found: '9800724232' |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Incorrect |
28 ms |
9932 KB |
3rd lines differ - on the 1st token, expected: '373710605', found: '374255435' |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
2396 KB |
3rd lines differ - on the 1st token, expected: '25859', found: '26187' |
2 |
Halted |
0 ms |
0 KB |
- |