답안 #66806 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
66806	2018-08-12T10:33:07 Z	ekrem	Commuter Pass (JOI18_commuter_pass)	C++	100 / 100	625 ms	22740 KB

commuter_pass

#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define heap priority_queue
#define inf 1000000000000000007
#define N 100005
using namespace std;

typedef long long ll;
typedef pair < ll , ll > ii;

ll n, m, s, t, u, v, ans, us[N], en[N], dp[2][N];
ii cvp[N];
vector < ii > g[N];

void bul(ll o, ll sr){
	memset(us, 0, sizeof us);
	heap < ii > p;
	p.push(mp(0, sr));
	dp[o][sr] = 0;
	while(!p.empty()){
		ll yol = -p.top().st;
		ll node = p.top().nd;
		p.pop();

		us[node] = 1;

		for(ll i = 0; i < g[node].size(); i++){
			ll coc = g[node][i].st;
			ll uz = g[node][i].nd;
			if(dp[o][node] + uz < dp[o][coc]){
				dp[o][coc] = dp[o][node] + uz;
				if(!us[coc])
					p.push(mp(-(dp[o][coc]) , coc ));
			}
		}
	}
	// if(o == 1)
	// 	for(ll i = 1; i <= n; i++)
	// 		cout << i << " -> " << dp[!o][i] << " , " << dp[o][i] << endl;
}


void bitir(ll sr, ll hed){
	memset(us, 0, sizeof us);
	heap < ii > p;
	p.push(mp(0, sr));
	en[sr] = 0;
	cvp[sr].st = dp[0][sr];
	cvp[sr].nd = dp[1][sr];
	while(!p.empty()){
		ll node = p.top().nd;
		p.pop();

		us[node] = 1;

		for(ll i = 0; i < g[node].size(); i++){
			ll coc = g[node][i].st;
			ll uz = g[node][i].nd;
			ll mn0 = min(cvp[node].st, dp[0][coc]);
			ll mn1 = min(cvp[node].nd, dp[1][coc]);
			if(en[node] + uz < en[coc]){
				en[coc] = en[node] + uz;
				cvp[coc] = mp(mn0, mn1);
				if(!us[coc])
					p.push(mp(-en[coc] , coc ));
			}
			if(en[node] + uz == en[coc])
				if(mn0 + mn1 < cvp[coc].st + cvp[coc].nd)
					cvp[coc] = mp(mn0, mn1);
		}
	}
	ans = cvp[hed].st + cvp[hed].nd;
}

int main() {
	// freopen("in.txt", "r", stdin);
	// freopen("out.txt", "w", stdout);

	for(ll i = 0; i < N; i++)
		cvp[i].st = cvp[i].nd = ans = en[i] = dp[0][i] = dp[1][i] = inf;

	scanf("%lld %lld %lld %lld %lld %lld",&n ,&m ,&s ,&t ,&u ,&v);
	for(ll i = 1; i <= m; i++){
		ll a, b, c;
		scanf("%lld %lld %lld",&a ,&b ,&c);
		g[a].pb(mp(b, c));
		g[b].pb(mp(a, c));
	}
	bul(0, u);
	bul(1, v);
	bitir(s, t);
	ans = min(ans, dp[0][v]);
	ans = min(ans, dp[1][u]);
	printf("%lld\n",ans);
	return 0;
}

Compilation message

