oj.uz

Submission #479840

# Submission time Handle Problem Language Result Execution time Memory
479840 2021-10-13T11:22:21 Z ponytail Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 628 ms 37624 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
int dist[4][100001];
bool cmp(int a, int b) {
    return dist[0][a] < dist[0][b];
}
void solve() {
    int N, M; cin >> N >> M;
    int S[4]; cin >> S[0] >> S[1] >> S[2] >> S[3];
    vector<pair<int, int> > adj[N+1];
    for(int i=0; i<M; i++) {
        int A, B, C; cin >> A >> B >> C;
        adj[A].push_back({B, C});
        adj[B].push_back({A, C});
    }
    int vis[4][N+1];
    for(int i=1; i<=N; i++) {
        dist[0][i] = dist[1][i] = dist[2][i] = dist[3][i] = 1e18;
        vis[0][i] = vis[1][i] = vis[2][i] = vis[3][i] = 0;
    }
    for(int i=0; i<2; i++) {
        dist[i][S[i]] = 0;
        priority_queue<pair<int, int>, vector<pair<int,int> >, greater<pair<int, int> > > pq;
        for(int j=1; j<=N; j++) {
            pq.push({dist[i][j], j});
        }
        while(pq.size()) {
            pair<int, int> t= pq.top(); pq.pop();
            if(!vis[i][t.second]) {
                vis[i][t.second]=1;
                for(auto x : adj[t.second]) {
                    if(!vis[i][x.first] && dist[i][x.first] > dist[i][t.second] + x.second) {
                        dist[i][x.first] = dist[i][t.second] + x.second;
                        pq.push({dist[i][x.first], x.first});
                    }
                }
            }
        }
    }
    int ans = 1e18;
    int allowed[N+1];
    for(int i=1; i<=N; i++) {
        allowed[i] = (dist[0][i] + dist[1][i] == dist[0][S[1]] ? 1 : 0);
    }
    vector<int> dag1[N+1], dag2[N+1]; // small -> big, big -> small
    for(int i=1; i<=N; i++) {
        for(int j=0; j<adj[i].size(); j++) {
            if(allowed[i] && allowed[adj[i][j].first] && dist[0][i] < dist[0][adj[i][j].first]) {
                dag1[i].push_back(adj[i][j].first);
                dag2[adj[i][j].first].push_back(i);
            }
        }
    }
    //Reset
    for(int i=2; i<4; i++) {
        dist[i][S[i]] = 0;
        priority_queue<pair<int, int>, vector<pair<int,int> >, greater<pair<int, int> > > pq;
        for(int j=1; j<=N; j++) {
            pq.push({dist[i][j], j});
        }
        while(pq.size()) {
            pair<int, int> t= pq.top(); pq.pop();
            if(!vis[i][t.second]) {
                vis[i][t.second]=1;
                for(auto x : adj[t.second]) {
                    if(!vis[i][x.first] && dist[i][x.first] > dist[i][t.second] + x.second) {
                        dist[i][x.first] = dist[i][t.second] + x.second;
                        pq.push({dist[i][x.first], x.first});
                    }
                }
            }
        }
    }
    vector<int> all;
    all.push_back(0);
    for(int i=1; i<=N; i++) {
        if(allowed[i]) all.push_back(i);
    }
    sort(all.begin() + 1, all.end(), cmp);
    int A = all.size() - 1;
    int dp[A+1];
    int pos[N+1];
    for(int i=1; i<=A; i++) {
        pos[all[i]] = i;
    }
    for(int i=1; i<=A; i++) {
        dp[i] = dist[2][all[i]];
        for(int x : dag2[all[i]]) {
            dp[i] = min(dp[i], dp[pos[x]]);
        }
        ans = min(ans, dp[i] + dist[3][all[i]]);
        
    }
    reverse(all.begin() + 1, all.end());
    for(int i=1; i<=A; i++) {
        pos[all[i]] = i;
    }
    for(int i=1; i<=A; i++) {
        dp[i] = dist[2][all[i]];
        for(int x : dag1[all[i]]) {
            dp[i] = min(dp[i], dp[pos[x]]);
        }
        ans = min(ans, dp[i] + dist[3][all[i]]);
    }
    ans = min(ans, dist[2][S[3]]);
    cout << ans << '\n';
} 
signed main() {
    int t = 1;// cin >> t;
    while(t--) solve();
}
//6 -> 3 -> 1 -> 8 -> 9
//  12   1    1    1

