oj.uz

Submission #87894

# Submission time Handle Problem Language Result Execution time Memory
87894 2018-12-03T03:29:28 Z updown1 Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 913 ms 47956 KB 
/*
https://codeforces.com/blog/entry/57637?#comment-413356
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, N)
#define ffj For(j, 0, M)
#define ffa ffi ffj
#define s <<" "<<
#define c <<" : "<<
#define w cout
#define e "\n"
#define pb push_back
#define mp make_pair
#define a first
#define b second
#define int ll
const int MAXN=100000, INF=1000000000000000000;
///500,000,000
int N, M, S, T, U, V, du[MAXN], dv[MAXN], d[MAXN], dp1[MAXN], dp2[MAXN];
bool vis[MAXN];
vector<pair<int, int> > adj[MAXN]; /// (node, cost)
vector<int> from[MAXN], to[MAXN];
priority_queue<pair<int, int> > next1; /// (-dist, node)
queue<int> bk;

void sdp1(int at) {
    if (vis[at]) return;
    vis[at] = true;
    dp1[at] = dv[at];
    for (int i: from[at]) {
        sdp1(i);
        dp1[at] = min(dp1[at], dp1[i]);
    }
}
void sdp2(int at) {
    if (vis[at]) return;
    vis[at] = true;
    dp2[at] = dv[at];
    for (int i: to[at]) {
        sdp2(i);
        dp2[at] = min(dp2[at], dp2[i]);
    }
}

main() {
    //ifstream cin("test.in");
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> N >> M >> S >> T >> U >> V; S--; T--; U--; V--;
	ffj {int a, b, d; cin >> a >> b >> d; a--; b--; adj[a].pb(mp(b, d)); adj[b].pb(mp(a, d));}
	ffi du[i] = dv[i] = d[i] = dp1[i] = dp2[i] = INF;
	next1.push(mp(0, U));
	while (!next1.empty()) {
        int d = -next1.top().a; int x = next1.top().b;
        next1.pop();
        if (du[x] < INF) continue;
        du[x] = d;
        for (auto i: adj[x]) if (!vis[i.a]) next1.push(mp(-d-i.b, i.a));
	}
	next1.push(mp(0, V));
	while (!next1.empty()) {
        int d = -next1.top().a; int x = next1.top().b;
        next1.pop();
        if (dv[x] < INF) continue;
        dv[x] = d;
        for (auto i: adj[x]) if (!vis[i.a]) next1.push(mp(-d-i.b, i.a));
	}
	next1.push(mp(0, S));
	while (!next1.empty()) {
        int a = -next1.top().a; int x = next1.top().b;
        next1.pop();
        if (d[x] < INF) continue;
        d[x] = a;
        for (auto i: adj[x]) if (!vis[i.a]) next1.push(mp(-a-i.b, i.a));
	}
	//ffi w<< du[i] s dv[i] s d[i]<<e;
	bk.push(T); vis[T] = true;
	while (!bk.empty()) {
        int x = bk.front(); bk.pop();
        for (auto i: adj[x]) if (d[i.a] + i.b == d[x]) {
            from[x].pb(i.a);
            to[i.a].pb(x);
            if (!vis[i.a]) {
                vis[i.a] = true;
                bk.push(i.a);
            }
        }
	}
	ffi vis[i] = false;
	sdp1(T);
	ffi vis[i] = false;
	sdp2(S);
	//ffi w<< i+1 c dp1[i] s dp2[i]<<e;
	int out = du[V];
	ffi out = min(out, du[i]+min(dp1[i], dp2[i]));
	w<< out<<e;
}

Compilation message

commuter_pass.cpp:48:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 529 ms 29804 KB Output is correct
2 Correct 566 ms 33400 KB Output is correct
3 Correct 584 ms 41480 KB Output is correct
4 Correct 559 ms 41480 KB Output is correct
5 Correct 560 ms 43584 KB Output is correct
6 Correct 648 ms 43584 KB Output is correct
7 Correct 753 ms 44972 KB Output is correct
8 Correct 606 ms 44972 KB Output is correct
9 Correct 571 ms 44972 KB Output is correct
10 Correct 708 ms 44972 KB Output is correct
11 Correct 267 ms 44972 KB Output is correct
12 Correct 545 ms 44972 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 690 ms 44972 KB Output is correct
2 Correct 703 ms 44972 KB Output is correct
3 Correct 720 ms 44972 KB Output is correct
4 Correct 684 ms 44972 KB Output is correct
5 Correct 737 ms 44972 KB Output is correct
6 Correct 754 ms 47044 KB Output is correct
7 Correct 801 ms 47956 KB Output is correct
8 Correct 729 ms 47956 KB Output is correct
9 Correct 695 ms 47956 KB Output is correct
10 Correct 720 ms 47956 KB Output is correct
11 Correct 318 ms 47956 KB Output is correct
12 Correct 762 ms 47956 KB Output is correct

Subtask #3
24.0 / 24.0

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

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 529 ms 29804 KB Output is correct
2 Correct 566 ms 33400 KB Output is correct
3 Correct 584 ms 41480 KB Output is correct
4 Correct 559 ms 41480 KB Output is correct
5 Correct 560 ms 43584 KB Output is correct
6 Correct 648 ms 43584 KB Output is correct
7 Correct 753 ms 44972 KB Output is correct
8 Correct 606 ms 44972 KB Output is correct
9 Correct 571 ms 44972 KB Output is correct
10 Correct 708 ms 44972 KB Output is correct
11 Correct 267 ms 44972 KB Output is correct
12 Correct 545 ms 44972 KB Output is correct
13 Correct 690 ms 44972 KB Output is correct
14 Correct 703 ms 44972 KB Output is correct
15 Correct 720 ms 44972 KB Output is correct
16 Correct 684 ms 44972 KB Output is correct
17 Correct 737 ms 44972 KB Output is correct
18 Correct 754 ms 47044 KB Output is correct
19 Correct 801 ms 47956 KB Output is correct
20 Correct 729 ms 47956 KB Output is correct
21 Correct 695 ms 47956 KB Output is correct
22 Correct 720 ms 47956 KB Output is correct
23 Correct 318 ms 47956 KB Output is correct
24 Correct 762 ms 47956 KB Output is correct
25 Correct 44 ms 47956 KB Output is correct
26 Correct 9 ms 47956 KB Output is correct
27 Correct 10 ms 47956 KB Output is correct
28 Correct 74 ms 47956 KB Output is correct
29 Correct 46 ms 47956 KB Output is correct
30 Correct 11 ms 47956 KB Output is correct
31 Correct 13 ms 47956 KB Output is correct
32 Correct 13 ms 47956 KB Output is correct
33 Correct 10 ms 47956 KB Output is correct
34 Correct 40 ms 47956 KB Output is correct
35 Correct 9 ms 47956 KB Output is correct
36 Correct 8 ms 47956 KB Output is correct
37 Correct 9 ms 47956 KB Output is correct
38 Correct 9 ms 47956 KB Output is correct
39 Correct 10 ms 47956 KB Output is correct
40 Correct 626 ms 47956 KB Output is correct
41 Correct 649 ms 47956 KB Output is correct
42 Correct 696 ms 47956 KB Output is correct
43 Correct 394 ms 47956 KB Output is correct
44 Correct 403 ms 47956 KB Output is correct
45 Correct 889 ms 47956 KB Output is correct
46 Correct 845 ms 47956 KB Output is correct
47 Correct 659 ms 47956 KB Output is correct
48 Correct 395 ms 47956 KB Output is correct
49 Correct 621 ms 47956 KB Output is correct
50 Correct 832 ms 47956 KB Output is correct
51 Correct 913 ms 47956 KB Output is correct