Submission #1354340
Source Code Expand
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
typedef pair<int, int> pii;
typedef long long ll;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;
int N, M, K, S, G;
vector<pii> edge[30010];
int dsta[30010], dstb[30010];
signed main() {
cin >> N >> M >> K >> S >> G;
rep(i,0,M) {
int a, b, d; cin >> a >> b >> d;
edge[a].push_back(pii(b, d));
edge[b].push_back(pii(a, d));
}
vector<int> taba(K+1), tabb(K+1);
taba[K] = INF, tabb[K] = -1;
rep(i,0,K) {
int x, f; cin >> x >> f;
taba[i] = x, tabb[i] = f;
}
fill(dsta, dsta+30010, INF);
fill(dstb, dstb+30010, INF);
dsta[S] = 0, dstb[G] = 0;
priority_queue< pii, vector<pii>, greater<pii> > q;
q.push(pii(0, S));
while(!q.empty()) {
pii temp = q.top(); q.pop();
int cur = temp.second;
for(auto to : edge[cur]) {
if(dsta[to.first] > dsta[cur] + to.second) {
dsta[to.first] = dsta[cur] + to.second;
q.push(pii(dsta[to.first], to.first));
}
}
}
q.push(pii(0, G));
while(!q.empty()) {
pii temp = q.top(); q.pop();
int cur = temp.second;
for(auto to : edge[cur]) {
if(dstb[to.first] > dstb[cur] + to.second) {
dstb[to.first] = dstb[cur] + to.second;
q.push(pii(dstb[to.first], to.first));
}
}
}
int rawdist = dsta[G];
int idx = upper_bound(taba.begin(), taba.end(), rawdist) - taba.begin() - 1;
int ans = tabb[idx];
rep(i,0,N) {
if(i == S || i == G) continue;
int da = dsta[i], db = dstb[i];
if(da == INF || db == INF) continue;
int i1 = upper_bound(taba.begin(), taba.end(), da) - taba.begin() - 1;
int i2 = upper_bound(taba.begin(), taba.end(), db) - taba.begin() - 1;
chmin(ans, tabb[i1] + tabb[i2]);
}
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
D - 切符分割 |
User |
tsutaj |
Language |
C++14 (GCC 5.4.1) |
Score |
140 |
Code Size |
2886 Byte |
Status |
AC |
Exec Time |
67 ms |
Memory |
4988 KB |
Judge Result
Set Name |
direct |
small |
large |
Score / Max Score |
20 / 20 |
20 / 20 |
100 / 100 |
Status |
|
|
|
Set Name |
Test Cases |
direct |
direct/basic_case00, direct/basic_case01, direct/basic_case02, direct/basic_case03, direct/basic_case04 |
small |
small/append00, small/append01, small/append02, small/append03, small/append20, small/append21, small/append30, small/basic_case00, small/basic_case01, small/basic_case02, small/basic_case03, small/basic_case04, small/basic_case05, small/basic_case06, small/basic_case07, small/basic_case08, small/basic_case09, small/sample02, small/sample03, small/split00 |
large |
large/append10, large/append11, large/append12, large/large_case00, large/large_case01, large/large_case02, large/large_case03 |
Case Name |
Status |
Exec Time |
Memory |
sample00 |
AC |
2 ms |
1408 KB |
sample01 |
AC |
2 ms |
1408 KB |
direct/basic_case00 |
AC |
2 ms |
1408 KB |
direct/basic_case01 |
AC |
2 ms |
1408 KB |
direct/basic_case02 |
AC |
2 ms |
1408 KB |
direct/basic_case03 |
AC |
2 ms |
1408 KB |
direct/basic_case04 |
AC |
2 ms |
1408 KB |
large/append10 |
AC |
59 ms |
4096 KB |
large/append11 |
AC |
59 ms |
4096 KB |
large/append12 |
AC |
59 ms |
4096 KB |
large/large_case00 |
AC |
66 ms |
4860 KB |
large/large_case01 |
AC |
59 ms |
4352 KB |
large/large_case02 |
AC |
63 ms |
4480 KB |
large/large_case03 |
AC |
67 ms |
4988 KB |
small/append00 |
AC |
2 ms |
1408 KB |
small/append01 |
AC |
2 ms |
1408 KB |
small/append02 |
AC |
2 ms |
1408 KB |
small/append03 |
AC |
2 ms |
1408 KB |
small/append20 |
AC |
2 ms |
1408 KB |
small/append21 |
AC |
2 ms |
1408 KB |
small/append30 |
AC |
2 ms |
1408 KB |
small/basic_case00 |
AC |
2 ms |
1408 KB |
small/basic_case01 |
AC |
2 ms |
1408 KB |
small/basic_case02 |
AC |
2 ms |
1408 KB |
small/basic_case03 |
AC |
2 ms |
1408 KB |
small/basic_case04 |
AC |
2 ms |
1408 KB |
small/basic_case05 |
AC |
2 ms |
1408 KB |
small/basic_case06 |
AC |
2 ms |
1408 KB |
small/basic_case07 |
AC |
2 ms |
1408 KB |
small/basic_case08 |
AC |
2 ms |
1408 KB |
small/basic_case09 |
AC |
2 ms |
1408 KB |
small/sample02 |
AC |
2 ms |
1408 KB |
small/sample03 |
AC |
2 ms |
1408 KB |
small/split00 |
AC |
2 ms |
1408 KB |