oj.uz

Submission #66820

# Submission time Handle Problem Language Result Execution time Memory
66820 2018-08-12T11:10:17 Z MrTEK Commuter Pass (JOI18_commuter_pass) C++14
100 / 100
 972 ms 33272 KB 
#include <bits/stdc++.h>

using namespace std;
#define mp make_pair
#define pb push_back
#define len(a) (int)a.size()
#define fi first
#define sc second
#define d1(w) cerr<<#w<<":"<<w<<endl;
#define d2(w,c) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<endl;
#define d3(w,c,z) cerr<<#w<<":"<<w<<" "<<#c<<":"<<c<<" "<<#z<<":"<<z<<endl;
#define left ind+ind
#define right ind+ind+1
#define mid (l+r)/2
#define FAST_IO ios_base::sync_with_stdio(false);
#define endl '\n'

const int maxn = 620;
const long long LINF = 1e18;
const int LOG = 31;
const int INF = 1e9;
const int N = 1e5 + 5;
const int M = 1e4 + 5;
const int SQ = 350;
const int MOD = 998244353;

typedef pair <int,int> pii;

struct comp_node {
	int cur;
	long long cost,mnu,mnv;
};

bool operator < (comp_node x,comp_node y) {
	if (x.cost == y.cost) {
		if (x.mnu == y.mnu)
			return x.mnv > y.mnv;
		return x.mnu > y.mnu;
	}	
	return x.cost > y.cost;
}
struct node {
	int cur;
	long long cost;
};

bool operator < (node x,node y) {
	return x.cost > y.cost;
}

priority_queue <node> Q;
priority_queue <comp_node> CQ;

vector <pair <int,int> > ed[N];

int n,m,s,t,u,v;
long long sp,cu[N],cv[N],tu[N],tv[N],ans = LINF,vis[N];

void sp_s(){
	for (int i = 1 ; i <= n ; i++) vis[i] = LINF;
	for (int i = 1 ; i <= n ; i++) tu[i] = tv[i] = LINF;
	CQ.push({s,0,cu[s],cv[s]});
	while(len(CQ)) {
		auto temp = CQ.top();
		CQ.pop();
		int cur = temp.cur;
		long long cost = temp.cost,mnu = temp.mnu,mnv = temp.mnv;
		if (vis[cur] < cost) continue;
		if (vis[cur] == cost && tu[cur] <= mnu && tv[cur] <= mnv) continue;
		tu[cur] = min(tu[cur],mnu);
		tv[cur] = min(tv[cur],mnv);
		vis[cur] = cost;
		if (cur == t) ans = min(ans,mnu + mnv);
		for (auto i : ed[cur]) CQ.push({i.fi,cost + i.sc,min(mnu,cu[i.fi]),min(mnv,cv[i.fi])});
	}
	while(len(CQ)) CQ.pop();
	memset(vis,0,sizeof vis);	
}

void sp_u(){
	Q.push({u,0});
	while(len(Q)) {
		auto temp = Q.top();
		Q.pop();
		int cur = temp.cur;
		long long cost = temp.cost;
		if (vis[cur]) continue;
		vis[cur] = 1;
		cu[cur] = cost;
		for (auto i : ed[cur]) Q.push({i.fi,cost + i.sc});
	}
	memset(vis,0,sizeof vis);
	while(len(Q)) Q.pop();
}

void sp_v(){
	Q.push({v,0});
	while(len(Q)) {
		auto temp = Q.top();
		Q.pop();
		int cur = temp.cur;
		long long cost = temp.cost;
		if (vis[cur]) continue;
		vis[cur] = 1;
		cv[cur] = cost;
		for (auto i : ed[cur]) Q.push({i.fi,cost + i.sc});
	}
	memset(vis,0,sizeof vis);
	while(len(Q)) Q.pop();
}

int main() {

	scanf("%d %d %d %d %d %d",&n,&m,&s,&t,&u,&v);
	for (int i = 1 ; i <= m ; i++) {
		int u,v,c;
		scanf("%d %d %d",&u,&v,&c);
		ed[u].pb(mp(v,c));
		ed[v].pb(mp(u,c));
	}
	sp_u();
	sp_v();
	sp_s();
	printf("%lld\n",min(ans,cu[v]));
}