commuter_pass.cpp: In function 'void bul(ll, ll)':
commuter_pass.cpp:30:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ll i = 0; i < g[node].size(); i++){
                 ~~^~~~~~~~~~~~~~~~
commuter_pass.cpp:24:6: warning: unused variable 'yol' [-Wunused-variable]
   ll yol = -p.top().st;
      ^~~
commuter_pass.cpp: In function 'void bitir(ll, ll)':
commuter_pass.cpp:59:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ll i = 0; i < g[node].size(); i++){
                 ~~^~~~~~~~~~~~~~~~
commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:85:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld %lld %lld %lld %lld",&n ,&m ,&s ,&t ,&u ,&v);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
commuter_pass.cpp:88:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld %lld",&a ,&b ,&c);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	443 ms	21228 KB	Output is correct
2	Correct	477 ms	21228 KB	Output is correct
3	Correct	485 ms	21228 KB	Output is correct
4	Correct	533 ms	21744 KB	Output is correct
5	Correct	482 ms	21744 KB	Output is correct
6	Correct	469 ms	22740 KB	Output is correct
7	Correct	535 ms	22740 KB	Output is correct
8	Correct	525 ms	22740 KB	Output is correct
9	Correct	476 ms	22740 KB	Output is correct
10	Correct	453 ms	22740 KB	Output is correct
11	Correct	198 ms	22740 KB	Output is correct
12	Correct	510 ms	22740 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	538 ms	22740 KB	Output is correct
2	Correct	613 ms	22740 KB	Output is correct
3	Correct	591 ms	22740 KB	Output is correct
4	Correct	556 ms	22740 KB	Output is correct
5	Correct	582 ms	22740 KB	Output is correct
6	Correct	569 ms	22740 KB	Output is correct
7	Correct	575 ms	22740 KB	Output is correct
8	Correct	625 ms	22740 KB	Output is correct
9	Correct	596 ms	22740 KB	Output is correct
10	Correct	595 ms	22740 KB	Output is correct
11	Correct	211 ms	22740 KB	Output is correct
12	Correct	509 ms	22740 KB	Output is correct

Subtask #3
24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	23 ms	22740 KB	Output is correct
2	Correct	9 ms	22740 KB	Output is correct
3	Correct	9 ms	22740 KB	Output is correct
4	Correct	41 ms	22740 KB	Output is correct
5	Correct	21 ms	22740 KB	Output is correct
6	Correct	10 ms	22740 KB	Output is correct
7	Correct	10 ms	22740 KB	Output is correct
8	Correct	12 ms	22740 KB	Output is correct
9	Correct	10 ms	22740 KB	Output is correct
10	Correct	18 ms	22740 KB	Output is correct
11	Correct	9 ms	22740 KB	Output is correct
12	Correct	8 ms	22740 KB	Output is correct
13	Correct	10 ms	22740 KB	Output is correct
14	Correct	8 ms	22740 KB	Output is correct
15	Correct	10 ms	22740 KB	Output is correct

Subtask #4
45.0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	443 ms	21228 KB	Output is correct
2	Correct	477 ms	21228 KB	Output is correct
3	Correct	485 ms	21228 KB	Output is correct
4	Correct	533 ms	21744 KB	Output is correct
5	Correct	482 ms	21744 KB	Output is correct
6	Correct	469 ms	22740 KB	Output is correct
7	Correct	535 ms	22740 KB	Output is correct
8	Correct	525 ms	22740 KB	Output is correct
9	Correct	476 ms	22740 KB	Output is correct
10	Correct	453 ms	22740 KB	Output is correct
11	Correct	198 ms	22740 KB	Output is correct
12	Correct	510 ms	22740 KB	Output is correct
13	Correct	538 ms	22740 KB	Output is correct
14	Correct	613 ms	22740 KB	Output is correct
15	Correct	591 ms	22740 KB	Output is correct
16	Correct	556 ms	22740 KB	Output is correct
17	Correct	582 ms	22740 KB	Output is correct
18	Correct	569 ms	22740 KB	Output is correct
19	Correct	575 ms	22740 KB	Output is correct
20	Correct	625 ms	22740 KB	Output is correct
21	Correct	596 ms	22740 KB	Output is correct
22	Correct	595 ms	22740 KB	Output is correct
23	Correct	211 ms	22740 KB	Output is correct
24	Correct	509 ms	22740 KB	Output is correct
25	Correct	23 ms	22740 KB	Output is correct
26	Correct	9 ms	22740 KB	Output is correct
27	Correct	9 ms	22740 KB	Output is correct
28	Correct	41 ms	22740 KB	Output is correct
29	Correct	21 ms	22740 KB	Output is correct
30	Correct	10 ms	22740 KB	Output is correct
31	Correct	10 ms	22740 KB	Output is correct
32	Correct	12 ms	22740 KB	Output is correct
33	Correct	10 ms	22740 KB	Output is correct
34	Correct	18 ms	22740 KB	Output is correct
35	Correct	9 ms	22740 KB	Output is correct
36	Correct	8 ms	22740 KB	Output is correct
37	Correct	10 ms	22740 KB	Output is correct
38	Correct	8 ms	22740 KB	Output is correct
39	Correct	10 ms	22740 KB	Output is correct
40	Correct	494 ms	22740 KB	Output is correct
41	Correct	496 ms	22740 KB	Output is correct
42	Correct	453 ms	22740 KB	Output is correct
43	Correct	184 ms	22740 KB	Output is correct
44	Correct	183 ms	22740 KB	Output is correct
45	Correct	464 ms	22740 KB	Output is correct
46	Correct	489 ms	22740 KB	Output is correct
47	Correct	435 ms	22740 KB	Output is correct
48	Correct	213 ms	22740 KB	Output is correct
49	Correct	367 ms	22740 KB	Output is correct
50	Correct	437 ms	22740 KB	Output is correct
51	Correct	430 ms	22740 KB	Output is correct

답안 #66806

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