#266117 (C++14) No.703 ゴミ拾い Easy

提出ソース

結果

問題	No.703 ゴミ拾い Easy
ユーザー	しらっ亭
提出日時	2018-06-15 23:25:54
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	88 ms / 1,500 ms
コード長	6,510 bytes
コンパイル時間	1,454 ms
コンパイル使用メモリ	125,104 KB
実行使用メモリ	12,672 KB
最終ジャッジ日時	2024-06-10 18:30:17
合計ジャッジ時間	4,727 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	1 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	1 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	1 ms 5,376 KB
testcase_17	AC	2 ms 5,376 KB
testcase_18	AC	2 ms 5,376 KB
testcase_19	AC	2 ms 5,376 KB
testcase_20	AC	2 ms 5,376 KB
testcase_21	AC	2 ms 5,376 KB
testcase_22	AC	2 ms 5,376 KB
testcase_23	AC	2 ms 5,376 KB
testcase_24	AC	78 ms 12,544 KB
testcase_25	AC	77 ms 12,672 KB
testcase_26	AC	77 ms 12,544 KB
testcase_27	AC	82 ms 12,672 KB
testcase_28	AC	88 ms 12,672 KB
testcase_29	AC	85 ms 12,596 KB
testcase_30	AC	79 ms 12,448 KB
testcase_31	AC	78 ms 12,512 KB
testcase_32	AC	78 ms 12,672 KB
testcase_33	AC	78 ms 12,588 KB
testcase_34	AC	68 ms 12,432 KB
testcase_35	AC	65 ms 12,544 KB
testcase_36	AC	66 ms 12,524 KB
testcase_37	AC	66 ms 12,544 KB
testcase_38	AC	68 ms 12,520 KB
testcase_39	AC	69 ms 12,544 KB
testcase_40	AC	65 ms 12,560 KB
testcase_41	AC	66 ms 12,540 KB
testcase_42	AC	66 ms 12,592 KB
testcase_43	AC	66 ms 12,608 KB
testcase_44	AC	2 ms 5,376 KB
testcase_45	AC	1 ms 5,376 KB
testcase_46	AC	79 ms 12,544 KB
testcase_47	AC	80 ms 12,544 KB
testcase_48	AC	2 ms 5,376 KB
testcase_49	AC	2 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <deque>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
using namespace std;

#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define TEN(n) ((ll)(1e##n))
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}
template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}
template<class T>void print(T t){cout<<t<<"\n";}
template<class H,class... T>void print(H h,T... t){cout<<h<<" ";print(t...);}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}

template <class T, bool getMonotone=true, bool getMin=true> struct ConvexHullTrickAddQueryMonotone {
	deque<pair<T, T>> L;

	static bool cmp(const T l, const T r) {
		return getMin ? l >= r : l <= r;
	}

	static bool checkRemove(const pair<T, T> &a, const pair<T, T> &b, const pair<T, T> &c) {
		if (getMin) return (b.first - a.first) * (c.second - b.second) >= (b.second - a.second) * (c.first - b.first);
		else        return (b.second - a.second) * (a.first - c.first) >= (c.second - a.second) * (a.first - b.first);
	}

	static T f(const pair<T, T> &a, const T x) {
		return a.first * x + a.second;
	}

	int size() const { return L.size(); }

	bool empty() const { return L.empty(); }

	void add(const T a, const T b) {
		pair<T, T> line(a, b);

		while (!L.empty() && L.back().first == a) {
			line.second = getMin ? min(line.second, L.back().second) : max(line.second, L.back().second);
			L.pop_back();
		}
		while (L.size() >= 2 && checkRemove(L[L.size()-2], L[L.size()-1], line)) L.pop_back();
		L.emplace_back(line);
	}

	T get(const T x) {
		if (getMonotone) {
			while (L.size() >= 2 && cmp(f(L[0], x), f(L[1], x))) L.pop_front();
			return f(L.front(), x);
		}
		else {
			int low = -1, high = (int)L.size() - 1;
			while (high - low > 1) {
				int mid = (low + high) >> 1;
				if (cmp(f(L[mid], x), f(L[mid + 1], x))) low = mid;
				else high = mid;
			}
			return f(L[high], x);
		}
	}
};

ll solve() {
	int n = ri();
	vector<ll> A(n);
	rep(i, n) A[i] = ri();
	vector<ll> X(n);
	rep(i, n) X[i] = ri();
	vector<ll> Y(n);
	rep(i, n) Y[i] = ri();

	const ll inf = 1e18;

	vl dp(n+1, inf);
	dp[0] = 0;

	if (0) {
		auto cost = [&](int i, int j) -> ll {
			ll dx = X[j] - A[i];
			ll dy = Y[j];
			return dx * dx + dy * dy;
		};

		rep(i, n) {
			rep(j, i+1) {
				amin(dp[i+1], dp[j] + cost(i, j));
			}
		}
		out(dp);
	}

	fill(all(dp), inf);
	dp[0] = 0;
	ConvexHullTrickAddQueryMonotone<ll> cht;

	rep(i, n) {
		cht.add(-2 * X[i], dp[i] + X[i] * X[i] + Y[i] * Y[i]);
		dp[i+1] = cht.get(A[i]) + A[i] * A[i];
	}
	out(dp);
	return dp[n];

}

void Main() {
	cout << solve() << endl;
}
signed main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	Main();
	return 0;
}

yukicoder

結果

テストケース

ソースコード