Compilation message

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

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 878 ms 23892 KB Output is correct
2 Correct 665 ms 23892 KB Output is correct
3 Correct 660 ms 23892 KB Output is correct
4 Correct 884 ms 23892 KB Output is correct
5 Correct 757 ms 23892 KB Output is correct
6 Correct 972 ms 30908 KB Output is correct
7 Correct 778 ms 33084 KB Output is correct
8 Correct 623 ms 33084 KB Output is correct
9 Correct 877 ms 33264 KB Output is correct
10 Correct 656 ms 33264 KB Output is correct
11 Correct 236 ms 33264 KB Output is correct
12 Correct 645 ms 33264 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 720 ms 33264 KB Output is correct
2 Correct 702 ms 33264 KB Output is correct
3 Correct 681 ms 33264 KB Output is correct
4 Correct 629 ms 33264 KB Output is correct
5 Correct 719 ms 33264 KB Output is correct
6 Correct 745 ms 33264 KB Output is correct
7 Correct 707 ms 33264 KB Output is correct
8 Correct 658 ms 33264 KB Output is correct
9 Correct 654 ms 33264 KB Output is correct
10 Correct 775 ms 33264 KB Output is correct
11 Correct 219 ms 33264 KB Output is correct
12 Correct 704 ms 33264 KB Output is correct

Subtask #3
24.0 / 24.0

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

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 878 ms 23892 KB Output is correct
2 Correct 665 ms 23892 KB Output is correct
3 Correct 660 ms 23892 KB Output is correct
4 Correct 884 ms 23892 KB Output is correct
5 Correct 757 ms 23892 KB Output is correct
6 Correct 972 ms 30908 KB Output is correct
7 Correct 778 ms 33084 KB Output is correct
8 Correct 623 ms 33084 KB Output is correct
9 Correct 877 ms 33264 KB Output is correct
10 Correct 656 ms 33264 KB Output is correct
11 Correct 236 ms 33264 KB Output is correct
12 Correct 645 ms 33264 KB Output is correct
13 Correct 720 ms 33264 KB Output is correct
14 Correct 702 ms 33264 KB Output is correct
15 Correct 681 ms 33264 KB Output is correct
16 Correct 629 ms 33264 KB Output is correct
17 Correct 719 ms 33264 KB Output is correct
18 Correct 745 ms 33264 KB Output is correct
19 Correct 707 ms 33264 KB Output is correct
20 Correct 658 ms 33264 KB Output is correct
21 Correct 654 ms 33264 KB Output is correct
22 Correct 775 ms 33264 KB Output is correct
23 Correct 219 ms 33264 KB Output is correct
24 Correct 704 ms 33264 KB Output is correct
25 Correct 38 ms 33264 KB Output is correct
26 Correct 6 ms 33264 KB Output is correct
27 Correct 6 ms 33264 KB Output is correct
28 Correct 82 ms 33264 KB Output is correct
29 Correct 41 ms 33264 KB Output is correct
30 Correct 7 ms 33264 KB Output is correct
31 Correct 10 ms 33264 KB Output is correct
32 Correct 9 ms 33264 KB Output is correct
33 Correct 8 ms 33264 KB Output is correct
34 Correct 41 ms 33264 KB Output is correct
35 Correct 6 ms 33264 KB Output is correct
36 Correct 6 ms 33264 KB Output is correct
37 Correct 7 ms 33264 KB Output is correct
38 Correct 6 ms 33264 KB Output is correct
39 Correct 5 ms 33264 KB Output is correct
40 Correct 864 ms 33264 KB Output is correct
41 Correct 820 ms 33264 KB Output is correct
42 Correct 710 ms 33272 KB Output is correct
43 Correct 234 ms 33272 KB Output is correct
44 Correct 207 ms 33272 KB Output is correct
45 Correct 655 ms 33272 KB Output is correct
46 Correct 657 ms 33272 KB Output is correct
47 Correct 803 ms 33272 KB Output is correct
48 Correct 247 ms 33272 KB Output is correct
49 Correct 766 ms 33272 KB Output is correct
50 Correct 750 ms 33272 KB Output is correct
51 Correct 584 ms 33272 KB Output is correct