oj.uz

Submission #405920

# Submission time Handle Problem Language Result Execution time Memory
405920 2021-05-17T04:42:52 Z Jarif_Rahman Robot (JOI21_ho_t4) C++17
0 / 100
 287 ms 20496 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
const ll inf = 1e18;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m; cin >> n >> m;
    vector<vector<tuple<int, int, ll>>> v(n);
    for(int i = 0; i < m; i++){
        int a, b, c; ll p; cin >> a >> b >> c >> p; a--, b--, c--;;
        v[a].pb({b, c, p});
        v[b].pb({a, c, p});
    }
    vector<ll> dis(n, inf);
    vector<bool> bl(n, 0);
    priority_queue<pair<ll, int>> pq;
    dis[0] = 0;
    pq.push({0, 0});
    while(!pq.empty()){
        int nd = pq.top().sc; pq.pop();
        if(bl[nd]) continue;
        bl[nd] = 1;
        map<int, ll> mp;
        for(auto [x, c, p]: v[nd]) mp[c]+=p;
        for(auto [x, c, p]: v[nd]){
            ll w = min(p, mp[c]-p);
            if(dis[nd]+w < dis[x]){
                dis[x] = dis[nd]+w;
                pq.push({-dis[x], x});
            }
        }
    }
    cout << (dis[n-1]==inf?-1:dis[n-1]) << "\n";
}

Subtask #1
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Incorrect 3 ms 460 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 6956 KB Output is correct
2 Correct 28 ms 3488 KB Output is correct
3 Correct 83 ms 10796 KB Output is correct
4 Correct 43 ms 5196 KB Output is correct
5 Incorrect 287 ms 20496 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Incorrect 3 ms 460 KB Output isn't correct
10 Halted 0 ms 0 KB -