제출 #1083866

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1083866		steveonalex	Robot (JOI21_ho_t4)	C++17	100 / 100	249 ms	59068 KiB

Main

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct P{
    int i; ll w;
    P(){}
    P(int _i, ll _w){
        i = _i, w = _w;
    }
};

struct compare{
    bool operator () (P a, P b){return a.w > b.w;}
};

const int N = 3e5 + 69;
int n, m; 
vector<array<int, 3>> color_graph[N];
vector<P> graph[N];


int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    cin >> n >> m;
    for(int i = 0; i<m; ++i){
        int u, v, c, w; cin >> u >> v >> c >> w;
        color_graph[u].push_back({{v, c, w}});
        color_graph[v].push_back({{u, c, w}});
    }

    int destination = n;

    for(int i = 1; i<=n; ++i){
        map<int, vector<pair<int, int>>> mp;
        for(auto j: color_graph[i])
            mp[j[1]].push_back({j[0], j[2]});
        for(auto j: mp){
            ll sum = 0;
            for(auto k: j.second) sum += k.second;
            for(auto k: j.second){
                graph[i].push_back(P(k.first, min(sum - k.second, k.second)));
            }


            if (j.second.size() >= 2){
                n++;
                for(auto k: j.second){
                    int u = k.first;
                    graph[u].push_back(P(n, 0));
                    graph[n].push_back(P(u, sum - k.second));
                }
            }
        }
    }

    const ll INF = 1e18;
    vector<ll> dis(n+1, INF);
    vector<bool> visited(n+1);
    dis[1] = 0;
    priority_queue<P, vector<P>, compare> pq;
    pq.push(P(1, 0));
    while(pq.size()){
        P u = pq.top(); pq.pop();
        if (visited[u.i]) continue;
        visited[u.i] = true;

        for(P v: graph[u.i]){
            if (minimize(dis[v.i], dis[u.i] + v.w))
                pq.push(P(v.i, dis[v.i]));
        }
    }

    if (dis[destination] == INF) dis[destination] = -1;
    cout << dis[destination] << "\n";

    cerr << dis[destination] << "\n";

    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

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