제출 #406878

#제출 시각아이디문제언어결과실행 시간메모리
406878casperwang전선 연결 (IOI17_wiring)C++14
13 / 100
29 ms2636 KiB
#include "wiring.h"
#include <bits/stdc++.h>
#define int long long
#define pb emplace_back
#define All(x) x.begin(), x.end()
#define pii pair<int,int>
#define ff first
#define ss second
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

const int INF = 1e18;

vector<pii> build(vector<signed> r, vector<signed> b) {
	vector<pii> arr;
	for (int i : r) arr.pb(i, 0);
	for (int i : b) arr.pb(i, 1);
	sort(All(arr));
	return arr;
}

int solve(vector<signed> r, vector<signed> b) {
	int ans = 0;
	if (r[0] > b[0]) {
		for (int v : r) ans += v;
		for (int v : b) ans -= v;
		if (r.size() < b.size())
			for (int i = 0; i < b.size() - r.size(); i++)
				ans += r[0];
		else
			for (int i = 0; i < r.size() - b.size(); i++)
				ans -= b[b.size()-1];
	} else {
		for (int v : b) ans += v;
		for (int v : r) ans -= v;
		if (r.size() < b.size())
			for (int i = 0; i < b.size() - r.size(); i++)
				ans -= r[r.size()-1];
		else
			for (int i = 0; i < r.size() - b.size(); i++)
				ans += b[0];
	}
	return ans;
	/*
	vector<pii> arr = build(r, b);
	vector<int> dp(arr.size()+1);
	int kL, kR = -1;
	int inc;
	bool flag = false;
	for (int i = 0; i < arr.size(); i++) {
		if (flag) {
			inc += arr[i].ff;
			int dec = (i - kR) * (- arr[kR].ff);
			dp[i+1] = dp[kR] + inc + dec;
			for (int j = kR-1; j >= kL; j--) {
				if (kR - j + 1 > i - kR)
					dec += arr[kR+1].ff - arr[kR].ff;
				dec += arr[kR].ff - arr[j].ff;
				dp[i+1] = min(dp[i+1], dp[j] + inc + dec);
			}
		} else dp[i+1] = INF;
		if (i+1 < arr.size() && arr[i].ss != arr[i+1].ss) {
			kL = kR + 1, kR = i;
			flag = true;
			inc = 0;
		}
	}
	return dp[arr.size()];
	*/
}

int min_total_length(vector<signed> r, vector<signed> b) {
	int ans = solve(r, b);
	return ans;
}

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

wiring.cpp: In function 'long long int solve(std::vector<int>, std::vector<int>)':
wiring.cpp:31:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |    for (int i = 0; i < b.size() - r.size(); i++)
      |                    ~~^~~~~~~~~~~~~~~~~~~~~
wiring.cpp:34:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |    for (int i = 0; i < r.size() - b.size(); i++)
      |                    ~~^~~~~~~~~~~~~~~~~~~~~
wiring.cpp:40:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |    for (int i = 0; i < b.size() - r.size(); i++)
      |                    ~~^~~~~~~~~~~~~~~~~~~~~
wiring.cpp:43:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |    for (int i = 0; i < r.size() - b.size(); i++)
      |                    ~~^~~~~~~~~~~~~~~~~~~~~
#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...