제출 #151689

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
151689		dolphingarlic	전선 연결 (IOI17_wiring)	C++14	100 / 100	51 ms	8568 KiB

wiring

#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;

long long dp[200001], all[200001], pref_min[200001]{INF}, pref_sum[200001];
vector<pair<int, int>> clusters;

long long min_total_length(vector<int> r, vector<int> b) {
	int n = r.size() + b.size();
	
	for (int i=0, ri=0, bi=0, lc=-1, cc; i<n; ++i, lc=cc) {
		if(ri >= r.size() || bi < b.size() && b[bi] < r[ri]) {
			all[i] = b[bi++];
			cc = 0;
		} else {
			all[i] = r[ri++];
			cc = 1;
		}

		pref_sum[i + 1] = all[i] + pref_sum[i];
		if (cc != lc)
			clusters.push_back({i, i});
		else
			clusters.back().second++;
	}

	for (int i = clusters[0].first; i <= clusters[0].second; i++) dp[i + 1] = INF;
	for (int i = 0; i < clusters.size() - 1; i++) {
		for (int j = 0; j <= clusters[i].second - clusters[i].first; j++) {
			pref_min[j + 1] = min(pref_min[j], min(dp[clusters[i].first + j], dp[clusters[i + 1].first]) + (clusters[i].second - clusters[i].first + 1 - j) * all[clusters[i + 1].first] + pref_sum[clusters[i].first + j]);
		}
		long long min_2 = INF;

		for (int j = 0; j <= clusters[i + 1].second - clusters[i + 1].first; j++) {
			dp[clusters[i + 1].first + j + 1] = min_2 - (j + 1) * all[clusters[i].second];
			if (j <= clusters[i].second - clusters[i].first) {
				dp[clusters[i + 1].first + j + 1] = min(dp[clusters[i + 1].first + j + 1], pref_min[clusters[i].second - clusters[i].first + 1 - j] - (j + 1) * all[clusters[i + 1].first]);
				min_2 = min(min_2, min(dp[clusters[i].second - j], dp[clusters[i + 1].first]) + (j + 1) * all[clusters[i].second] + pref_sum[clusters[i].second - j]);
			}

			dp[clusters[i + 1].first + j + 1] += pref_sum[clusters[i + 1].first + j + 1]- 2 * pref_sum[clusters[i + 1].first];
		}
	}

	return dp[n];
}

컴파일 시 표준 에러 (stderr) 메시지

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:14:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(ri >= r.size() || bi < b.size() && b[bi] < r[ri]) {
      ~~~^~~~~~~~~~~
wiring.cpp:14:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(ri >= r.size() || bi < b.size() && b[bi] < r[ri]) {
                        ~~~^~~~~~~~~~
wiring.cpp:14:38: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   if(ri >= r.size() || bi < b.size() && b[bi] < r[ri]) {
wiring.cpp:30:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < clusters.size() - 1; i++) {
                  ~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 13 / 13
• Subtask 3: 10 / 10
• Subtask 4: 25 / 25
• Subtask 5: 45 / 45