oj.uz

답안 #343938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
343938 2021-01-04T19:21:09 Z minoum Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 419 ms 23904 KB 
#include<bits/stdc++.h>

using namespace std;
typedef long long int ll;

const ll inf = LLONG_MAX / 2;
const int MAXN = 1e5 + 10;
int n, m, s, t, x, y;
ll d[4][MAXN], dx[MAXN], dy[MAXN]; // d0:s d1:t d2:x d3:y
vector <pair<int, ll>> adj[MAXN];
priority_queue <pair<ll, int>> q;

inline void dij(int r, int ii){
	for(int i = 0; i < n; i++) d[ii][i] = inf;
	d[ii][r] = 0ll; q.push({0ll, r});
	while(!q.empty()){
		int v = q.top().second; 
		if(-q.top().first > d[ii][v]){
			q.pop();
			continue;
		}
		q.pop();
		for(auto i: adj[v]){
			int u = i.first; ll w = i.second;
			if(w + d[ii][v] < d[ii][u]){
				d[ii][u] = w + d[ii][v];
				q.push({-d[ii][u], u});
			}
		}
	}
	return;
}

inline void dijj(int r){
//	priority_queue <pair<ll, int>> q;
	for(int i = 0; i < n; i++) d[1][i] = inf;
	d[1][r] = 0ll; q.push({0ll, r});
	while(!q.empty()){
		int v = q.top().second; 
		if(-q.top().first > d[1][v]){
			q.pop();
			continue;
		}
		q.pop();
		for(auto i: adj[v]){
			int u = i.first; ll w = i.second;
			if(w + d[1][v] < d[1][u]){
				d[1][u] = w + d[1][v];
				q.push({-d[1][u], u});
			}
			if(w + d[1][v] == d[1][u] && d[1][u]+d[0][u] == d[0][t]){
				dx[u] = min(dx[u], dx[v]);
				dy[u] = min(dy[u], dy[v]);
			}
		}
	}
	return;
}

