oj.uz

Submission #948471

# Submission time Handle Problem Language Result Execution time Memory
948471 2024-03-18T06:44:07 Z seriouslyFlawed Commuter Pass (JOI18_commuter_pass) C++17
100 / 100
 221 ms 23988 KB 
//#pragma GCC optimize("03,unroll-loops")

#include <bits/stdc++.h>

using namespace std;

// Shortcuts for common operations
#define pb push_back
#define p push
#define ppb pop_back
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define ll long long
//#define int ll
#define endl "\n"
#define sz(x) (int)x.size()

// Type definitions for convenience
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vvi;
typedef vector<pii> vii;

// Debugging macros
#define debug(x) cerr << #x << " = " << (x) << '\n'
#define debug_vector(v) _debug_vector(#v, v)
template<typename T>
void _debug_vector(const string& name, const vector<T>& a) {
    cerr << name << " = [ ";
    for(const auto &x : a) cerr << x << ' ';
    cerr << "]\n";
}

// I/O redirection for local testing
#define iofile(io) \
        freopen((io + ".in").c_str(), "r", stdin); \
        freopen((io + ".out").c_str(), "w", stdout);

// delta for floodfill
vi dx = {0, 1, 0, -1};
vi dy = {1, 0, -1, 0};

// extended deltas for floodfill
vi edx = {0, 1, 0, -1, 1, 1, -1, -1};
vi edy = {1, 0, -1, 0, 1, -1, 1, -1};

// Common outputs
void yes() { cout << "YES" << '\n'; }
void no() { cout << "NO" << '\n'; }

const ll INF = 1e15;
int n, m, home, school, bookstore, cafe;

void dij(int src, vector<vii>&adj, vll &dist){
    dist[src] = 0;
    priority_queue<pll>pq;
    pq.p({0, src});

    while(!pq.empty()){
        auto [len, node] = pq.top();
        pq.pop();

        len *= -1;

        if(dist[node] < len) continue;

        for(auto [_neigh, _cost]: adj[node]){
            if(dist[_neigh] > _cost + len){
                dist[_neigh] = _cost + len;
                pq.p({-dist[_neigh], _neigh});
            }
        }
    }
}

vector<pll>memo;

pll dfs(int node, ll delta, vll &dist, vll &distB, vll &distC, vector<vector<pii>>&adj){
    if(memo[node].f != -1 and memo[node].s != -1) return memo[node];
    ll distToB = distB[node];
    ll distToC = distC[node];

    if(node == home) return {distToB, distToC};

    for(auto [_neigh, _cost] : adj[node]){
        if(dist[_neigh] == delta - _cost){
            auto [_distToB, _distToC] = dfs(_neigh, delta - _cost, dist, distB, distC, adj);
            _distToB = min(_distToB, distB[node]);
            _distToC = min(_distToC, distC[node]);

            if(_distToB + _distToC < distToB + distToC) distToB = _distToB, distToC = _distToC;
        }
    }

    return memo[node] = {distToB, distToC};
}

void fx() {
    // Functionality for fx
    cin >> n >> m >> home >> school >> bookstore >> cafe;

    home--;
    school--;
    bookstore--;
    cafe--;

    vector<vii>adj(n);
    memo.assign(n, {-1, -1});
    while(m--){
        int src, dest, cost;
        cin >> src >> dest >> cost;
        src--;
        dest--;

        adj[src].pb({dest, cost});
        adj[dest].pb({src, cost});
    }

    vll dist(n, INF), distB(n, INF), distC(n, INF);

    dij(home, adj, dist);
    dij(bookstore, adj, distB);
    dij(cafe, adj, distC);

    auto [distToB, distToC] = dfs(school, dist[school], dist, distB, distC, adj);

    cout << min(distToB + distToC, distB[cafe]) << endl;

}

signed main() {

    cin.tie(0)->sync_with_stdio(0);
    // Uncomment the following lines for file I/O
    // iofile(string("hello"));
    
    // Uncomment the following lines for multiple test cases
    // int t; cin >> t; while(t--) fx();
    
    // Single test case
    fx();
    
    return 0;
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 17060 KB Output is correct
2 Correct 221 ms 14868 KB Output is correct
3 Correct 166 ms 23988 KB Output is correct
4 Correct 155 ms 19636 KB Output is correct
5 Correct 204 ms 18120 KB Output is correct
6 Correct 149 ms 19988 KB Output is correct
7 Correct 188 ms 18204 KB Output is correct
8 Correct 169 ms 18428 KB Output is correct
9 Correct 156 ms 18996 KB Output is correct
10 Correct 140 ms 18852 KB Output is correct
11 Correct 63 ms 16208 KB Output is correct
12 Correct 175 ms 19008 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 16060 KB Output is correct
2 Correct 176 ms 16528 KB Output is correct
3 Correct 193 ms 15844 KB Output is correct
4 Correct 176 ms 16304 KB Output is correct
5 Correct 189 ms 17044 KB Output is correct
6 Correct 164 ms 19448 KB Output is correct
7 Correct 194 ms 20168 KB Output is correct
8 Correct 180 ms 16460 KB Output is correct
9 Correct 175 ms 17068 KB Output is correct
10 Correct 161 ms 16000 KB Output is correct
11 Correct 62 ms 16464 KB Output is correct
12 Correct 167 ms 23576 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1116 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 13 ms 1628 KB Output is correct
5 Correct 6 ms 1112 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 5 ms 1112 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 166 ms 17060 KB Output is correct
2 Correct 221 ms 14868 KB Output is correct
3 Correct 166 ms 23988 KB Output is correct
4 Correct 155 ms 19636 KB Output is correct
5 Correct 204 ms 18120 KB Output is correct
6 Correct 149 ms 19988 KB Output is correct
7 Correct 188 ms 18204 KB Output is correct
8 Correct 169 ms 18428 KB Output is correct
9 Correct 156 ms 18996 KB Output is correct
10 Correct 140 ms 18852 KB Output is correct
11 Correct 63 ms 16208 KB Output is correct
12 Correct 175 ms 19008 KB Output is correct
13 Correct 167 ms 16060 KB Output is correct
14 Correct 176 ms 16528 KB Output is correct
15 Correct 193 ms 15844 KB Output is correct
16 Correct 176 ms 16304 KB Output is correct
17 Correct 189 ms 17044 KB Output is correct
18 Correct 164 ms 19448 KB Output is correct
19 Correct 194 ms 20168 KB Output is correct
20 Correct 180 ms 16460 KB Output is correct
21 Correct 175 ms 17068 KB Output is correct
22 Correct 161 ms 16000 KB Output is correct
23 Correct 62 ms 16464 KB Output is correct
24 Correct 167 ms 23576 KB Output is correct
25 Correct 5 ms 1116 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 13 ms 1628 KB Output is correct
29 Correct 6 ms 1112 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 5 ms 1112 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 146 ms 20352 KB Output is correct
41 Correct 141 ms 19052 KB Output is correct
42 Correct 178 ms 19100 KB Output is correct
43 Correct 61 ms 17396 KB Output is correct
44 Correct 73 ms 17336 KB Output is correct
45 Correct 159 ms 17796 KB Output is correct
46 Correct 141 ms 17604 KB Output is correct
47 Correct 183 ms 19636 KB Output is correct
48 Correct 82 ms 13396 KB Output is correct
49 Correct 123 ms 19928 KB Output is correct
50 Correct 169 ms 18016 KB Output is correct
51 Correct 142 ms 17860 KB Output is correct