#982325 (C++17) No.2764 Warp Drive Spacecraft

• 問題: No.2764 Warp Drive Spacecraft
• ユーザー: 沙耶花
• 提出日時: 2024-05-17 22:23:11
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: WA
• 実行時間: -
• コード長: 2,564 bytes
• コンパイル時間: 4,907 ms
• コンパイル使用メモリ: 276,256 KB
• 実行使用メモリ: 22,156 KB
• 最終ジャッジ日時: 2024-05-17 22:23:24
• 合計ジャッジ時間: 11,655 ms
• ジャッジサーバーID （参考情報）: judge4 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	AC	1 ms; 6,940 KB
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	RE	-
testcase_11	RE	-
testcase_12	RE	-
testcase_13	RE	-
testcase_14	AC	2 ms; 6,944 KB
testcase_15	AC	2 ms; 6,940 KB
testcase_16	AC	243 ms; 22,016 KB
testcase_17	WA	-
testcase_18	WA	-
testcase_19	RE	-
testcase_20	RE	-
testcase_21	RE	-
testcase_22	RE	-
testcase_23	RE	-
testcase_24	RE	-
testcase_25	RE	-
testcase_26	RE	-
testcase_27	RE	-
testcase_28	RE	-
testcase_29	RE	-
testcase_30	RE	-
testcase_31	RE	-
testcase_32	RE	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-

コンパイルメッセージ

main.cpp:20:9: warning: #pragma once in main file
   20 | #pragma once
      |         ^~~~

ソースコード

#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001
/**
 * Author: Simon Lindholm
 * Date: 2017-04-20
 * License: CC0
 * Source: own work
 * Description: Container where you can add lines of the form kx+m, and query maximum values at points x.
 *  Useful for dynamic programming (``convex hull trick'').
 * Time: O(\log N)
 * Status: stress-tested
 */
#pragma once
using ll =long long;
struct Line {
	mutable ll k, m, p;
	bool operator<(const Line& o) const { return k < o.k; }
	bool operator<(ll x) const { return p < x; }
};

struct LineContainer : multiset<Line, less<>> {
	// (for doubles, use inf = 1/.0, div(a,b) = a/b)
	static const ll inf = LLONG_MAX;
	ll div(ll a, ll b) { // floored division
		return a / b - ((a ^ b) < 0 && a % b); }
	bool isect(iterator x, iterator y) {
		if (y == end()) return x->p = inf, 0;
		if (x->k == y->k) x->p = x->m > y->m ? inf : -inf;
		else x->p = div(y->m - x->m, x->k - y->k);
		return x->p >= y->p;
	}
	void add(ll k, ll m) {
		auto z = insert({k, m, 0}), y = z++, x = y;
		while (isect(y, z)) z = erase(z);
		if (x != begin() && isect(--x, y)) isect(x, y = erase(y));
		while ((y = x) != begin() && (--x)->p >= y->p)
			isect(x, erase(y));
	}
	ll query(ll x) {
		assert(!empty());
		auto l = *lower_bound(x);
		return l.k * x + l.m;
	}
};

vector<long long> get_distance(vector<vector<pair<int,long long>>> &E,int s){
	int N = E.size();
	vector<long long> dist(N,Inf64);
	dist[s] = 0;
	return dist;
	priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<pair<long long,int>>> pq;
	pq.push({0,s});
	while(!pq.empty()){
		auto [d,u] = pq.top();
		pq.pop();
		if(dist[u] !=d )continue;
		for(auto [v,w]:E[u]){
			if(dist[v] > dist[u] + w){
				dist[v] = dist[u] + w;
				pq.push({dist[v],v});
			}
		}
	}
	return dist;
}

int main(){
	int N,M;
	cin>>N>>M;
	vector<long long> w(N);
	rep(i,N)cin>>w[i];
	
	vector<vector<pair<int,long long>>> E(N);
	rep(i,M){
		int u,v,w;
		cin>>u>>v>>w;
		u--,v--;
		E[u].push_back({v,w});
		E[v].push_back({u,w});
	}
	
	auto x = get_distance(E,0),y = get_distance(E,N-1);
	long long ans = x[N-1];
	
	vector<long long> xs;
	rep(i,N){
		if(y[i]!=Inf64)xs.push_back(y[i]);
	}
	LineContainer cht;
	rep(i,N){
		if(x[i]==Inf64)continue;
		cht.add(-w[i],-x[i]);
	}
	rep(i,N){
		if(y[i]==Inf64)continue;
		ans = min(ans,-cht.query(w[i]) + y[i]);
	}
	cout<<ans<<endl;
	
	return 0;
}