oj.uz

Submission #837138

# Submission time Handle Problem Language Result Execution time Memory
837138 2023-08-25T02:51:30 Z TS_2392 Robot (JOI21_ho_t4) C++14
100 / 100
 1262 ms 108580 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second

template<class T1, class T2> bool minimize(T1 &a, T2 b){return a > b ? a = b, true : false;}
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 3;
const ll oo = 1e18;
struct adjNode{
    pii v;
    int c, p;
};
struct elem_in_PQ{
    ll dist;
    int vtx, c;
    bool operator < (const elem_in_PQ &oth) const{
        return dist > oth.dist;
    }
};
int n, m;
map<int, ll> sump[N], d[N];
priority_queue<elem_in_PQ> pq;
map<int, vector<adjNode> > adj[N];
void add_edge(pii a, pii b, int c, int p){
    adj[a.fi][a.se].push_back({b, c, p});
    adj[b.fi][b.se].push_back({a, c, p});
}
int main(){
   	ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for(int i = 1; i <= m; ++i){
        int u, v, c, p;
        cin >> u >> v >> c >> p;

        add_edge({u, 0}, {v, 0}, c, p);
        add_edge({u, 0}, {v, c}, c, p);
        add_edge({u, c}, {v, 0}, c, p);

        d[u][c] = oo; d[v][c] = oo;
        sump[u][c] += p; sump[v][c] += p;
    }
    for(int u = 1; u <= n; ++u) d[u][0] = oo;
    d[1][0] = 0; pq.push({0LL, 1, 0});
    while(!pq.empty()){
        pii u = {pq.top().vtx, pq.top().c};
        ll du = pq.top().dist; pq.pop();
        if(du != d[u.fi][u.se]) continue;
        for(auto [v, c, p] : adj[u.fi][u.se]){
            if(u.se == 0){
                if(v.se == 0 && minimize(d[v.fi][v.se], min(1LL * p, sump[u.fi][c] - p) + du)) pq.push({d[v.fi][v.se], v.fi, v.se});
                if(v.se != 0 && minimize(d[v.fi][v.se], du)) pq.push({d[v.fi][v.se], v.fi, v.se});
            }
            else if(minimize(d[v.fi][v.se], sump[u.fi][c] - p + du)) pq.push({d[v.fi][v.se], v.fi, v.se});
        }
    }
    cout << (d[n][0] == oo ? -1 : d[n][0]);
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:51:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   51 |         for(auto [v, c, p] : adj[u.fi][u.se]){
      |                  ^

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14280 KB Output is correct
3 Correct 7 ms 14416 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14384 KB Output is correct
7 Correct 8 ms 14548 KB Output is correct
8 Correct 7 ms 14440 KB Output is correct
9 Correct 11 ms 15348 KB Output is correct
10 Correct 10 ms 15188 KB Output is correct
11 Correct 8 ms 14932 KB Output is correct
12 Correct 8 ms 15020 KB Output is correct
13 Correct 8 ms 15100 KB Output is correct
14 Correct 9 ms 15060 KB Output is correct
15 Correct 8 ms 14804 KB Output is correct
16 Correct 8 ms 14932 KB Output is correct
17 Correct 8 ms 14932 KB Output is correct
18 Correct 8 ms 14676 KB Output is correct
19 Correct 9 ms 14804 KB Output is correct
20 Correct 11 ms 14932 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 216 ms 43292 KB Output is correct
2 Correct 76 ms 29208 KB Output is correct
3 Correct 187 ms 44484 KB Output is correct
4 Correct 138 ms 35104 KB Output is correct
5 Correct 1202 ms 108332 KB Output is correct
6 Correct 951 ms 98068 KB Output is correct
7 Correct 452 ms 78416 KB Output is correct
8 Correct 508 ms 77452 KB Output is correct
9 Correct 511 ms 77464 KB Output is correct
10 Correct 389 ms 65088 KB Output is correct
11 Correct 194 ms 54592 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14280 KB Output is correct
3 Correct 7 ms 14416 KB Output is correct
4 Correct 7 ms 14292 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 7 ms 14384 KB Output is correct
7 Correct 8 ms 14548 KB Output is correct
8 Correct 7 ms 14440 KB Output is correct
9 Correct 11 ms 15348 KB Output is correct
10 Correct 10 ms 15188 KB Output is correct
11 Correct 8 ms 14932 KB Output is correct
12 Correct 8 ms 15020 KB Output is correct
13 Correct 8 ms 15100 KB Output is correct
14 Correct 9 ms 15060 KB Output is correct
15 Correct 8 ms 14804 KB Output is correct
16 Correct 8 ms 14932 KB Output is correct
17 Correct 8 ms 14932 KB Output is correct
18 Correct 8 ms 14676 KB Output is correct
19 Correct 9 ms 14804 KB Output is correct
20 Correct 11 ms 14932 KB Output is correct
21 Correct 216 ms 43292 KB Output is correct
22 Correct 76 ms 29208 KB Output is correct
23 Correct 187 ms 44484 KB Output is correct
24 Correct 138 ms 35104 KB Output is correct
25 Correct 1202 ms 108332 KB Output is correct
26 Correct 951 ms 98068 KB Output is correct
27 Correct 452 ms 78416 KB Output is correct
28 Correct 508 ms 77452 KB Output is correct
29 Correct 511 ms 77464 KB Output is correct
30 Correct 389 ms 65088 KB Output is correct
31 Correct 194 ms 54592 KB Output is correct
32 Correct 128 ms 38860 KB Output is correct
33 Correct 163 ms 40132 KB Output is correct
34 Correct 514 ms 64928 KB Output is correct
35 Correct 360 ms 54840 KB Output is correct
36 Correct 419 ms 67432 KB Output is correct
37 Correct 431 ms 73360 KB Output is correct
38 Correct 480 ms 80804 KB Output is correct
39 Correct 138 ms 47180 KB Output is correct
40 Correct 521 ms 77452 KB Output is correct
41 Correct 557 ms 77420 KB Output is correct
42 Correct 638 ms 86340 KB Output is correct
43 Correct 270 ms 47968 KB Output is correct
44 Correct 423 ms 60416 KB Output is correct
45 Correct 451 ms 70184 KB Output is correct
46 Correct 410 ms 69108 KB Output is correct
47 Correct 410 ms 70716 KB Output is correct
48 Correct 1262 ms 108580 KB Output is correct