oj.uz

Submission #45644

# Submission time Handle Problem Language Result Execution time Memory
45644 2018-04-15T17:05:30 Z reality Commuter Pass (JOI18_commuter_pass) C++17
55 / 100
 704 ms 88172 KB 
#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}
const int N = (int)(1e6) + 5;
ll D1[N];
ll D2[N];
ll D3[N];
ll D4[N];
vector < pii > g[N];
int n;
void Go(ll D[],int S) {
	for (int i = 1;i <= n;++i)
		D[i] = 1e18;
	D[S] = 0;
	priority_queue < pair < ll , int > , vector < pair < ll , int > > , greater < pair < ll , int > > > Q;
	Q.push(mp(0,S));
	while (!Q.empty()) {
		const ll cost = Q.top().fi;
		const int node = Q.top().se;
		Q.pop();
		if (cost != D[node])
			continue;
		for (auto it : g[node])
			if (D[it.fi] > D[node] + it.se)
				D[it.fi] = D[node] + it.se,Q.push(mp(D[it.fi],it.fi));
	}
}
ll ans = 1e18;
vi order;
vi G[2][N];
int was[N];
void go(ll d1[],ll d2[],int who) {
	static ll D[N];
	for (int i = 1;i <= n;++i)
		D[i] = d1[i];
	for (auto u : order)
		for (auto v : G[who][u])
			smin(D[u],D[v]);
	for (int i = 1;i <= n;++i)
		smin(ans,D[i] + d2[i]);
}
int main(void)
{
    int m;
    int S,T,U,V;
    cin>>n>>m>>S>>T>>U>>V;
    while (m --) {
    	int a,b,c;
    	cin>>a>>b>>c;
    	g[a].pb(mp(b,c));
    	g[b].pb(mp(a,c));
    }
    Go(D1,S);
    Go(D2,T);
    Go(D3,U);
    Go(D4,V);
    queue < int > q;
    q.push(S);
    was[S] = 1;
    const ll dist = D1[T];
    while (!q.empty()) {
    	int node = q.front();
    	q.pop();
    	order.pb(node);
    	for (auto it : g[node])
    		if (D1[node] + it.se + D2[it.fi] == dist) {
    			G[0][node].pb(it.fi);
    			G[1][it.fi].pb(node);
    			if (!was[it.fi])
	    			was[it.fi] = 1,q.push(it.fi);
    		}
    }
    ans = D3[V];
    for (int cs = 0;cs < 2;++cs) {
	    go(D3,D4,cs);
	    go(D4,D3,cs);
	    reverse(all(order));
	    go(D3,D4,cs);
	    go(D4,D3,cs);
	    reverse(all(order));
	}
    cout << ans << '\n';
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 609 ms 83400 KB Output is correct
2 Correct 618 ms 83400 KB Output is correct
3 Correct 677 ms 85832 KB Output is correct
4 Correct 609 ms 85832 KB Output is correct
5 Correct 629 ms 85832 KB Output is correct
6 Correct 634 ms 85832 KB Output is correct
7 Correct 664 ms 85832 KB Output is correct
8 Correct 639 ms 85832 KB Output is correct
9 Correct 613 ms 85832 KB Output is correct
10 Correct 580 ms 85832 KB Output is correct
11 Correct 309 ms 85832 KB Output is correct
12 Correct 627 ms 85832 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 638 ms 85832 KB Output is correct
2 Correct 677 ms 85832 KB Output is correct
3 Correct 643 ms 85832 KB Output is correct
4 Correct 645 ms 85832 KB Output is correct
5 Correct 675 ms 85832 KB Output is correct
6 Correct 668 ms 85832 KB Output is correct
7 Correct 701 ms 85972 KB Output is correct
8 Correct 704 ms 85972 KB Output is correct
9 Correct 657 ms 85972 KB Output is correct
10 Correct 657 ms 85972 KB Output is correct
11 Correct 373 ms 85972 KB Output is correct
12 Correct 667 ms 85972 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 85972 KB Output is correct
2 Correct 62 ms 85972 KB Output is correct
3 Correct 62 ms 85972 KB Output is correct
4 Correct 111 ms 85972 KB Output is correct
5 Correct 95 ms 85972 KB Output is correct
6 Correct 59 ms 85972 KB Output is correct
7 Correct 61 ms 85972 KB Output is correct
8 Correct 62 ms 85972 KB Output is correct
9 Correct 61 ms 85972 KB Output is correct
10 Correct 82 ms 85972 KB Output is correct
11 Correct 61 ms 85972 KB Output is correct
12 Correct 59 ms 85972 KB Output is correct
13 Correct 61 ms 85972 KB Output is correct
14 Correct 60 ms 85972 KB Output is correct
15 Correct 60 ms 85972 KB Output is correct

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 609 ms 83400 KB Output is correct
2 Correct 618 ms 83400 KB Output is correct
3 Correct 677 ms 85832 KB Output is correct
4 Correct 609 ms 85832 KB Output is correct
5 Correct 629 ms 85832 KB Output is correct
6 Correct 634 ms 85832 KB Output is correct
7 Correct 664 ms 85832 KB Output is correct
8 Correct 639 ms 85832 KB Output is correct
9 Correct 613 ms 85832 KB Output is correct
10 Correct 580 ms 85832 KB Output is correct
11 Correct 309 ms 85832 KB Output is correct
12 Correct 627 ms 85832 KB Output is correct
13 Correct 638 ms 85832 KB Output is correct
14 Correct 677 ms 85832 KB Output is correct
15 Correct 643 ms 85832 KB Output is correct
16 Correct 645 ms 85832 KB Output is correct
17 Correct 675 ms 85832 KB Output is correct
18 Correct 668 ms 85832 KB Output is correct
19 Correct 701 ms 85972 KB Output is correct
20 Correct 704 ms 85972 KB Output is correct
21 Correct 657 ms 85972 KB Output is correct
22 Correct 657 ms 85972 KB Output is correct
23 Correct 373 ms 85972 KB Output is correct
24 Correct 667 ms 85972 KB Output is correct
25 Correct 85 ms 85972 KB Output is correct
26 Correct 62 ms 85972 KB Output is correct
27 Correct 62 ms 85972 KB Output is correct
28 Correct 111 ms 85972 KB Output is correct
29 Correct 95 ms 85972 KB Output is correct
30 Correct 59 ms 85972 KB Output is correct
31 Correct 61 ms 85972 KB Output is correct
32 Correct 62 ms 85972 KB Output is correct
33 Correct 61 ms 85972 KB Output is correct
34 Correct 82 ms 85972 KB Output is correct
35 Correct 61 ms 85972 KB Output is correct
36 Correct 59 ms 85972 KB Output is correct
37 Correct 61 ms 85972 KB Output is correct
38 Correct 60 ms 85972 KB Output is correct
39 Correct 60 ms 85972 KB Output is correct
40 Correct 661 ms 85972 KB Output is correct
41 Correct 629 ms 85972 KB Output is correct
42 Correct 622 ms 85972 KB Output is correct
43 Correct 376 ms 85972 KB Output is correct
44 Correct 380 ms 85972 KB Output is correct
45 Correct 691 ms 88172 KB Output is correct
46 Incorrect 696 ms 88172 KB Output isn't correct
47 Halted 0 ms 0 KB -