oj.uz

Submission #81041

# Submission time Handle Problem Language Result Execution time Memory
81041 2018-10-23T15:23:43 Z farukkastamonuda Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 807 ms 150560 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define lo long long 
#define inf 1000000000000000000
#define md 1000000007
#define li 100005
#define mp make_pair
#define pb push_back
#define pi pair<lo int, int>
using namespace std;
int n, m, s, t, u, v, x, y;
lo int vis[li], du[li], dv[li], ans = inf, z;
lo int tu[li], tv[li];
vector< pair<int, lo int> > vv[li];
struct node{
	lo int val;
	int  cit;
	lo int mnu, mnv;
};
bool operator < (node a, node b){
	if(a.val == b.val){
		if(a.mnu == b.mnu) return a.mnv > b.mnv;
		return a.mnu > b.mnu;
	}
	return a.val > b.val;
}
void sp(){
	for(int i = 1; i <= n; i ++){
		vis[i] = inf;
		tu[i] = inf;
		tv[i] = inf;
	}
	priority_queue<node> q;
	q.push((node){0, s, du[s], dv[s]});
	while(! q.empty()){
		node temp = q.top();
		q.pop();
		lo int cst = temp.val;
		int seh = temp.cit;
		lo int uya = temp.mnu;
		lo int vye = temp.mnv;
		if(vis[seh] < cst) continue;
		if(vis[seh] == cst && tu[seh] <= uya && tv[seh] <= vye) continue;
		vis[seh] = cst;
		tu[seh] = min(tu[seh], uya);
		tv[seh] = min(tv[seh], vye);
		if(seh == t){
			//printf("debug-> :: %d %d %d\n", uya, vye, seh);
			ans = min(ans , uya + vye);
		}
		for(int i = 0; i < (int)vv[seh].size() ; i ++){
			int go = vv[seh][i].fi;
			lo int knr = vv[seh][i].se;
			q.push((node){cst + knr, go, min(uya, du[go]), min(vye, dv[go])});
		}
	}
}
void bfsu(){
	priority_queue< pair<lo int, int> > q;
	q.push(mp(0, u));
	while(!q.empty()){
		pi temp = q.top();
		q.pop();
		int seh = temp.se;
		lo int val = - temp.fi;
		if(vis[seh] == 1 ) continue;
		vis[seh] = 1;
		du[seh] = val;
		for(int i = 0; i < (int)vv[seh].size(); i ++){
			int go = vv[seh][i].fi;
			lo int knr = vv[seh][i].se;
			q.push(mp(- val - knr, go));
		}
	}
	memset(vis, 0 , sizeof(vis));
}
void bfsv(){
	priority_queue< pair<lo int, int> > q;
	q.push(mp(0, v));
	while(!q.empty()){
		pi temp = q.top();
		q.pop();
		int seh = temp.se;
		lo int val = - temp.fi;
		if(vis[seh] == 1 ) continue;
		vis[seh] = 1;
		dv[seh] = val;
		for(int i = 0; i < (int)vv[seh].size(); i ++){
			int go = vv[seh][i].fi;
			lo int knr = vv[seh][i].se;
			q.push(mp(- val - knr, go));
		}
	}
	memset(vis, 0 , sizeof(vis));
}
int main(){
	scanf("%d %d %d %d %d %d", &n, &m, &s, &t, &u ,&v);
	for(int i = 1; i <= m ; i ++){
		scanf("%d %d %lld", &x, &y, &z);
		vv[x].pb(mp(y, z));
		vv[y].pb(mp(x, z));
	}
	bfsu();
	bfsv();
	sp();
	printf("%lld\n", min(ans, du[v]));
	return  0;
}

