oj.uz

Submission #1083866

# Submission time Handle Problem Language Result Execution time Memory
1083866 2024-09-04T11:18:46 Z steveonalex Robot (JOI21_ho_t4) C++17
100 / 100
 249 ms 59068 KB 
#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.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14428 KB Output is correct
2 Correct 3 ms 14428 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 3 ms 14428 KB Output is correct
5 Correct 3 ms 14428 KB Output is correct
6 Correct 3 ms 14428 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 3 ms 14428 KB Output is correct
9 Correct 4 ms 14728 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 4 ms 14820 KB Output is correct
12 Correct 4 ms 14684 KB Output is correct
13 Correct 4 ms 14940 KB Output is correct
14 Correct 4 ms 14936 KB Output is correct
15 Correct 4 ms 14684 KB Output is correct
16 Correct 5 ms 14772 KB Output is correct
17 Correct 4 ms 14684 KB Output is correct
18 Correct 3 ms 14428 KB Output is correct
19 Correct 4 ms 14780 KB Output is correct
20 Correct 4 ms 14684 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 30156 KB Output is correct
2 Correct 31 ms 21200 KB Output is correct
3 Correct 88 ms 41932 KB Output is correct
4 Correct 49 ms 25040 KB Output is correct
5 Correct 205 ms 54788 KB Output is correct
6 Correct 191 ms 53764 KB Output is correct
7 Correct 148 ms 54944 KB Output is correct
8 Correct 187 ms 55380 KB Output is correct
9 Correct 197 ms 55328 KB Output is correct
10 Correct 98 ms 37832 KB Output is correct
11 Correct 72 ms 33620 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14428 KB Output is correct
2 Correct 3 ms 14428 KB Output is correct
3 Correct 3 ms 14428 KB Output is correct
4 Correct 3 ms 14428 KB Output is correct
5 Correct 3 ms 14428 KB Output is correct
6 Correct 3 ms 14428 KB Output is correct
7 Correct 3 ms 14684 KB Output is correct
8 Correct 3 ms 14428 KB Output is correct
9 Correct 4 ms 14728 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 4 ms 14820 KB Output is correct
12 Correct 4 ms 14684 KB Output is correct
13 Correct 4 ms 14940 KB Output is correct
14 Correct 4 ms 14936 KB Output is correct
15 Correct 4 ms 14684 KB Output is correct
16 Correct 5 ms 14772 KB Output is correct
17 Correct 4 ms 14684 KB Output is correct
18 Correct 3 ms 14428 KB Output is correct
19 Correct 4 ms 14780 KB Output is correct
20 Correct 4 ms 14684 KB Output is correct
21 Correct 72 ms 30156 KB Output is correct
22 Correct 31 ms 21200 KB Output is correct
23 Correct 88 ms 41932 KB Output is correct
24 Correct 49 ms 25040 KB Output is correct
25 Correct 205 ms 54788 KB Output is correct
26 Correct 191 ms 53764 KB Output is correct
27 Correct 148 ms 54944 KB Output is correct
28 Correct 187 ms 55380 KB Output is correct
29 Correct 197 ms 55328 KB Output is correct
30 Correct 98 ms 37832 KB Output is correct
31 Correct 72 ms 33620 KB Output is correct
32 Correct 71 ms 43212 KB Output is correct
33 Correct 91 ms 39900 KB Output is correct
34 Correct 136 ms 44232 KB Output is correct
35 Correct 106 ms 39880 KB Output is correct
36 Correct 123 ms 39156 KB Output is correct
37 Correct 132 ms 47908 KB Output is correct
38 Correct 149 ms 59068 KB Output is correct
39 Correct 100 ms 53584 KB Output is correct
40 Correct 216 ms 56664 KB Output is correct
41 Correct 223 ms 57084 KB Output is correct
42 Correct 199 ms 51908 KB Output is correct
43 Correct 78 ms 33816 KB Output is correct
44 Correct 147 ms 57516 KB Output is correct
45 Correct 146 ms 45908 KB Output is correct
46 Correct 136 ms 44716 KB Output is correct
47 Correct 138 ms 44584 KB Output is correct
48 Correct 249 ms 57840 KB Output is correct