oj.uz

Submission #548153

# Submission time Handle Problem Language Result Execution time Memory
548153 2022-04-12T14:31:54 Z AA_Surely Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 430 ms 51800 KB 
#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int N = 2e5 + 7;
const int ALPHA = 27;
const LL INF = 1e18;
const int MOD = 1e9 + 7;
const int LOG = 22;

LL n, m, s, t, u, v;
LL deg[N], rm[N];
bool colored[N];

LL dist[N], sdist[N], udist[N], vdist[N];
LL mnu[N], mnv[N];

VPLL adj[N];
VLL dag[N], par[N], order, rdag[N];

void sdijk() {
    fill(sdist, sdist + n, INF);
    
    sdist[s] = 0;
    priority_queue<PLL> keep;
    keep.push({0, s});

    while(!keep.empty()) {
        int now = keep.top().S;

        keep.pop();

        for(auto [on, w] : adj[now]) {
            if (sdist[on] > sdist[now] + w) {
                sdist[on] = sdist[now] + w;

                keep.push({-sdist[on], on});
            }

        }
    }

    F0R(i, n) for(auto [on, w] : adj[i]) 
        if (sdist[on] + w == sdist[i]) par[i].pb(on);
    

    return;
}

void odijk(int sc) {
    fill(dist, dist + n, INF);
    dist[sc] = 0;

    priority_queue<PLL> keep;
    keep.push({0, sc});

    while(!keep.empty()) {
        int now = keep.top().S;
        keep.pop();

        for(auto [on, w] : adj[now]) if (dist[on] > dist[now] + w) {
            dist[on] = dist[now] + w;
            keep.push({-dist[on], on});
        }
    }

    return;
}

void clarify() {
    F0R(i, n) for(int on : par[i])
        deg[on]++;
    
    queue<int> dl;
    F0R(i, n) if (!deg[i] && i != t) 
        dl.push(i);
        
    while(!dl.empty()) {
        int now = dl.front();
        dl.pop();

        for(int on : par[now]) {
            deg[on]--;
            if (!deg[on] && on != t) dl.push(on);
        }

        rm[now] = 1;
    }

    F0R(i, n) if (!rm[i]) for(int on : par[i]) {
        if (!rm[on]) {
            dag[on].pb(i);
            rdag[i].pb(on);
        }
    }

    return;
}

void dfs(int now) {
    colored[now] = 1;
    for(int on : dag[now]) if (!colored[on]) 
        dfs(on);

    order.pb(now);
    return;
}

