oj.uz

Submission #918016

# Submission time Handle Problem Language Result Execution time Memory
918016 2024-01-29T11:53:49 Z imarn Robot (JOI21_ho_t4) C++14
0 / 100
 1106 ms 81796 KB 
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define vp vector<pii>
using namespace std;
const int N=1e5+5;
ll d[N];
map<int,vector<pll>>g[N];
map<int,ll>sum[N];
map<ll,ll>dp[N];
int main(){
    int n,m;cin>>n>>m;
    while(m--){
        int a,b,c,d;cin>>a>>b>>c>>d;
        g[a][c].pb({b,d});
        g[b][c].pb({a,d});
        sum[a][c]+=d;sum[b][c]+=d;
    }d[1]=0;for(int i=2;i<=n;i++)d[i]=1e18;
    priority_queue<pair<pll,int>,vector<pair<pll,int>>,greater<pair<pll,int>>>q;
    q.push({{d[1],1},0});
    while(!q.empty()){
        auto u=q.top();q.pop();
        if(u.s){
            if(dp[u.f.s][u.s]!=u.f.f)continue;
            for(auto v:g[u.f.s][u.s]){
                if(d[v.f]>u.f.f+sum[u.f.s][u.s]-v.s){
                    d[v.f]=u.f.f+sum[u.f.s][u.s]-v.s;
                    q.push({{d[v.f],v.f},0});
                }
            }
        }else {
            if(d[u.f.s]!=u.f.f)continue;
            for(auto it : g[u.f.s]){
                for(auto v:it.s){
                    if(d[v.f]>u.f.f+min(v.s,sum[u.f.s][it.f]-v.s)){
                        d[v.f]=u.f.f+min(v.s,sum[u.f.s][it.f]-v.s);
                        q.push({{d[v.f],v.f},0});
                    }
                    if(dp[v.f].find(it.f)==dp[v.f].end()||dp[v.f][it.f]>u.f.f){
                        dp[v.f][it.f]=u.f.f;q.push({{dp[v.f][it.f],v.f},it.f});
                    }
                }
            }
        }
    }cout<<d[n];
}

Subtask #1
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Incorrect 4 ms 14940 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 34524 KB Output is correct
2 Correct 87 ms 24812 KB Output is correct
3 Correct 197 ms 31684 KB Output is correct
4 Correct 172 ms 27916 KB Output is correct
5 Correct 1106 ms 81796 KB Output is correct
6 Correct 882 ms 71944 KB Output is correct
7 Correct 435 ms 54648 KB Output is correct
8 Correct 566 ms 49304 KB Output is correct
9 Correct 508 ms 49200 KB Output is correct
10 Incorrect 401 ms 47220 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14940 KB Output is correct
2 Incorrect 4 ms 14940 KB Output isn't correct
3 Halted 0 ms 0 KB -