oj.uz

Submission #41087

# Submission time Handle Problem Language Result Execution time Memory
41087 2018-02-12T15:09:04 Z kriii Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 439 ms 15640 KB 
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

vector<pair<int, int> > G[100100];
int N,M,S,T,U,V;

vector<long long> dist(int s)
{
	vector<long long> ret(N,1e18);
	priority_queue<pair<long long, int> > Q;
	Q.push({0,s}); ret[s] = 0;
	while (!Q.empty()){
		long long c = -Q.top().first; int x = Q.top().second; Q.pop();
		if (ret[x] < c) continue;
		for (auto &e : G[x]){
			int y = e.first; long long nc = c + e.second;
			if (ret[y] > nc){
				Q.push({-nc,y}); ret[y] = nc;
			}
		}
	}
	return move(ret);
}

int main()
{
	scanf ("%d %d %d %d %d %d",&N,&M,&S,&T,&U,&V);
	S--; T--; U--; V--;
	for (int i=0;i<M;i++){
		int x,y,c; scanf ("%d %d %d",&x,&y,&c); x--; y--;
		G[x].push_back({y,c});
		G[y].push_back({x,c});
	}

	auto s = dist(S);
	auto t = dist(T);
	auto u = dist(U);
	auto v = dist(V);

	vector<pair<long long, int> > st;
	for (int i=0;i<N;i++) if (s[T] == s[i] + t[i]){
		st.push_back({t[i],i});
	}
	sort(st.begin(),st.end());

	vector<long long> um(N,1e18), vm(N,1e18);
	long long ans = u[V];
	for (auto &p : st){
		int x = p.second;
		um[x] = u[x];
		vm[x] = v[x];
		for (auto &e : G[x]){
			if (t[e.first] + e.second == t[x]){
				um[x] = min(um[x], um[e.first]);
				vm[x] = min(vm[x], vm[e.first]);
			}
		}
		ans = min(ans,um[x]+v[x]);
		ans = min(ans,vm[x]+u[x]);
	}

	printf ("%lld\n",ans);

	return 0;
}

Compilation message

commuter_pass.cpp: In function 'int main()':
commuter_pass.cpp:30:47: 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:33:41: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int x,y,c; scanf ("%d %d %d",&x,&y,&c); x--; y--;
                                         ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 431 ms 15300 KB Output is correct
2 Correct 407 ms 15300 KB Output is correct
3 Correct 427 ms 15308 KB Output is correct
4 Correct 391 ms 15308 KB Output is correct
5 Correct 405 ms 15308 KB Output is correct
6 Correct 414 ms 15640 KB Output is correct
7 Correct 420 ms 15640 KB Output is correct
8 Correct 415 ms 15640 KB Output is correct
9 Correct 388 ms 15640 KB Output is correct
10 Correct 329 ms 15640 KB Output is correct
11 Correct 199 ms 15640 KB Output is correct
12 Correct 404 ms 15640 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 395 ms 15640 KB Output is correct
2 Correct 419 ms 15640 KB Output is correct
3 Correct 421 ms 15640 KB Output is correct
4 Correct 401 ms 15640 KB Output is correct
5 Correct 403 ms 15640 KB Output is correct
6 Correct 398 ms 15640 KB Output is correct
7 Correct 439 ms 15640 KB Output is correct
8 Correct 432 ms 15640 KB Output is correct
9 Correct 429 ms 15640 KB Output is correct
10 Correct 412 ms 15640 KB Output is correct
11 Correct 121 ms 15640 KB Output is correct
12 Correct 381 ms 15640 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 15640 KB Output is correct
2 Correct 3 ms 15640 KB Output is correct
3 Correct 3 ms 15640 KB Output is correct
4 Correct 21 ms 15640 KB Output is correct
5 Correct 14 ms 15640 KB Output is correct
6 Correct 4 ms 15640 KB Output is correct
7 Correct 4 ms 15640 KB Output is correct
8 Correct 5 ms 15640 KB Output is correct
9 Correct 4 ms 15640 KB Output is correct
10 Correct 12 ms 15640 KB Output is correct
11 Correct 3 ms 15640 KB Output is correct
12 Correct 3 ms 15640 KB Output is correct
13 Correct 3 ms 15640 KB Output is correct
14 Correct 5 ms 15640 KB Output is correct
15 Correct 4 ms 15640 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 431 ms 15300 KB Output is correct
2 Correct 407 ms 15300 KB Output is correct
3 Correct 427 ms 15308 KB Output is correct
4 Correct 391 ms 15308 KB Output is correct
5 Correct 405 ms 15308 KB Output is correct
6 Correct 414 ms 15640 KB Output is correct
7 Correct 420 ms 15640 KB Output is correct
8 Correct 415 ms 15640 KB Output is correct
9 Correct 388 ms 15640 KB Output is correct
10 Correct 329 ms 15640 KB Output is correct
11 Correct 199 ms 15640 KB Output is correct
12 Correct 404 ms 15640 KB Output is correct
13 Correct 395 ms 15640 KB Output is correct
14 Correct 419 ms 15640 KB Output is correct
15 Correct 421 ms 15640 KB Output is correct
16 Correct 401 ms 15640 KB Output is correct
17 Correct 403 ms 15640 KB Output is correct
18 Correct 398 ms 15640 KB Output is correct
19 Correct 439 ms 15640 KB Output is correct
20 Correct 432 ms 15640 KB Output is correct
21 Correct 429 ms 15640 KB Output is correct
22 Correct 412 ms 15640 KB Output is correct
23 Correct 121 ms 15640 KB Output is correct
24 Correct 381 ms 15640 KB Output is correct
25 Correct 13 ms 15640 KB Output is correct
26 Correct 3 ms 15640 KB Output is correct
27 Correct 3 ms 15640 KB Output is correct
28 Correct 21 ms 15640 KB Output is correct
29 Correct 14 ms 15640 KB Output is correct
30 Correct 4 ms 15640 KB Output is correct
31 Correct 4 ms 15640 KB Output is correct
32 Correct 5 ms 15640 KB Output is correct
33 Correct 4 ms 15640 KB Output is correct
34 Correct 12 ms 15640 KB Output is correct
35 Correct 3 ms 15640 KB Output is correct
36 Correct 3 ms 15640 KB Output is correct
37 Correct 3 ms 15640 KB Output is correct
38 Correct 5 ms 15640 KB Output is correct
39 Correct 4 ms 15640 KB Output is correct
40 Correct 367 ms 15640 KB Output is correct
41 Correct 374 ms 15640 KB Output is correct
42 Correct 387 ms 15640 KB Output is correct
43 Correct 142 ms 15640 KB Output is correct
44 Correct 129 ms 15640 KB Output is correct
45 Correct 348 ms 15640 KB Output is correct
46 Correct 369 ms 15640 KB Output is correct
47 Correct 371 ms 15640 KB Output is correct
48 Correct 162 ms 15640 KB Output is correct
49 Correct 310 ms 15640 KB Output is correct
50 Correct 364 ms 15640 KB Output is correct
51 Correct 342 ms 15640 KB Output is correct