제출 #1239240

#제출 시각아이디문제언어결과실행 시간메모리
1239240mychecksedad전선 연결 (IOI17_wiring)C++20
0 / 100
12 ms4168 KiB
#include "wiring.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define ff first
#define ss second
#define vi vector<int>
#define ll long long int
#define all(x) x.begin(),x.end()
const int N = 250;

ll dp[N][N];
long long min_total_length(std::vector<int> R, std::vector<int> B) {
	vector<ll> r(all(R));
	vector<ll> b(all(B));
	int n = r.size();
	int m = b.size();
	
	vector<pair<ll, int>> dp(n);
	// for(ll x: r) pt.pb({x, 0});
	// for(ll x: b) pt.pb({x, 1});

	dp[0] = {abs(r[0] - b[0]), 0};
	for(int i = 1; i < n; ++i){
		dp[i] = {dp[i - 1].ff + abs(r[i] - b[dp[i - 1].ss]), dp[i - 1].ss};
		if(dp[i - 1].ss + 1 < m){
			ll nxt = dp[i - 1].ff + abs(r[i] - b[dp[i - 1].ss + 1]);
			if(dp[i].ff >= nxt || n - i == m - dp[i - 1].ss - 1){
				dp[i] = {nxt, dp[i - 1].ss + 1};
			}
		}
	}


	return dp[n-1].ff;
}
#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...