結果

問題 No.2805 Go to School
ユーザー akiaa11akiaa11
提出日時 2024-07-20 15:39:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 154 ms / 2,000 ms
コード長 4,092 bytes
コンパイル時間 4,207 ms
コンパイル使用メモリ 275,124 KB
実行使用メモリ 17,764 KB
最終ジャッジ日時 2024-07-20 15:39:42
合計ジャッジ時間 8,112 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 3 ms
5,248 KB
testcase_02 AC 3 ms
5,248 KB
testcase_03 AC 3 ms
5,376 KB
testcase_04 AC 86 ms
12,544 KB
testcase_05 AC 80 ms
9,100 KB
testcase_06 AC 57 ms
6,912 KB
testcase_07 AC 40 ms
6,528 KB
testcase_08 AC 65 ms
9,016 KB
testcase_09 AC 49 ms
6,912 KB
testcase_10 AC 42 ms
6,400 KB
testcase_11 AC 154 ms
16,756 KB
testcase_12 AC 79 ms
10,900 KB
testcase_13 AC 111 ms
13,592 KB
testcase_14 AC 18 ms
5,888 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 66 ms
8,004 KB
testcase_19 AC 45 ms
7,244 KB
testcase_20 AC 102 ms
10,668 KB
testcase_21 AC 144 ms
16,988 KB
testcase_22 AC 62 ms
9,344 KB
testcase_23 AC 99 ms
10,632 KB
testcase_24 AC 94 ms
10,424 KB
testcase_25 AC 30 ms
7,348 KB
testcase_26 AC 121 ms
17,764 KB
testcase_27 AC 63 ms
15,104 KB
testcase_28 AC 7 ms
6,912 KB
testcase_29 AC 11 ms
7,552 KB
testcase_30 AC 40 ms
11,776 KB
testcase_31 AC 61 ms
8,588 KB
testcase_32 AC 97 ms
13,560 KB
testcase_33 AC 143 ms
14,808 KB
testcase_34 AC 2 ms
5,376 KB
testcase_35 AC 2 ms
5,376 KB
testcase_36 AC 49 ms
7,680 KB
testcase_37 AC 53 ms
9,216 KB
testcase_38 AC 80 ms
13,568 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
#include <atcoder/all>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<int(n);++i)
#define rep2(i,a,n) for(int i=int(a);i<int(n);++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
#define M_PI 3.14159265358979323846
using namespace std;
using namespace atcoder;
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using vectp=vector<tp>;
using vectpll=vector<tpll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}
bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}

constexpr ll INF=numeric_limits<ll>::max() >> 2;
constexpr int inf=numeric_limits<int>::max() >> 1;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m, l, s, e;cin>>n>>m>>l>>s>>e;
	vector<vecpii> g(n);
	rep(i, m){
		int u, v;cin>>u>>v;
		u--, v--;
		int c;cin>>c;
		g[u].emplace_back(v, c);
		g[v].emplace_back(u, c);
	}
	vecll dist(n, INF);
	dist[0] = 0;
	priority_queue<pll, vecpll, greater<pll>> q;
	q.emplace(0, 0);
	while(q.size()){
		auto [c, v] = q.top(); q.pop();
		if(dist[v] < c) continue;
		for(auto [nv, nc] : g[v]) if(chmin(dist[nv], c + nc))
			q.emplace(dist[nv], nv);
	}
	vecll dist2(n, INF);
	veci a(l);
	rep(i, l) cin>>a[i], a[i]--;
	rep(i, l) if(dist[a[i]] < s + e)
		dist2[a[i]] = max(ll(s) + 1, dist[a[i]] + 1);
	swap(dist, dist2);
	rep(i, n) if(dist[i] != INF) q.emplace(dist[i], i);
	while(q.size()){
		auto [c, v] = q.top(); q.pop();
		if(dist[v] < c) continue;
		for(auto [nv, nc] : g[v]) if(chmin(dist[nv], c + nc))
			q.emplace(dist[nv], nv);
	}
	if(dist[n - 1] == INF) dist[n - 1] = -1;
	cout<<dist[n - 1]<<endl;
}
0