답안 #58969 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58969	2018-07-19T22:44:19 Z	zadrga	Commuter Pass (JOI18_commuter_pass)	C++14	100 / 100	638 ms	89084 KB

commuter_pass

/*
Idea:
- http://codeforces.com/blog/entry/57637?#comment-413356 (Problem 4)
*/

#include <bits/stdc++.h>
 
using namespace std;
 
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1LL << 55)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 100111

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pii;

ll len[maxn], d1[maxn], d2[maxn], min1[maxn], min2[maxn];
bool mark[maxn];
vector<pii> adj[maxn], here;

void find_path(int zac, ll d[]){	
	priority_queue<pii> pq;
	for(int i = 0; i < maxn; i++)
		d[i] = INF;

	d[zac] = 0;
	pq.push(mp(0, zac));

	while(!pq.empty()){
		int x = pq.top().se;
		ll val = -pq.top().fi;
		pq.pop();

		if(val > d[x])
			continue;

		for(pii v : adj[x]){
			if(d[v.fi] > d[x] + v.se){
				d[v.fi] = d[x] + v.se;
				pq.push(mp(-d[v.fi], v.fi));
			}
		}
	}
}

void on_shortest_path(int s, int t, ll d[]){
	queue<int> q;
	q.push(t);
	mark[t] = 1;

	while(!q.empty()){
		int x = q.front();
		q.pop();
		here.pb(mp(d[x], x));

		for(pii v : adj[x]){
			if(!mark[v.fi] && d[x] == d[v.fi] + v.se){
				mark[v.fi] = 1;
				q.push(v.fi);
			}
		}
	}
}

int main(){
	int n, m, s, t, u, v;
	scanf("%d%d%d%d%d%d", &n, &m, &s, &t, &u, &v);
	for(int i = 0; i < m; i++){
		int a, b; ll c;
		scanf("%d%d%lld", &a, &b, &c);
		adj[a].pb(mp(b, c));
		adj[b].pb(mp(a, c));
	}

	find_path(s, len);
	find_path(u, d1);
	find_path(v, d2);

	on_shortest_path(s, t, len);

	sort(here.begin(), here.end());
	memset(mark, 0, sizeof(mark));

	ll ans = d1[v];
	for(int i = 0; i < here.size(); i++){
		int x = here[i].se;
		mark[x] = 1;
		min1[x] = d1[x];
		min2[x] = d2[x];

		for(pii cur : adj[x]){
			if(mark[cur.fi]){
				min1[x] = min(min1[x], min1[cur.fi]);
				min2[x] = min(min2[x], min2[cur.fi]);
			}
		}

		ans = min(ans, d1[x] + min2[x]);
		ans = min(ans, d2[x] + min1[x]);
	}

	printf("%lld\n", ans);
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:90:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < here.size(); i++){
                 ~~^~~~~~~~~~~~~
commuter_pass.cpp:72:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d%d%d", &n, &m, &s, &t, &u, &v);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:75:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%lld", &a, &b, &c);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	514 ms	22584 KB	Output is correct
2	Correct	527 ms	25768 KB	Output is correct
3	Correct	415 ms	29812 KB	Output is correct
4	Correct	358 ms	33536 KB	Output is correct
5	Correct	391 ms	37596 KB	Output is correct
6	Correct	390 ms	41012 KB	Output is correct
7	Correct	446 ms	45076 KB	Output is correct
8	Correct	495 ms	48292 KB	Output is correct
9	Correct	433 ms	50976 KB	Output is correct
10	Correct	441 ms	55324 KB	Output is correct
11	Correct	153 ms	55324 KB	Output is correct
12	Correct	501 ms	61680 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	638 ms	66180 KB	Output is correct
2	Correct	570 ms	67388 KB	Output is correct
3	Correct	478 ms	67388 KB	Output is correct
4	Correct	428 ms	67400 KB	Output is correct
5	Correct	429 ms	68108 KB	Output is correct
6	Correct	475 ms	68168 KB	Output is correct
7	Correct	523 ms	68168 KB	Output is correct
8	Correct	570 ms	68168 KB	Output is correct
9	Correct	529 ms	68168 KB	Output is correct
10	Correct	449 ms	68168 KB	Output is correct
11	Correct	181 ms	68168 KB	Output is correct
12	Correct	480 ms	72208 KB	Output is correct

