Submission #685089

#	Time	Username	Problem	Language	Result	Execution time	Memory
685089		saayan007	Robot (JOI21_ho_t4)	C++17	0 / 100	3081 ms	18120 KiB

Main

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pi = pair<int, int>;
using pl = pair<long long, long long>;
using vi = vector<int>;
using vl = vector<long long>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<long long, long long>>;

#define fur(i, a, b) for(ll i = a; i <= (ll)b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= (ll)b; --i)
#define fr first 
#define sc second
#define mp make_pair
#define pb emplace_back
#define nl "\n"
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

struct DEdge {
    ll to, col, wt;

    DEdge(ll to, ll col, ll wt) : to(to), col(col), wt(wt) {}
};

int main() 
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    ll n, m;
    cin >> n >> m;

    vector<DEdge> adj[n + 1];
    fur(i, 1, m) {
        ll a, b, c, p;
        cin >> a >> b >> c >> p;
        adj[a].pb(b, c, p);
        adj[b].pb(a, c, p);
    }

    bool proc[n + 1] = {};
    ll dist[n + 1];
    fur(i, 0, n) {
        dist[i] = -1;
    }

    priority_queue<pl> q;
    dist[1] = 0;
    // q.emplace(-dist[1], 1);
    q.push(mp(-dist[1], 1));

    while(!q.empty()) {
        ll a = q.top().sc;
        q.pop();
        if(proc[a])
            continue;
        proc[a] = 1;

        ll cost[m + 1] = {};
        for(auto [b, c, p] : adj[a]) {
            cost[c] += p;   
        }

        ll min_cost = cost[1];
        fur(i, 1, m) {
            min_cost = min(min_cost, cost[i]);
        }

        for(auto [b, c, p] : adj[a]) {
            if(proc[b])
                continue;

            ll wt = 0;
            if(cost[c] > p) {
                wt = min_cost + p;
            }

            if(dist[b] == -1 || dist[b] > dist[a] + wt) {
                dist[b] = dist[a] + wt;
                // q.emplace(-dist[b], b);
                q.push(mp(-dist[b], b));
            }
        }
    }

  cout << dist[n] << nl;
}

• Subtask 1: 0 / 34
• Subtask 2: 0 / 24
• Subtask 3: 0 / 42