Compilation message

commuter_pass.cpp: In function 'void solve()':
commuter_pass.cpp:48:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for(int j=0; j<adj[i].size(); j++) {
      |                      ~^~~~~~~~~~~~~~

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 557 ms 31576 KB Output is correct
2 Correct 549 ms 32548 KB Output is correct
3 Correct 605 ms 34888 KB Output is correct
4 Correct 535 ms 31484 KB Output is correct
5 Correct 571 ms 33860 KB Output is correct
6 Correct 566 ms 31536 KB Output is correct
7 Correct 574 ms 34496 KB Output is correct
8 Correct 589 ms 34212 KB Output is correct
9 Correct 529 ms 31228 KB Output is correct
10 Correct 522 ms 31200 KB Output is correct
11 Correct 328 ms 25536 KB Output is correct
12 Correct 566 ms 31260 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 598 ms 32496 KB Output is correct
2 Correct 560 ms 32604 KB Output is correct
3 Correct 581 ms 32316 KB Output is correct
4 Correct 562 ms 32584 KB Output is correct
5 Correct 628 ms 32892 KB Output is correct
6 Correct 606 ms 34504 KB Output is correct
7 Correct 611 ms 34996 KB Output is correct
8 Correct 591 ms 32568 KB Output is correct
9 Correct 567 ms 32948 KB Output is correct
10 Correct 594 ms 32376 KB Output is correct
11 Correct 354 ms 26804 KB Output is correct
12 Correct 591 ms 34752 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 1740 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 42 ms 3056 KB Output is correct
5 Correct 22 ms 1640 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 3 ms 460 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 2 ms 460 KB Output is correct
10 Correct 21 ms 1688 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 2 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 557 ms 31576 KB Output is correct
2 Correct 549 ms 32548 KB Output is correct
3 Correct 605 ms 34888 KB Output is correct
4 Correct 535 ms 31484 KB Output is correct
5 Correct 571 ms 33860 KB Output is correct
6 Correct 566 ms 31536 KB Output is correct
7 Correct 574 ms 34496 KB Output is correct
8 Correct 589 ms 34212 KB Output is correct
9 Correct 529 ms 31228 KB Output is correct
10 Correct 522 ms 31200 KB Output is correct
11 Correct 328 ms 25536 KB Output is correct
12 Correct 566 ms 31260 KB Output is correct
13 Correct 598 ms 32496 KB Output is correct
14 Correct 560 ms 32604 KB Output is correct
15 Correct 581 ms 32316 KB Output is correct
16 Correct 562 ms 32584 KB Output is correct
17 Correct 628 ms 32892 KB Output is correct
18 Correct 606 ms 34504 KB Output is correct
19 Correct 611 ms 34996 KB Output is correct
20 Correct 591 ms 32568 KB Output is correct
21 Correct 567 ms 32948 KB Output is correct
22 Correct 594 ms 32376 KB Output is correct
23 Correct 354 ms 26804 KB Output is correct
24 Correct 591 ms 34752 KB Output is correct
25 Correct 24 ms 1740 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 42 ms 3056 KB Output is correct
29 Correct 22 ms 1640 KB Output is correct
30 Correct 2 ms 460 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 4 ms 460 KB Output is correct
33 Correct 2 ms 460 KB Output is correct
34 Correct 21 ms 1688 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 2 ms 332 KB Output is correct
39 Correct 2 ms 332 KB Output is correct
40 Correct 558 ms 31020 KB Output is correct
41 Correct 573 ms 31232 KB Output is correct
42 Correct 558 ms 31428 KB Output is correct
43 Correct 389 ms 29152 KB Output is correct
44 Correct 384 ms 29140 KB Output is correct
45 Correct 614 ms 37540 KB Output is correct
46 Correct 617 ms 37624 KB Output is correct
47 Correct 552 ms 31392 KB Output is correct
48 Correct 347 ms 29160 KB Output is correct
49 Correct 491 ms 31176 KB Output is correct
50 Correct 583 ms 36036 KB Output is correct
51 Correct 620 ms 37596 KB Output is correct