Subtask #3
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	19 ms	72208 KB	Output is correct
2	Correct	8 ms	72208 KB	Output is correct
3	Correct	7 ms	72208 KB	Output is correct
4	Correct	30 ms	72208 KB	Output is correct
5	Correct	16 ms	72208 KB	Output is correct
6	Correct	6 ms	72208 KB	Output is correct
7	Correct	8 ms	72208 KB	Output is correct
8	Correct	8 ms	72208 KB	Output is correct
9	Correct	7 ms	72208 KB	Output is correct
10	Correct	17 ms	72208 KB	Output is correct
11	Correct	6 ms	72208 KB	Output is correct
12	Correct	5 ms	72208 KB	Output is correct
13	Correct	7 ms	72208 KB	Output is correct
14	Correct	7 ms	72208 KB	Output is correct
15	Correct	8 ms	72208 KB	Output is correct

Subtask #4
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	514 ms	22584 KB	Output is correct
2	Correct	527 ms	25768 KB	Output is correct
3	Correct	415 ms	29812 KB	Output is correct
4	Correct	358 ms	33536 KB	Output is correct
5	Correct	391 ms	37596 KB	Output is correct
6	Correct	390 ms	41012 KB	Output is correct
7	Correct	446 ms	45076 KB	Output is correct
8	Correct	495 ms	48292 KB	Output is correct
9	Correct	433 ms	50976 KB	Output is correct
10	Correct	441 ms	55324 KB	Output is correct
11	Correct	153 ms	55324 KB	Output is correct
12	Correct	501 ms	61680 KB	Output is correct
13	Correct	638 ms	66180 KB	Output is correct
14	Correct	570 ms	67388 KB	Output is correct
15	Correct	478 ms	67388 KB	Output is correct
16	Correct	428 ms	67400 KB	Output is correct
17	Correct	429 ms	68108 KB	Output is correct
18	Correct	475 ms	68168 KB	Output is correct
19	Correct	523 ms	68168 KB	Output is correct
20	Correct	570 ms	68168 KB	Output is correct
21	Correct	529 ms	68168 KB	Output is correct
22	Correct	449 ms	68168 KB	Output is correct
23	Correct	181 ms	68168 KB	Output is correct
24	Correct	480 ms	72208 KB	Output is correct
25	Correct	19 ms	72208 KB	Output is correct
26	Correct	8 ms	72208 KB	Output is correct
27	Correct	7 ms	72208 KB	Output is correct
28	Correct	30 ms	72208 KB	Output is correct
29	Correct	16 ms	72208 KB	Output is correct
30	Correct	6 ms	72208 KB	Output is correct
31	Correct	8 ms	72208 KB	Output is correct
32	Correct	8 ms	72208 KB	Output is correct
33	Correct	7 ms	72208 KB	Output is correct
34	Correct	17 ms	72208 KB	Output is correct
35	Correct	6 ms	72208 KB	Output is correct
36	Correct	5 ms	72208 KB	Output is correct
37	Correct	7 ms	72208 KB	Output is correct
38	Correct	7 ms	72208 KB	Output is correct
39	Correct	8 ms	72208 KB	Output is correct
40	Correct	485 ms	75064 KB	Output is correct
41	Correct	505 ms	78436 KB	Output is correct
42	Correct	470 ms	82416 KB	Output is correct
43	Correct	279 ms	82416 KB	Output is correct
44	Correct	248 ms	82416 KB	Output is correct
45	Correct	482 ms	88368 KB	Output is correct
46	Correct	407 ms	88368 KB	Output is correct
47	Correct	378 ms	88708 KB	Output is correct
48	Correct	214 ms	88708 KB	Output is correct
49	Correct	383 ms	88708 KB	Output is correct
50	Correct	514 ms	89000 KB	Output is correct
51	Correct	473 ms	89084 KB	Output is correct

답안 #58969

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 15.0 / 15.0

Subtask #3 24.0 / 24.0

Subtask #4 45.0 / 45.0

Subtask #1
16.0 / 16.0

Subtask #2
15.0 / 15.0

Subtask #3
24.0 / 24.0

Subtask #4
45.0 / 45.0