int main()
{
//	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
//	cin >> n >> m >> s >> t >> x >> y; 
	scanf("%d", &n); scanf("%d", &m); scanf("%d", &s); scanf("%d", &t); scanf("%d", &x); scanf("%d", &y);
	s--; t--; x--; y--;
	for(int i = 0; i < m; i++){
		int u,v; ll w;
		//cin >> u >> v >> w; 
		scanf("%d", &u); scanf("%d", &v); scanf("%lld", &w);
		v--; u--;
		adj[v].push_back({u,w});
		adj[u].push_back({v,w});
	}
	dij(x, 2); dij(y, 3);
	for(int i = 0; i < n; i++) dx[i] = d[2][i], dy[i] = d[3][i];
	dij(s, 0); dijj(t); 
	ll ans = d[2][y];
	for(int i = 0; i < n; i++)
		if(d[0][t] == d[0][i] + d[1][i]){
			ans = min(ans, dx[i] + d[3][i]);
			ans = min(ans, dy[i] + d[2][i]);
		}
//	cout << ans;
	printf("%lld", ans)	;
	return 0; 
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:64:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |  scanf("%d", &n); scanf("%d", &m); scanf("%d", &s); scanf("%d", &t); scanf("%d", &x); scanf("%d", &y);
      |  ~~~~~^~~~~~~~~~
commuter_pass.cpp:64:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |  scanf("%d", &n); scanf("%d", &m); scanf("%d", &s); scanf("%d", &t); scanf("%d", &x); scanf("%d", &y);
      |                   ~~~~~^~~~~~~~~~
commuter_pass.cpp:64:41: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |  scanf("%d", &n); scanf("%d", &m); scanf("%d", &s); scanf("%d", &t); scanf("%d", &x); scanf("%d", &y);
      |                                    ~~~~~^~~~~~~~~~
commuter_pass.cpp:64:58: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |  scanf("%d", &n); scanf("%d", &m); scanf("%d", &s); scanf("%d", &t); scanf("%d", &x); scanf("%d", &y);
      |                                                     ~~~~~^~~~~~~~~~
commuter_pass.cpp:64:75: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |  scanf("%d", &n); scanf("%d", &m); scanf("%d", &s); scanf("%d", &t); scanf("%d", &x); scanf("%d", &y);
      |                                                                      ~~~~~^~~~~~~~~~
commuter_pass.cpp:64:92: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |  scanf("%d", &n); scanf("%d", &m); scanf("%d", &s); scanf("%d", &t); scanf("%d", &x); scanf("%d", &y);
      |                                                                                       ~~~~~^~~~~~~~~~
commuter_pass.cpp:69:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   69 |   scanf("%d", &u); scanf("%d", &v); scanf("%lld", &w);
      |   ~~~~~^~~~~~~~~~
commuter_pass.cpp:69:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   69 |   scanf("%d", &u); scanf("%d", &v); scanf("%lld", &w);
      |                    ~~~~~^~~~~~~~~~
commuter_pass.cpp:69:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   69 |   scanf("%d", &u); scanf("%d", &v); scanf("%lld", &w);
      |                                     ~~~~~^~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 371 ms 23004 KB Output is correct
2 Correct 364 ms 22536 KB Output is correct
3 Correct 387 ms 23904 KB Output is correct
4 Correct 365 ms 22896 KB Output is correct
5 Correct 372 ms 22288 KB Output is correct
6 Correct 375 ms 22876 KB Output is correct
7 Correct 374 ms 22240 KB Output is correct
8 Correct 366 ms 22240 KB Output is correct
9 Correct 356 ms 23016 KB Output is correct
10 Correct 349 ms 23136 KB Output is correct
11 Correct 145 ms 14572 KB Output is correct
12 Correct 365 ms 22880 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 379 ms 22628 KB Output is correct
2 Correct 419 ms 22360 KB Output is correct
3 Correct 374 ms 22504 KB Output is correct
4 Correct 386 ms 22280 KB Output is correct
5 Correct 380 ms 22376 KB Output is correct
6 Correct 372 ms 22752 KB Output is correct
7 Correct 396 ms 22480 KB Output is correct
8 Correct 374 ms 22376 KB Output is correct
9 Correct 370 ms 22376 KB Output is correct
10 Correct 385 ms 22372 KB Output is correct
11 Correct 139 ms 14700 KB Output is correct
12 Correct 349 ms 22624 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 4460 KB Output is correct
2 Correct 2 ms 2796 KB Output is correct
3 Correct 2 ms 2796 KB Output is correct
4 Correct 22 ms 6124 KB Output is correct
5 Correct 13 ms 4460 KB Output is correct
6 Correct 3 ms 2796 KB Output is correct
7 Correct 3 ms 2924 KB Output is correct
8 Correct 4 ms 2924 KB Output is correct
9 Correct 3 ms 2796 KB Output is correct
10 Correct 12 ms 4460 KB Output is correct
11 Correct 2 ms 2816 KB Output is correct
12 Correct 2 ms 2796 KB Output is correct
13 Correct 2 ms 2796 KB Output is correct
14 Correct 3 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 371 ms 23004 KB Output is correct
2 Correct 364 ms 22536 KB Output is correct
3 Correct 387 ms 23904 KB Output is correct
4 Correct 365 ms 22896 KB Output is correct
5 Correct 372 ms 22288 KB Output is correct
6 Correct 375 ms 22876 KB Output is correct
7 Correct 374 ms 22240 KB Output is correct
8 Correct 366 ms 22240 KB Output is correct
9 Correct 356 ms 23016 KB Output is correct
10 Correct 349 ms 23136 KB Output is correct
11 Correct 145 ms 14572 KB Output is correct
12 Correct 365 ms 22880 KB Output is correct
13 Correct 379 ms 22628 KB Output is correct
14 Correct 419 ms 22360 KB Output is correct
15 Correct 374 ms 22504 KB Output is correct
16 Correct 386 ms 22280 KB Output is correct
17 Correct 380 ms 22376 KB Output is correct
18 Correct 372 ms 22752 KB Output is correct
19 Correct 396 ms 22480 KB Output is correct
20 Correct 374 ms 22376 KB Output is correct
21 Correct 370 ms 22376 KB Output is correct
22 Correct 385 ms 22372 KB Output is correct
23 Correct 139 ms 14700 KB Output is correct
24 Correct 349 ms 22624 KB Output is correct
25 Correct 13 ms 4460 KB Output is correct
26 Correct 2 ms 2796 KB Output is correct
27 Correct 2 ms 2796 KB Output is correct
28 Correct 22 ms 6124 KB Output is correct
29 Correct 13 ms 4460 KB Output is correct
30 Correct 3 ms 2796 KB Output is correct
31 Correct 3 ms 2924 KB Output is correct
32 Correct 4 ms 2924 KB Output is correct
33 Correct 3 ms 2796 KB Output is correct
34 Correct 12 ms 4460 KB Output is correct
35 Correct 2 ms 2816 KB Output is correct
36 Correct 2 ms 2796 KB Output is correct
37 Correct 2 ms 2796 KB Output is correct
38 Correct 3 ms 2796 KB Output is correct
39 Correct 3 ms 2796 KB Output is correct
40 Correct 337 ms 22768 KB Output is correct
41 Correct 371 ms 23120 KB Output is correct
42 Correct 354 ms 23008 KB Output is correct
43 Correct 159 ms 15012 KB Output is correct
44 Correct 152 ms 14668 KB Output is correct
45 Correct 337 ms 21856 KB Output is correct
46 Correct 333 ms 21600 KB Output is correct
47 Correct 351 ms 22748 KB Output is correct
48 Correct 164 ms 14188 KB Output is correct
49 Correct 309 ms 22360 KB Output is correct
50 Correct 338 ms 22044 KB Output is correct
51 Correct 319 ms 21856 KB Output is correct