제출 #313233

#제출 시각아이디문제언어결과실행 시간메모리
313233talant117408Wiring (IOI17_wiring)C++17
0 / 100
1 ms384 KiB
#include "wiring.h"
#include <bits/stdc++.h>
#include "wiring.h"

using namespace std;
 
typedef long long ll;
typedef pair <ll, ll> pii;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) (int)(v).size()
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

const ll INF = 1e18;
const int N = 2e5+7;

ll dp[N], pref[N];
int last[N];

ll min_total_length(vector<int> r, vector<int> b) {
    int nr = r.size(), nb = b.size(), n = nr + nb;
	vector <pii> v;
	for (int i = 0; i < nr; i++) {
        v.push_back({r[i], 0});
	}
	for (int i = 0; i < nb; i++) {
        v.push_back({b[i], 1});
	}
  	sort(all(v));
	dp[0] = INF;
  	pref[0] = v[0].first;
    last[0] = -1;
    for (int i = 1; i < n; i++) {
        dp[i] = INF;
        pref[i] = pref[i - 1] + v[i].first;
        last[i] = (v[i].second == v[i - 1].second) ? last[i - 1] : i - 1;
        if (last[i] == -1) continue;
        dp[i] = min(dp[i], dp[i - 1] + v[i].first - v[last[i]].first);
       
        if (last[last[i]] < last[i] - (i - last[i]) + 1) {
            dp[i] = min(dp[i], (pref[i] - pref[last[i]]) - (pref[last[i]] - pref[last[i] - (i - last[i])]) + dp[last[i] - (i - last[i])]);
        }
    }
    return dp[n - 1];
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...