Compilation message

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

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 693 ms 33132 KB Output is correct
2 Correct 594 ms 36828 KB Output is correct
3 Correct 622 ms 36828 KB Output is correct
4 Correct 656 ms 44416 KB Output is correct
5 Correct 605 ms 44416 KB Output is correct
6 Correct 723 ms 51828 KB Output is correct
7 Correct 586 ms 55388 KB Output is correct
8 Correct 583 ms 58728 KB Output is correct
9 Correct 668 ms 63224 KB Output is correct
10 Correct 644 ms 67700 KB Output is correct
11 Correct 165 ms 67700 KB Output is correct
12 Correct 631 ms 74048 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 638 ms 77648 KB Output is correct
2 Correct 617 ms 77648 KB Output is correct
3 Correct 633 ms 79940 KB Output is correct
4 Correct 668 ms 81884 KB Output is correct
5 Correct 603 ms 85308 KB Output is correct
6 Correct 672 ms 89156 KB Output is correct
7 Correct 631 ms 93980 KB Output is correct
8 Correct 633 ms 96008 KB Output is correct
9 Correct 663 ms 100956 KB Output is correct
10 Correct 676 ms 103112 KB Output is correct
11 Correct 207 ms 103112 KB Output is correct
12 Correct 612 ms 108948 KB Output is correct

Subtask #3
24.0 / 24.0

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

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 693 ms 33132 KB Output is correct
2 Correct 594 ms 36828 KB Output is correct
3 Correct 622 ms 36828 KB Output is correct
4 Correct 656 ms 44416 KB Output is correct
5 Correct 605 ms 44416 KB Output is correct
6 Correct 723 ms 51828 KB Output is correct
7 Correct 586 ms 55388 KB Output is correct
8 Correct 583 ms 58728 KB Output is correct
9 Correct 668 ms 63224 KB Output is correct
10 Correct 644 ms 67700 KB Output is correct
11 Correct 165 ms 67700 KB Output is correct
12 Correct 631 ms 74048 KB Output is correct
13 Correct 638 ms 77648 KB Output is correct
14 Correct 617 ms 77648 KB Output is correct
15 Correct 633 ms 79940 KB Output is correct
16 Correct 668 ms 81884 KB Output is correct
17 Correct 603 ms 85308 KB Output is correct
18 Correct 672 ms 89156 KB Output is correct
19 Correct 631 ms 93980 KB Output is correct
20 Correct 633 ms 96008 KB Output is correct
21 Correct 663 ms 100956 KB Output is correct
22 Correct 676 ms 103112 KB Output is correct
23 Correct 207 ms 103112 KB Output is correct
24 Correct 612 ms 108948 KB Output is correct
25 Correct 43 ms 108948 KB Output is correct
26 Correct 6 ms 108948 KB Output is correct
27 Correct 8 ms 108948 KB Output is correct
28 Correct 90 ms 108948 KB Output is correct
29 Correct 60 ms 108948 KB Output is correct
30 Correct 7 ms 108948 KB Output is correct
31 Correct 11 ms 108948 KB Output is correct
32 Correct 10 ms 108948 KB Output is correct
33 Correct 9 ms 108948 KB Output is correct
34 Correct 43 ms 108948 KB Output is correct
35 Correct 5 ms 108948 KB Output is correct
36 Correct 5 ms 108948 KB Output is correct
37 Correct 6 ms 108948 KB Output is correct
38 Correct 6 ms 108948 KB Output is correct
39 Correct 7 ms 108948 KB Output is correct
40 Correct 722 ms 120372 KB Output is correct
41 Correct 762 ms 125688 KB Output is correct
42 Correct 665 ms 129772 KB Output is correct
43 Correct 176 ms 129772 KB Output is correct
44 Correct 189 ms 129772 KB Output is correct
45 Correct 622 ms 131204 KB Output is correct
46 Correct 655 ms 134568 KB Output is correct
47 Correct 807 ms 140548 KB Output is correct
48 Correct 189 ms 140548 KB Output is correct
49 Correct 657 ms 149092 KB Output is correct
50 Correct 728 ms 149092 KB Output is correct
51 Correct 603 ms 150560 KB Output is correct