int main() {
    IOS;
    
    cin >> n >> m >> s >> t >> u >> v;
    s--; t--; v--; u--;

    F0R(i, m) {
        LL a, b, w; cin >> a >> b >> w;
        adj[--a].pb({--b, w});
        adj[b].pb({a, w});
    }

    sdijk();

    odijk(u);
    F0R(i, n) udist[i] = dist[i];

    odijk(v);
    F0R(i, n) vdist[i] = dist[i];

    clarify();

    dfs(s);
    reverse(ALL(order));

    fill(mnu, mnu + n, INF);
    fill(mnv, mnv + n, INF);

    LL ans = INF;

    for(int now : order) {
        for(int on : rdag[now]) {
            mnu[now] = min(mnu[now], mnu[on]);
            mnv[now] = min(mnv[now], mnv[on]);
        }

        mnu[now] = min(mnu[now], udist[now]);
        mnv[now] = min(mnv[now], vdist[now]);

        ans = min({ans, udist[now] + mnv[now], vdist[now] + mnu[now]});
    }

    ans = min(ans, udist[v]);

    cout << ans;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 38700 KB Output is correct
2 Correct 295 ms 41232 KB Output is correct
3 Correct 334 ms 51788 KB Output is correct
4 Correct 324 ms 42452 KB Output is correct
5 Correct 307 ms 46268 KB Output is correct
6 Correct 313 ms 42444 KB Output is correct
7 Correct 372 ms 46796 KB Output is correct
8 Correct 307 ms 46328 KB Output is correct
9 Correct 290 ms 42900 KB Output is correct
10 Correct 322 ms 42756 KB Output is correct
11 Correct 145 ms 41272 KB Output is correct
12 Correct 374 ms 42672 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 42668 KB Output is correct
2 Correct 377 ms 46340 KB Output is correct
3 Correct 370 ms 45612 KB Output is correct
4 Correct 316 ms 46044 KB Output is correct
5 Correct 430 ms 47280 KB Output is correct
6 Correct 307 ms 50484 KB Output is correct
7 Correct 357 ms 51800 KB Output is correct
8 Correct 375 ms 46220 KB Output is correct
9 Correct 297 ms 47260 KB Output is correct
10 Correct 318 ms 45596 KB Output is correct
11 Correct 146 ms 44152 KB Output is correct
12 Correct 362 ms 50976 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 20996 KB Output is correct
2 Correct 11 ms 19128 KB Output is correct
3 Correct 12 ms 19156 KB Output is correct
4 Correct 24 ms 22612 KB Output is correct
5 Correct 17 ms 20924 KB Output is correct
6 Correct 11 ms 19300 KB Output is correct
7 Correct 12 ms 19276 KB Output is correct
8 Correct 13 ms 19572 KB Output is correct
9 Correct 11 ms 19300 KB Output is correct
10 Correct 24 ms 20820 KB Output is correct
11 Correct 14 ms 19188 KB Output is correct
12 Correct 11 ms 19156 KB Output is correct
13 Correct 11 ms 19236 KB Output is correct
14 Correct 11 ms 19156 KB Output is correct
15 Correct 10 ms 19208 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 38700 KB Output is correct
2 Correct 295 ms 41232 KB Output is correct
3 Correct 334 ms 51788 KB Output is correct
4 Correct 324 ms 42452 KB Output is correct
5 Correct 307 ms 46268 KB Output is correct
6 Correct 313 ms 42444 KB Output is correct
7 Correct 372 ms 46796 KB Output is correct
8 Correct 307 ms 46328 KB Output is correct
9 Correct 290 ms 42900 KB Output is correct
10 Correct 322 ms 42756 KB Output is correct
11 Correct 145 ms 41272 KB Output is correct
12 Correct 374 ms 42672 KB Output is correct
13 Correct 331 ms 42668 KB Output is correct
14 Correct 377 ms 46340 KB Output is correct
15 Correct 370 ms 45612 KB Output is correct
16 Correct 316 ms 46044 KB Output is correct
17 Correct 430 ms 47280 KB Output is correct
18 Correct 307 ms 50484 KB Output is correct
19 Correct 357 ms 51800 KB Output is correct
20 Correct 375 ms 46220 KB Output is correct
21 Correct 297 ms 47260 KB Output is correct
22 Correct 318 ms 45596 KB Output is correct
23 Correct 146 ms 44152 KB Output is correct
24 Correct 362 ms 50976 KB Output is correct
25 Correct 18 ms 20996 KB Output is correct
26 Correct 11 ms 19128 KB Output is correct
27 Correct 12 ms 19156 KB Output is correct
28 Correct 24 ms 22612 KB Output is correct
29 Correct 17 ms 20924 KB Output is correct
30 Correct 11 ms 19300 KB Output is correct
31 Correct 12 ms 19276 KB Output is correct
32 Correct 13 ms 19572 KB Output is correct
33 Correct 11 ms 19300 KB Output is correct
34 Correct 24 ms 20820 KB Output is correct
35 Correct 14 ms 19188 KB Output is correct
36 Correct 11 ms 19156 KB Output is correct
37 Correct 11 ms 19236 KB Output is correct
38 Correct 11 ms 19156 KB Output is correct
39 Correct 10 ms 19208 KB Output is correct
40 Correct 261 ms 41984 KB Output is correct
41 Correct 352 ms 42676 KB Output is correct
42 Correct 264 ms 42584 KB Output is correct
43 Correct 159 ms 45140 KB Output is correct
44 Correct 205 ms 45276 KB Output is correct
45 Correct 312 ms 50584 KB Output is correct
46 Correct 313 ms 50400 KB Output is correct
47 Correct 337 ms 42776 KB Output is correct
48 Correct 144 ms 42672 KB Output is correct
49 Correct 223 ms 42004 KB Output is correct
50 Correct 351 ms 49644 KB Output is correct
51 Correct 305 ms 50556 KB Output is correct