oj.uz

답안 #547566

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547566 2022-04-11T00:52:11 Z tmn2005 Commuter Pass (JOI18_commuter_pass) C++17
24 / 100
 41 ms 4436 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define int long long
 
const int N = 1e5 + 12;
int n, m, s, f, l, r, x, y, z, res, dis[505][505];
 
signed main(){
	ios::sync_with_stdio(0), cin.tie(0);
	cin>>n>>m;
	cin>>s>>f;
	cin>>l>>r;
	memset(dis, 63, sizeof dis);
	for(int i=1; i<=n; i++)dis[i][i] = 0;
	while(m--){
		cin>>x>>y>>z;
		dis[x][y] = min(dis[x][y], z);
		dis[y][x] = min(dis[y][x], z);
	}
	for(int k=1; k<=n; k++){
		for(int i=1; i<=n; i++){
			for(int j=1; j<=n; j++){
				dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);
			}
		}
	}
	res = dis[l][r];
	for(int i=1; i<=n; i++){
		for(int j=1; j<=n; j++){
			if(dis[s][i] + dis[i][j] + dis[j][f] == dis[s][f]){
				res = min(res, dis[l][i] + dis[j][r]);
				res = min(res, dis[l][j] + dis[i][r]);
			}
		}	
	}
	cout<<res<<"\n";
}

Subtask #1
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 4436 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 4436 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 2296 KB Output is correct
2 Correct 29 ms 2260 KB Output is correct
3 Correct 32 ms 2320 KB Output is correct
4 Correct 37 ms 2260 KB Output is correct
5 Correct 32 ms 2316 KB Output is correct
6 Correct 34 ms 2316 KB Output is correct
7 Correct 41 ms 2260 KB Output is correct
8 Correct 31 ms 2260 KB Output is correct
9 Correct 28 ms 2260 KB Output is correct
10 Correct 32 ms 2260 KB Output is correct
11 Correct 27 ms 2260 KB Output is correct
12 Correct 28 ms 2320 KB Output is correct
13 Correct 28 ms 2260 KB Output is correct
14 Correct 27 ms 2312 KB Output is correct
15 Correct 27 ms 2260 KB Output is correct

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 3 ms 4436 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -